Analysis and design of algorithms for a given situation

Analysis and design of algorithms for a given situation.

2.3.1 Algorithms

Algorithms — Note 1 of 6

Candidates need to be able to write algorithms using flowcharts, pseudocode and program code. Candidates need to be able to follow the OCR pseudocode guide but are not expected to write in its syntax. Code does not need to be syntactically perfect but must use appropriate structures and techniques.

What you need to know

You need to be able to design algorithms for a given situation and express them using flowcharts, pseudocode or program code. Your code does not need to be syntactically perfect, but it must use appropriate structures and techniques.

What to know

Start by identifying the inputs, outputs, processes and any preconditions.
Decompose the problem and choose suitable data structures.
Express the algorithm using a flowchart, pseudocode or program code. You can follow the OCR pseudocode guide, but you do not have to write in its syntax.
Analyse the algorithm by tracing it with test data (including boundary cases) to check it is correct.
Consider the efficiency of the algorithm in terms of time and memory.

Exam technique

Tip:Section B questions are based on a scenario; read it carefully and use the variable and data names it gives.
Mistake:Writing code that asks for new input inside a function instead of using the parameters passed to it.

← Previous topicBacktracking, data mining, heuristics, performance modelling, pipelining and visualisation2.2.2 Computational Methods Next note →The suitability of different algorithms for a given task and data set, in terms of execution time and space2.3.1 Algorithms

Back to Algorithms