Back to Computer SciencePractice this
Paper 1
Algorithms and Computational Thinking
Both
Algorithms are the logic that powers every program.
Key Facts
- Selection uses IF/ELSE logic; iteration uses loops.
- Binary search requires sorted data.
- Merge sort is faster on large data sets.
- Flowcharts and pseudocode should follow standard conventions.
Topics Covered
Algorithm Design
What you need to know
- •Define the problem inputs, processes, and outputs.
- •Use sequence, selection, and iteration in logic.
Exam Tips
- Always label inputs and outputs before writing pseudocode.
Trace Tables
What you need to know
- •Step through the algorithm line by line.
- •Track variable values at each step.
Exam Tips
- Show all intermediate values, not just the final output.
Efficiency and Big O
What you need to know
- •Explain why some algorithms are faster or more efficient.
- •Understand linear vs quadratic growth.
Exam Tips
- Describe growth in simple terms if Big O is not required.
Standard Algorithms
What you need to know
- •Know bubble sort, merge sort, and linear/binary search.
- •Explain when to use each algorithm.
Exam Tips
- Be able to trace the first few passes of a sort.
Key Terms
iteration
Repeating steps using a loop.
selection
Choosing a path using a condition.
trace table
A table showing variable values step by step.
Loading practice drills...
Common Exam Questions
Explain why binary search is faster than linear search on large lists.
3 marksmediumPaper 1
Model Answer
Binary search halves the search space each step, reducing comparisons.
What examiners want to see
- ✓Halving
- ✓Fewer comparisons
Related Topics
Other topics you might find useful