2.1 Algorithms

1. The part of a flowchart that contains a single instruction (7)
5. Asks a question in a flowchart and each arrow leaving the shape must have one possible answer to the question written alongside it (8)
6. Putting data into an order (e.g numerical, alphabetical chronological, ascending, descending) (7)
8. A series of instructions that describes how to solve a specific problem (9)
10. A search algorithm that begins at one end of a data structure, checking each data item in turn until the required item is found or the end of the structure is reached (6, 6)

2. Hiding the layers of complexity within a system, in order to focus on one specific layer of complexity (11)
3. A cross between English and a generic-looking programming language (10)
4. A search algorithm that begins in the middle of a data structure, eliminating half of the data with each pass. Only appropriate when data has already been sorted (6, 6)
7. When one sequence of instructions but not another is executed (9)
9. Reaching a solution using a systematic approach, as opposed to jumping straight to the solution (11, 8)

Get Revising