Abstraction, decomposition, trace tables, flowcharts, efficiency. Jun 2022 Q5(a)-(d) and Jun 2023 Q4 both extensively tested algorithms.
—
Best score
—
Last attempt
Best attempt progress
0
XP earned
Watch first — Craig 'n' Dave
Craig 'n' Dave · Edexcel 1CP2Computational Thinking and Algorithms
Key facts
Computational thinking — fill in the table
Term
Definition
Abstraction
Decomposition
Algorithmic thinking
Subprograms (functions and procedures) — fill in the table
Benefit
Explanation
Reusability
Easier maintenance
Abstraction
Team development
Readability
Library sharing
Flowcharts — symbols — fill in the table
All arrows must be directed. No hanging symbols. Every path must lead to a terminator. (Jun 2023 Q4(c), Jun 2022 Q5(d) both asked for flowcharts.)
Symbol
Meaning
Oval/ellipse
Rectangle/parallelogram
Rectangle
Diamond
Exam questions — 4 questions · 11 marks · from real 1CP2 past papers
1 markAbstraction definition1CP2 Jun 2024 Q1(a) style
Which of the following best defines abstraction in computational thinking?
A Breaking a problem into smaller sub-problems
B Designing an algorithm to solve a problem step by step
C Hiding or removing unnecessary detail to focus on what is essential
D Reaching a conclusion after testing a solution
2 marksSubprogram benefits1CP2 Jun 2024 Q1(b) style
Give two benefits of using subprograms (functions/procedures) in a program. (2 marks)
Hint: Give two distinct benefits. Do not say just "easier/faster" — qualify with why.
+20 XP
4 marksTrace table1CP2 Jun 2023 Q4(a) and Jun 2022 Q5(c) style
Complete the trace table for this algorithm:
count = 0
reject = 0
for i = 1 to 4
weight = input()
if weight < 395 OR weight > 405 then
reject = reject + 1
else
count = count + 1
end if
next i
print count, reject
Inputs: 404, 393, 395, 405
Fill in: count, reject, weight after each iteration. (4 marks)
Hint: Work through each iteration. Check: is weight < 395 OR > 405? If yes: reject++. If no (395-405 inclusive): count++. Track all variables each step.
+40 XP
4 marksFlowchart1CP2 Jun 2022 Q5(d) / Jun 2023 Q4(c) style
Describe (as a list of steps) a flowchart algorithm that: takes two integers as input, and displays whether the first is greater than, equal to, or less than the second. Include all required flowchart elements. (4 marks)
Hint: Plan: Start → Input two numbers → Decision (first > second?) → if yes: print Greater → if no: Decision (first == second?) → if yes: Equal → if no: Less Than → Stop. Every diamond needs Yes/No labels.