0478.7.0.07: Use different methods to design and • Including: past paper questions
Real questions on 0478.7.0.07: use different methods to design and • including
The newest 18 of 18 written questions. Open one to see it on the real paper.
- 0478/22 · February/March 2026 · Q6a[5]
Complete the trace table for the algorithm, using the given sentence. Note: the start position of the sentence is index 1. Sentence SentLength Computing is fun 16 LetterNo Start Word OUTPUT
See it on the paper → - 0478/22 · February/March 2026 · Q6b[3]
Explain the purpose of the algorithm shown by the flowchart.
See it on the paper → - 0478/21 · October/November 2025 · Q5[4]
A hotel booking system is an example of a computer system that is made up of sub-systems. The booking system: • • allows the user to select the room type and the number of nights required displays the types of rooms available to the user as pictures or as a list. Complete the structure diagram for the given parts of th...
See it on the paper → - 0478/23 · October/November 2025 · Q2[4]
Four descriptions of programming techniques and five programming techniques are given. 2 Draw one line from each description to the relevant technique. Not all techniques will be used. Description Programming technique output adding up a set of numbers selection displaying the result of a calculation totalling executin...
See it on the paper → - 0478/23 · October/November 2025 · Q4b[4]
Each booking must have at least one adult ticket. Explain how the algorithm could be changed to repeatedly ask for the number of adult tickets if the number input is less than 1. Any code used must be fully explained.
See it on the paper → - 0478/23 · October/November 2025 · Q6b[1]
Identify the standard method of solution used by the flowchart.
See it on the paper → - 0478/22 · October/November 2024 · Q1[1]
A solution to a problem may be represented using pseudocode, flowcharts or
See it on the paper → - 0478/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 → - 0478/22 · February/March 2024 · Q6[4]
Describe two types of iteration that a programmer can use whilst writing a program.
See it on the paper → - 0478/23 · October/November 2022 · Q1c[6]
Write an algorithm for the part of Task 2 that calculates the total cost of the bill. Assume that the customer details and services required have already been input. Use pseudocode, programming statements or a flowchart.
See it on the paper → - 0478/23 · October/November 2022 · Q2b[3]
Describe how the algorithm could be changed to output the number of times each value has been input, starting with the highest value.
See it on the paper → - 0478/23 · October/November 2022 · Q4b[3]
Explain how you could extend the algorithm to allow for the sale of more than one wheelbarrow at a time.
See it on the paper → - 0478/22 · May/June 2022 · Q1e[3]
Explain how your program decides when a family ticket is better value in Task 3. Any programming statements that you include in your answer must be fully explained.
See it on the paper → - 0478/22 · May/June 2021 · Q3a[3]
Draw the most appropriate flowchart symbol for each pseudocode statement.
See it on the paper → - 0478/22 · May/June 2021 · Q3b[3]
State the type of each pseudocode statement. For example, X ← X + Y is totalling.
See it on the paper → - 0478/22 · October/November 2020 · Q5b[2]
the purpose of the algorithm.
See it on the paper → - 0478/22 · February/March 2020 · Q1e[4]
Explain how your program completed Task 3. Assume that Task 2 has been completed. Any programming statements used in your answer must be fully explained. Section B starts on page 8. Section B
See it on the paper → - 0478/21 · May/June 2019 · Q1b[6]
Write an algorithm to show how you calculated and output the number of late arrivals and the average number of minutes late for each bus route (part of Task 2), using either pseudocode, programming statements or a flowchart.
See it on the paper →
What examiners said
Comprehensive responses • Many candidates traced the algorithm and completed the trace table. • Some candidates completed the trace table with no errors. Limited responses • Some candidates need to follow the algorithm to be traced and complete the table as they go, until the algorithm completes.
— Examiner report, February/March 2026, 0478/22 Q6(a) (Cambridge)
Comprehensive responses • Most candidates demonstrating understanding of the purpose of the algorithm represented by the given flowchart. Limited responses • Some candidates did not give enough detail in their response to completely cover the purpose of the algorithm. • Some candidates did not give a sufficiently detailed response to match the fact that this was an ‘explain’ question.
— Examiner report, February/March 2026, 0478/22 Q6(b) (Cambridge)
Many responses providing pseudocode, code or a flowchart for Task 2 scored high marks. Some responses seen incorrectly included more than required by the question as they covered the whole of Task 2. Common errors seen included applying a percentage increase for both 2 and 3 floors and incorrect percentage calculations.
— Examiner report, October/November 2022, 0478/23 Q1(c) (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.