Cambridge A Level ยท 9608 ยท Paper 4 ยท Further problem-solving & programming
Computer Science 9608/42 May/June 2018 past paper
Cambridge A Level Computer Science (9608) (previous syllabus, now 9618) Paper 4 (Further problem-solving & programming), variant 2, May/June 2018: the question paper and its official mark scheme, 4 questions worth 57 marks, with the grade thresholds. Free to open, no account needed.
- Questions
- 4
- Marks
- 75
- Grade A from
- 55
File names: 9608_s18_qp_42 ยท 9608_s18_ms_42
Grade thresholds for 9608/42 May/June 2018
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 |
|---|---|---|---|---|
| 55 | 48 | 40 | 32 | 25 |
Topics in this paper
Which syllabus chapters 9608/42 May/June 2018 tested, by marks. Each chapter links to every past-paper question on it.
| Chapter | Questions | Marks |
|---|---|---|
| Computational thinking and Problem-solving | 2 | 31 |
| Further Programming | 2 | 26 |
Questions in 9608/42 May/June 2018
- Question 2
A declarative language is used to represent the following facts and rules about iguanas and lizards. 01 has(reptile, cold_blood). 02 has(reptile, air_breathing). 03 has(reptile, scales). 04 05 is_a(squamata, reptile). 06 is_a(iguana, squamata). 07 is_a(lizard, squamata). 08 is_a(green_iguana, iguana). 09 is_a(cayman, โฆ
- Question 3
The arrays PollData[1:10] and CardData[1:10] store data. PollData โฆ
- Question 4
X-Games is an international extreme sports competition. A program will store and process data about the teams in the competition. โข Each team is made up of members. โข Members can be added and removed from each team. โข Each โฆ
- Question 6
An Abstract Data Type (ADT) is used to create an unordered binary tree. The binary tree is created as an array of nodes. Each node consists of a data value and two pointers. A record type, Node, is declared using โฆ
Other Computer Science papers from May/June 2018
- 9608/11 Theory fundamentals
- 9608/12 Theory fundamentals
- 9608/13 Theory fundamentals
- 9608/21 Fundamental problem-solving & programming
- 9608/22 Fundamental problem-solving & programming
- 9608/23 Fundamental problem-solving & programming
- 9608/31 Advanced theory
- 9608/32 Advanced theory
- 9608/33 Advanced theory
- 9608/41 Further problem-solving & programming
- 9608/43 Further problem-solving & programming