Preserve intermediate states and operation order.
Review ordered changes, conditional branches, simultaneous replacement, grid transposition and set operations, with new examples and clear score limits.
Six original items each contribute one correct answer. A count out of six describes this fixed bank, without an ability band, percentile or employer threshold. All six explanations and this full guide remain available at every count.
The rule is given; execution is the task
These six items supply the transformation rather than asking you to guess an unrestricted pattern. They include ordered row operations, a conditional branch, an expanding substitution, a small grid transpose and a set difference operation. Read whether a step uses the original input or the current intermediate result. The same familiar words can produce different outputs when their order changes. A correct response keeps the representation and every explicit condition, not just the last operation mentioned.
A fresh two-step calculation
Start with KLMN. Rotate right once to obtain NKLM, then reverse that current row to obtain MLKN. If you reverse first, the row becomes NMLK, and rotating right then produces KNML instead. Neither sequence is more correct in isolation; the prompt specifies which order applies. Write the intermediate row after each arrow. This makes an order error visible immediately rather than leaving you to compare several final options by intuition.
Evaluate the condition at the stated moment
If a prompt says to inspect the original first token, record that fact before changing the row. Select the matching branch once, execute it, and continue to any unconditional final step. Do not reevaluate the same condition after a rotation moves a different token to the front unless the instructions explicitly request that loop. Keep the branch decision and the resulting row on separate lines. Confusing a one-time branch with a repeated procedure can change both the path and the answer.
Simultaneous expansion reads the original tokens
For a fresh substitution, let P become QR, Q become P and R become Q. An original PQ gives QR followed by P, or QRP. The newly written Q and R are output, not new inputs awaiting replacement. The result can be longer than the source because a single original token expands. Use separators such as QR|P while calculating, then remove the separators from the final string. This is a fully specified rewriting exercise, not a real coding interpreter running in the page.
Track grid dimensions and set membership
Transposing rows GH / IJ / KL creates columns-as-rows GIK / HJL, so row-wise reading gives GIKHJL. The grid changes from three-by-two to two-by-three. For a different operation on sets {P,Q} and {Q,R}, keeping members in exactly one set leaves {P,R}; the shared Q disappears. Grid order is essential, while written set order is not. Do not transfer a row-reversal habit to a set or treat a transpose as a rotation.
Check invariants before selecting an option
A rotation and reversal preserve row length and token counts. A complement or expanding replacement may not. Before choosing, check the expected output size and the allowed symbol universe, then inspect the detailed order or membership. After a mistake, locate the first intermediate state that differs from the rationale. Create a new input with distinct symbols to test the same procedure. This separates a rule-reading error from an accidental final match caused by repeated symbols.
Interpret the six operation checks
A count here describes six authored tasks with exact local rules. It does not establish programming skill, spatial ability, working-memory capacity, IQ or success in an employer assessment. There is no countdown, population norm, clinical interpretation or certified threshold. All explanations and the public guide remain available even with no correct answers. If notation is unfamiliar, read the definitions and work slowly; the practice is designed for inspecting procedures, and its estimated duration is editorial rather than observed completion data.