2015

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.

ABCDE
5548403224

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.

ChapterQuestionsMarks
Computational thinking and Problem-solving174
Further Programming227
Data Representation116

Questions in 9608/43 Oct/Nov 2015

  1. Question 2Further Programming ยท 11 marks

    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 โ€ฆ

  2. Question 3Further Programming ยท 16 marks

    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. โ€ฆ

  3. Question 4Computational thinking and Problem-solving ยท 74 marks

    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 โ€ฆ

  4. Question 5Data Representation ยท 16 marks

    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

Questions students ask

Where can I get the 9608/43 Oct/Nov 2015 mark scheme?
Open the mark scheme above - it is the official Cambridge scheme for this exact paper (9608_w15_ms_43), and on a wide screen it sits beside the question you are reading.
What was the grade threshold for an A in 9608/43 Oct/Nov 2015?
55 marks out of 75, a C needed 40.
Which topics came up in 9608/43 Oct/Nov 2015?
Mostly Computational thinking and Problem-solving, Further Programming, Data Representation. The full list is in the table above.
Do I need an account to open 9608/43 Oct/Nov 2015?
No. Every paper opens for free without signing in. A free account also saves your pen marks and records your score against the grade thresholds.