Loading…
9 of 9 objectives have lessons · 0 studied · 0 secure
What Cambridge says you should be able to do, in our words. Codes are the topic number plus the objective’s position.
Understand that an algorithm is a solution to a problem expressed as a sequence of defined steps.
Taught in: Algorithms — fundamentals, identifier tables, and basic pseudocode · 1 question
Use suitable identifier names to represent the data used by a problem, and represent these in an identifier table.
Taught in: Algorithms — fundamentals, identifier tables, and basic pseudocode · 1 question
Write pseudocode that contains input, process and output.
Taught in: Algorithms — fundamentals, identifier tables, and basic pseudocode · 1 question
Write pseudocode using the three basic constructs of sequence, selection and iteration (repetition).
Taught in: Algorithms — control structures and documenting algorithms · 2 questions
Document a simple algorithm using a structured English description, a flowchart or pseudocode.
Taught in: Algorithms — control structures and documenting algorithms · 1 question
Write pseudocode from: a structured English description; a flowchart.
Taught in: Algorithms — flowcharts and converting between representations · 2 questions
Draw a flowchart from: a structured English description; pseudocode.
Taught in: Algorithms — flowcharts and converting between representations · 1 question
Describe and use the process of stepwise refinement to express an algorithm to a level of detail from which the task may be programmed.
Taught in: Algorithms — stepwise refinement and logic statements · 1 question
Use logic statements to define parts of an algorithm solution.
Taught in: Algorithms — stepwise refinement and logic statements · 2 questions