Revision notes

Input-Output: Practice

The key points, rules to remember, tables and diagrams from all 9 lessons, on one page for quick revision. To keep a copy, use your browser's Print and choose "Save as PDF".

Lesson 1

Word arrangement machines

StepArrangement
Inputpear fig apple kiwi date
Iapple pear fig kiwi date
IIapple date pear fig kiwi
IIIapple date fig pear kiwi
IVapple date fig kiwi pear

Find what moves at Step I, confirm at Step II, then apply the rule. A machine with n words finishes in at most n - 1 steps.

— Rule to remember

Key takeaways: describe the rule in words, check it on two steps, and write each step in full.

Read the full lesson

Lesson 2

Number arrangement machines

StepArrangement
Input35 82 14 67 50
I82 35 14 67 50
II82 67 35 14 50
III82 67 50 35 14

A step in which a number is already in place still counts as a step.

— Rule to remember

Key takeaways: note the direction and order, remember steps in which nothing moves still count, and verify the final arrangement.

Read the full lesson

Lesson 3

Finding the rule from steps

Compare input and Step I: did positions change or did values change?

— Rule to remember

Key takeaways: decide if positions or values change, state the rule once in words, then apply it step by step.

Read the full lesson

Lesson 4

Rotation and shifting patterns

A rotation machine repeats after n steps for n items. Skip ahead using the remainder.

— Rule to remember

Key takeaways: a rotation moves the first item to the end, and with n items the pattern repeats every n steps.

Read the full lesson

Lesson 5

Two-condition machines and exam practice

Deal with each group separately; note which group keeps its order.

— Rule to remember

Key takeaways: treat each group separately, write each step, and stop when every condition is satisfied.

Read the full lesson

Lesson 6

Counting steps: which step, how many steps, and when the machine stops

StepArrangement
Input48 15 72 30 63
I15 48 72 30 63
II15 30 48 72 63
III15 30 48 72 63
IV15 30 48 63 72

The machine stops when the items still waiting are already in order. A step in which nothing moves still counts as a step.

— Rule to remember
StepArrangement
Input18 42 7 35 26
I42 18 7 35 26
II42 35 18 7 26
III42 35 26 18 7

Key takeaways. Write each step in full. A step with no change still counts. Report the first step at which an arrangement appears. The machine stops when the remaining items are in order.

Read the full lesson

Lesson 7

Other orderings: word length, reverse alphabet and the right-hand end

StepArrangement
Inputlion rabbit ox tiger cat
Iox lion rabbit tiger cat
IIox cat lion rabbit tiger
IIIox cat lion rabbit tiger
IVox cat lion tiger rabbit
StepArrangement
Input34 71 18 56 40
I34 18 56 40 71
II34 18 40 56 71
III34 18 40 56 71
IV18 34 40 56 71

Decide two things before you start: which item moves next (smallest, largest, shortest, last in the dictionary) and which end it moves to (left or right).

— Rule to remember

Key takeaways. Settle the order and the end before Step I. Equal-length words need a stated tie-break. Steps in which an item is already in place still count. For a right-hand-end machine, the result reads in ascending order from left to right when the largest goes to the right first.

Read the full lesson

Lesson 8

Machines that handle words and numbers together

Write two lists first: the words in dictionary order and the numbers from largest to smallest. Then each step takes the next unused item from the right list.

— Rule to remember
StepArrangement
Inputjam 48 fig 73 axe 25
Iaxe jam 48 fig 73 25
IIaxe jam 48 fig 25 73
IIIaxe fig jam 48 25 73
IVaxe fig jam 25 48 73
StepArrangement
Input64 hat 27 dew 85 kit 30
Idew 64 hat 27 85 kit 30
IIdew 64 hat 27 kit 30 85
IIIdew hat 64 27 kit 30 85
IVdew hat 27 kit 30 64 85
Vdew hat kit 27 30 64 85

Key takeaways. Words are built up from the left, numbers from the right. Odd steps move a word and even steps move a number, unless the rule says otherwise. Prepare the two ordered lists first, then place one item per step and recount the line each time.

Read the full lesson

Lesson 9

Swap, position and value machines: rules that change items instead of ordering them

StepArrangement
Input7 12 5 9 3 8
I8 12 5 9 3 7
II8 3 5 9 12 7
III8 3 9 5 12 7
StepArrangement
Input10 20 30 40
I14 17 34 37
II18 14 38 34
III22 11 42 31
StepArrangement
Input14 9 20 7
I7 14 10 12
II12 7 5 6
III6 12 10 3

Ask two questions about every rule: does it act on places or on values, and is it applied to the previous step or to the input?

— Rule to remember

Key takeaways. For a swap machine, the number of steps is half the number of items, rounded down. For place rules, count places from the left each time. For value rules, test odd or even afresh at each step. Always build on the previous step.

Read the full lesson

Privacy · Terms · Refunds · Delivery