←

Fundamentals of algorithms

From Paper 1: Computational thinking and programming skills
11 mark
Which one of the following best describes abstraction?
From Paper 1: Computational thinking and programming skills
3.13 marks
The algorithm below is written in AQA pseudo-code.
total ← 0FOR i ← 1 TO 5  IF i MOD 2 = 1 THEN    total ← total + i  ENDIFENDFOROUTPUT total
State the value of total at the end of each iteration of the FOR loop, and the final output.
From Paper 1: Computational thinking and programming skills
3.21 mark
State the purpose of the algorithm in 03.1.
From Paper 1: Computational thinking and programming skills
4.12 marks
Explain why a binary search cannot be used on the list [19, 3, 40, 8, 25].
From Paper 1: Computational thinking and programming skills
4.23 marks
Show the steps a binary search takes to find 31 in the list [3, 8, 12, 19, 25, 31, 40].
From Paper 1: Computational thinking and programming skills
4.32 marks
Compare the efficiency of linear search and binary search on a large sorted list.
From Paper 1: Computational thinking and programming skills
5.12 marks
Show the result of the first pass of a bubble sort (ascending) on the list [7, 3, 9, 1].
From Paper 1: Computational thinking and programming skills
5.22 marks
Give one advantage and one disadvantage of merge sort compared with bubble sort.
From Paper 1: Computational thinking and programming skills
15.23 marks
Trace the algorithm and state the output.
n ← 13count ← 0WHILE n ≠ 1  IF n MOD 2 = 0 THEN    n ← n DIV 2  ELSE    n ← 3 * n + 1  ENDIF  count ← count + 1ENDWHILEOUTPUT count
Score 0 / 19 · 0 of 9 marked

This paper is written by Plasmo in the style of the AQA GCSE Computer Science exam. It is not a past paper and is not produced or endorsed by the exam board.

Fundamentals of algorithms Exam Questions: AQA GCSE Computer Science | Plasmo