Computer Science GCSE
Step-by-step execution of algorithms
What Step-by-step execution of algorithms means in Computer Science GCSE, as defined for Pearson Edexcel.
Definition of Step-by-step execution of algorithms
Check what you remember
Read the wording for your board, then hide it and explain Step-by-step execution of algorithms in your own words. Rough notes are fine. This is a self-check, with no mark or grade.
Reference: Pearson Edexcel
Working through each statement in order, updating every variable as its value changes, and respecting sequence, selection and iteration.
Topics that use Step-by-step execution of algorithms
- Algorithms (Pearson Edexcel GCSE)
Related terms
- Arithmetic operators
- Binary search
- Bubble sort
- Linear search
- Logic error
- Logical operators
- Merge sort
- Modulus
Using Step-by-step execution of algorithms in the exam
Check the command word and mark scheme for your exact question. After comparing your explanation with the reference, use the term in an answer on the linked topic. This practice does not predict an exam mark.
Practise Computer Science questions
Create a free account to answer exam-style questions on this topic and get feedback on your answers.
Start free
All Computer Science GCSE termsA week of Premium from your first lesson · Then the free plan continues · No card, no charge