0478.7.0.18: Complete a trace table to document a dry-run • Including, at each step in an algorithm: past paper questions
Real questions on 0478.7.0.18: complete a trace table to document a dry-run • including, at each step in an algorithm
The newest 20 of 33 written questions. Open one to see it on the real paper.
- 0478/22 · May/June 2026 · Q6a[1]
Complete the trace table for the algorithm, using the input data: post, Y, committee, N, bookkeeper Note: the first character of each word is in position 1. Word WordLength Count NumLetter Choice OUTPUT
See it on the paper → - 0478/22 · October/November 2025 · Q5a[6]
The first data row of the trace table shows the values currently stored in CodeStore[] Complete the trace table for the algorithm, using the input data: 7686, Face, Speed, 432U, Yp79 CodeStore[] Store Count aBcd 1532 Face 63q8 OUTPUT Code
See it on the paper → - 0478/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 → - 0478/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 → - 0478/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 → - 0478/23 · May/June 2025 · Q6a[8]
Complete the trace table for the algorithm, using input data: COMPUTER Store[] Word Index Letter OUTPUT
See it on the paper → - 0478/22 · February/March 2025 · Q7a[5]
Complete the trace table for the input data: Y, 7, S, 9, Y, 5, M, 12, Y, 25, D, 5, N, 10, A, 6 Answer Value1 Operator Value2 OUTPUT
See it on the paper → - 0478/22 · October/November 2024 · Q7a[5]
This pseudocode represents an algorithm. An input of –1 will terminate the algorithm. Complete the trace table for the input data: 5, 6, –1, 20, 9, 4
See it on the paper → - 0478/23 · October/November 2024 · Q10a[6]
Password Accept Index Found OUTPUT Data: MYWORD (a) Complete the three trace tables using the data shown for each one. Data: M!word Password Accept Index Found OUTPUT Accept Index Found OUTPUT Data: My!Hidden Password
See it on the paper → - 0478/21 · May/June 2024 · Q6a[7]
Complete the trace table for the input data: 7, 47, 50, 52, 60, 80, 63, 70
See it on the paper → - 0478/23 · May/June 2024 · Q5a[6]
Complete the trace table for the input data: 10, 30, 18, 8, 25, 12, 17, 2, 50, 15, 5 L S T A Limit Count Value OUTPUT
See it on the paper → - 0478/23 · October/November 2023 · Q8a[5]
Complete the trace table using this data: Y, Y, Y, N, Y, Y, Y, Y, N, Y, Y, Y, Y Accept Reject PartOK Error OUTPUT
See it on the paper → - 0478/23 · October/November 2023 · Q8b[3]
Describe how the algorithm should be changed to accept ‘Y’ or ‘y’ for a successfully manufactured part.
See it on the paper → - 0478/21 · May/June 2023 · Q7a[4]
Complete the trace table for the algorithm by using the input data: F, Y, D, N
See it on the paper → - 0478/23 · May/June 2023 · Q7a[6]
Complete the trace table for the input data: 5, 50, 52, 555, 57, 500, –1, 5500, 55 Total Value Five1 Five2 Ten1 Ten2 OUTPUT
See it on the paper → - 0478/22 · February/March 2023 · Q8a[4]
Complete the trace table using this data: 5.50, 3.40, 6.25, 3.85, –11.00, 0 NumberSales Total SaleValue Average OUTPUT
See it on the paper → - 0478/21 · October/November 2022 · Q4a[4]
Complete the trace table for the algorithm using this input data: 24, 12, 6, 30, 12, 18, –1, 24
See it on the paper → - 0478/23 · October/November 2022 · Q4a[4]
Complete the trace table for the algorithm using this input data: “Y”, “Y”, “Y”, “Y”, “Y”, “Y”, “N” Stock Total Sale OUTPUT
See it on the paper → - 0478/21 · May/June 2022 · Q5a[5]
the trace table for the algorithm using this input data: 8, 66, 606, 6226, 8448, 642, 747, 77, 121
See it on the paper → - 0478/22 · May/June 2022 · Q4a[7]
Complete the trace table for the algorithm using this input data: 75, 78, 84, 87, 91, 80, 75, 70, 65, 62, –1, 20
See it on the paper →
What examiners said
The majority of candidates completed the trace table correctly. The trace table could have been answered in one of two ways, either entry of one input data, as there was no loop back to enter more or complete the table with all the data.
— Examiner report, May/June 2025, 0478/21 Q10(a) (Cambridge)
A mixed range of responses for this trace table question. Some candidates correctly completed the trace table for the first and last letters of each word, but they did not take it any further. Many candidates did fully complete the trace table.
— Examiner report, May/June 2025, 0478/22 Q6(a) (Cambridge)
Candidates who systematically followed the algorithm and completed the table as they went, achieved the highest marks.
— Examiner report, May/June 2025, 0478/23 Q6(a) (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.