Cambridge A Level ยท 9608 ยท Paper 4 ยท Further problem-solving & programming
Computer Science 9608/43 Oct/Nov 2015 past paper
Cambridge A Level Computer Science (9608) (previous syllabus, now 9618) Paper 4 (Further problem-solving & programming), variant 3, Oct/Nov 2015: the question paper and its official mark scheme, 4 questions worth 117 marks, with the grade thresholds. Free to open, no account needed.
- Questions
- 4
- Marks
- 75
- Grade A from
- 55
File names: 9608_w15_qp_43 ยท 9608_w15_ms_43
Grade thresholds for 9608/43 Oct/Nov 2015
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 | 24 |
Topics in this paper
Which syllabus chapters 9608/43 Oct/Nov 2015 tested, by marks. Each chapter links to every past-paper question on it.
| Chapter | Questions | Marks |
|---|---|---|
| Computational thinking and Problem-solving | 1 | 74 |
| Further Programming | 2 | 27 |
| Data Representation | 1 | 16 |
Questions in 9608/43 Oct/Nov 2015
- Question 2
A declarative programming language is used to represent the following facts and rules: 01 male(ali). 02 male(raul). 03 male(ahmed). 04 male(philippe). 05 female(meena). 06 female(aisha). 07 female(gina). 08 parent(ali, raul). 09 parent(meena, raul). 10 parent(ali, ahmed). 11 parent(meena, ahmed). 12 โฆ
- Question 3
A lending library stocks two types of item for loan: books and CDs. All stock items have a title, the date the item was acquired and whether the item is currently out on loan. Books have an author and ISBN. โฆ
- Question 4
A binary tree Abstract Data Type (ADT) has these associated operations: โข create the tree (CreateTree) โข add an item to tree (Add) โข output items in ascending order (TraverseTree) (a) Show the final state of the binary tree after โฆ
- Question 5
Data about sports club members are stored in a random file of records. โข The key field of a member record is the member ID (range 1000 to 9999). โข Other member data are stored. โข A hashing function is โฆ
Other Computer Science papers from Oct/Nov 2015
- 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/42 Further problem-solving & programming