Algorithm design and problem-solving: past paper questions
Real questions on algorithm design and problem-solving
The newest 20 of 56 written questions. Open one to see it on the real paper.
- 2210/12 · October/November 2025 · Q2a[4]
Add the two binary numbers using binary addition. Give your answer in binary. Show all of your working. + 11110101 00111001
See it on the paper → - 2210/12 · October/November 2025 · Q2b[3]
A logic right shift of three places is performed on the binary number 11110101. Give the denary number for the binary number that would be stored after the logical shift of three places has occurred. Show all of your working.
See it on the paper → - 2210/22 · October/November 2025 · Q2c(i)[2]
Explain why the given algorithm may not always give the expected results.
See it on the paper → - 2210/22 · October/November 2025 · Q2c(ii)[2]
Explain how you could improve the algorithm so that the search is more likely to find the required results.
See it on the paper → - 2210/23 · October/November 2025 · Q5a[4]
Complete the trace table for the algorithm using the following numbers: 563, 21, 376, 99, 400 Count Number Lowest Highest
See it on the paper → - 2210/21 · May/June 2025 · Q10a[3]
Complete the trace table for the algorithm, using the input data: 21, 46, 63, 91, 12 Score Grade OUTPUT
See it on the paper → - 2210/21 · May/June 2025 · Q10b[4]
Explain how the flowchart can be changed to produce the correct output.
See it on the paper → - 2210/22 · May/June 2025 · Q2[3]
A fence measuring 2 metres in height and 20 metres in length needs painting. The area of the fence needs to be calculated so that enough paint for the job is purchased. After the task is decomposed, there are three component parts: input, process and output. Three component parts and four example descriptions are shown...
See it on the paper → - 2210/22 · May/June 2025 · Q6a[6]
Complete the trace table for the algorithm, using the input data: 2, RACECAR, TREAT Number Index Word Continue V1 V2 L1 L2 OUTPUT
See it on the paper → - 2210/22 · May/June 2025 · Q6b[1]
State the purpose of the algorithm on page 6.
See it on the paper → - 2210/22 · May/June 2025 · Q6c[3]
Explain how the algorithm knows when all the letters in the word have been checked so that it can stop checking.
See it on the paper → - 2210/22 · May/June 2025 · Q7a[6]
Complete the flowchart. START Count 0 Total 0 Yes No No Yes STOP
See it on the paper → - 2210/22 · October/November 2024 · Q1[1]
Tick (✓) one box to complete this sentence. A solution to a problem may be represented using pseudocode, flowcharts or A procedures. B processes. C structure diagrams.
See it on the paper → - 2210/23 · October/November 2024 · Q2[1]
Tick (✓) one box to show a method used to construct a solution to a problem. A abstraction B structure diagram C test data
See it on the paper → - 2210/21 · May/June 2024 · Q6b[3]
Outline the processes involved in the algorithm shown in the flowchart on page 6.
See it on the paper → - 2210/22 · May/June 2024 · Q6a[4]
Write an algorithm in pseudocode to total the numbers input and to output the total. You do not need to validate the input.
See it on the paper → - 2210/22 · May/June 2024 · Q6b[4]
Write an algorithm in pseudocode to count and output the number of input values that are greater than 100. You do not need to validate the input.
See it on the paper → - 2210/22 · May/June 2024 · Q11[15]
A one-player game uses the two-dimensional (2D) array Grid[] to store the location of a secret cell to be found by the player in 10 moves. Each row and column has 5 cells. Start Grid[1,1] At the start of the game: • • • The program places an ‘X’ in a random cell (not in Grid[1,1]) and empties all the other cells in the...
See it on the paper → - 2210/21 · May/June 2023 · Q1a[4]
Four descriptions of stages in the program development life cycle are shown. Draw one line to link each description to its most appropriate program development life cycle stage. Not all program development life cycle stages will be used. Program development life cycle description Program development life cycle stage de...
See it on the paper → - 2210/21 · May/June 2023 · Q1b[3]
Identify three of the component parts after a problem has been decomposed.
See it on the paper →
What examiners said
Most candidates were able to match the life cycle descriptions to the correct life cycle stage.
— Examiner report, May/June 2023, 2210/21 Q1(a) (Cambridge)
Few candidates were able to provide a fully correct answer. Most candidates did not understand that a program can be split into input, output, process and storage. Candidates either scored all the marks or none of the marks.
— Examiner report, May/June 2023, 2210/21 Q1(b) (Cambridge)
Only stronger candidates were able to correctly identify the type of algorithm used which was a linear search. Many candidates incorrectly identified it as a flowchart.
— Examiner report, May/June 2023, 2210/21 Q7(b) (Cambridge)
Past papers, syllabus and examiner reports © UCLES (Cambridge University Press & Assessment). Questions are matched to topics from the official syllabus. AssessPro is independent and not endorsed by Cambridge.