Cambridge A Level ยท 9608 ยท Paper 4 ยท Further problem-solving & programming
Computer Science 9608/42 May/June 2021 past paper
Cambridge A Level Computer Science (9608) (previous syllabus, now 9618) Paper 4 (Further problem-solving & programming), variant 2, May/June 2021: the question paper and its official mark scheme, 7 questions worth 68 marks, with the grade thresholds. Free to open, no account needed.
- Questions
- 7
- Marks
- 75
- Grade A from
- 50
File names: 9608_s21_qp_42 ยท 9608_s21_ms_42
Grade thresholds for 9608/42 May/June 2021
The minimum raw marks Cambridge set for each grade on this component (out of 75). Thresholds change every session and variant, so always compare your score with the paper you actually sat.
| A | B | C | D | E |
|---|---|---|---|---|
| 50 | 39 | 32 | 24 | 16 |
Topics in this paper
Which syllabus chapters 9608/42 May/June 2021 tested, by marks. Each chapter links to every past-paper question on it.
| Chapter | Questions | Marks |
|---|---|---|
| Further Programming | 2 | 34 |
| Computational thinking and Problem-solving | 3 | 24 |
| Software Development | 1 | 5 |
| Processor Fundamentals | 1 | 5 |
Questions in 9608/42 May/June 2021
- Question 1
An ordered binary tree stores the following data: Horse Donkey Kangaroo Cat Elephant (a) Identify the data in the root node of the binary tree. (b) Identify the data in one leaf node from the binary tree. (c) Complete the โฆ
- Question 2
A company stores bookings in a random file. For each booking, the booking ID, customer ID, item ID and quantity are stored. These four values are all integers. (a) Write the pseudocode record declaration for the data type Booking. (b) โฆ
- Question 3
Ejaz is creating a program that will allow the user to create quizzes. He is using object-oriented programming (OOP). There are two classes: QuestionClass and QuizClass. The class attributes and methods are in the following tables. All attributes are declared โฆ
- Question 4
Zara is writing a program to simulate a circular queue. The queue, MyNumbers, has 10 elements. Enqueue() takes a parameter value and stores it at the tail of the queue. Dequeue()returns the item at the head of the queue. The โฆ
- Question 5
The following procedure performs an insertion sort on the global array TheArray that has 10 elements. Complete the pseudocode for the procedure InsertionSort(). PROCEDURE InsertionSort() DECLARE Count : INTEGER DECLARE Counter : INTEGER DECLARE Temp : INTEGER Count WHILE Count โฆ
- Question 7
Anika is designing a computer game. The user controls a character that moves around a virtual world. When the character meets an animal: โข if the animalโs strength is less than 10, the animal runs away โข if the animalโs โฆ
- Question 8
The table shows assembly language instructions for a processor that has one general purpose register, the Accumulator (ACC), and an Index Register (IX). Instruction Explanation Label Op code Operand LDM #n Immediate addressing. Load the number n to ACC LDD โฆ
Other Computer Science papers from May/June 2021
- 9618/11 Theory fundamentals
- 9618/12 Theory fundamentals
- 9618/13 Theory fundamentals
- 9608/11 Theory fundamentals
- 9608/12 Theory fundamentals
- 9608/13 Theory fundamentals
- 9618/21 Problem-solving & programming
- 9618/22 Problem-solving & programming
- 9618/23 Problem-solving & programming
- 9608/21 Fundamental problem-solving & programming
- 9608/22 Fundamental problem-solving & programming
- 9608/23 Fundamental problem-solving & programming
- 9618/31 Advanced theory
- 9618/32 Advanced theory
- 9618/33 Advanced theory
- 9608/31 Advanced theory
- 9608/32 Advanced theory
- 9608/33 Advanced theory
- 9618/41 Practical programming
- 9618/42 Practical programming
- 9618/43 Practical programming
- 9608/41 Further problem-solving & programming
- 9608/43 Further problem-solving & programming