Problem Solving — Revision Notes
4CP0 Topic 1: algorithms, standard algorithms, trace tables, decomposition, abstraction and computational thinking.
Computer Science (Edexcel) IGCSE: 1 revision note.
What this topic covers
- Understand what an algorithm is, what algorithms are used for and be able to interpret algorithms (flowcharts, pseudocode, written descriptions, program code).
- Understand how to create an algorithm to solve a particular problem, making use of programming constructs (sequence, selection, iteration) and using appropriate conventions (flowchart, pseudocode, written description, draft program code).
- Understand the purpose of a given algorithm and how an algorithm works.
- Understand how to determine the correct output of an algorithm for a given set of data.
- Understand how to identify and correct errors in algorithms, including using trace tables.
- Understand how to code an algorithm in a high-level language.
- Understand how the choice of algorithm is influenced by the data structures and data values that need to be manipulated.
- Understand how standard algorithms work (bubble sort, merge sort, linear search, binary search).
- Be able to evaluate the fitness for purpose of algorithms in meeting specified requirements efficiently, using logical reasoning and test data. 1.2 Decomposition and abstraction
- Be able to analyse a problem, investigate requirements (inputs, outputs, processing, initialisation) and design solutions.
- Be able to decompose a problem into smaller sub-problems.
- Understand how abstraction can be used effectively to model aspects of the real world.
- Be able to program abstractions of real-world examples.
Study this topic
- Revision Notes (this page)
- Topic Questions
- Past Papers & Mark Schemes
Other Computer Science (Edexcel) IGCSE topics
See what a plan unlocks — or start with the free material in every subject.