AQA GCSE COMPUTER SCIENCE Paper 1
Computational thinking and programming skills –
Python (8525/1B) ALREADY GRADED A+|100
QUESTIONS WITH 100%CORRECT ANSWERS
🔹 SECTION 1: Algorithms (Q1–Q15)
Q1. What is an algorithm?
A: A step-by-step process to solve a problem.
Q2. What is decomposition?
A: Breaking a problem into smaller parts.
Q3. What is abstraction?
A: Removing unnecessary detail to focus on key aspects.
Q4. What is a flowchart?
A: A diagram showing steps in an algorithm.
Q5. What does a decision symbol represent?
A: A choice (yes/no).
Q6. What is a linear search?
A: Checking each item sequentially.
Q7. What is a binary search?
A: Searching a sorted list by halving it each step.
Q8. Requirement for binary search?
A: Data must be sorted.
, Q9. Best case for linear search?
A: Item found first.
Q10. Worst case for linear search?
A: Item last or not present.
Q11. What is an array?
A: A collection of elements of the same type.
Q12. What is iteration?
A: Repeating instructions.
Q13. What is selection?
A: Decision-making (if statements).
Q14. What is sequence?
A: Instructions in order.
Q15. What is pseudocode?
A: Structured description of an algorithm.
🔹 SECTION 2: Programming (Q16–Q30)
Q16. What is a variable?
A: A named value that can change.
Q17. What is a constant?
A: A value that does not change.
Q18. What is input?
A: Data entered into a system.
Q19. What is output?
A: Data produced by a system.
Computational thinking and programming skills –
Python (8525/1B) ALREADY GRADED A+|100
QUESTIONS WITH 100%CORRECT ANSWERS
🔹 SECTION 1: Algorithms (Q1–Q15)
Q1. What is an algorithm?
A: A step-by-step process to solve a problem.
Q2. What is decomposition?
A: Breaking a problem into smaller parts.
Q3. What is abstraction?
A: Removing unnecessary detail to focus on key aspects.
Q4. What is a flowchart?
A: A diagram showing steps in an algorithm.
Q5. What does a decision symbol represent?
A: A choice (yes/no).
Q6. What is a linear search?
A: Checking each item sequentially.
Q7. What is a binary search?
A: Searching a sorted list by halving it each step.
Q8. Requirement for binary search?
A: Data must be sorted.
, Q9. Best case for linear search?
A: Item found first.
Q10. Worst case for linear search?
A: Item last or not present.
Q11. What is an array?
A: A collection of elements of the same type.
Q12. What is iteration?
A: Repeating instructions.
Q13. What is selection?
A: Decision-making (if statements).
Q14. What is sequence?
A: Instructions in order.
Q15. What is pseudocode?
A: Structured description of an algorithm.
🔹 SECTION 2: Programming (Q16–Q30)
Q16. What is a variable?
A: A named value that can change.
Q17. What is a constant?
A: A value that does not change.
Q18. What is input?
A: Data entered into a system.
Q19. What is output?
A: Data produced by a system.
