Cambridge A Level ยท 9608 ยท Paper 4 ยท Further problem-solving & programming
Computer Science 9608/43 May/June 2015 past paper
Cambridge A Level Computer Science (9608) (previous syllabus, now 9618) Paper 4 (Further problem-solving & programming), variant 3, May/June 2015: the question paper and its official mark scheme, 5 questions worth 115 marks, with the grade thresholds. Free to open, no account needed.
- Questions
- 5
- Marks
- 75
- Grade A from
- 54
File names: 9608_s15_qp_43 ยท 9608_s15_ms_43
Grade thresholds for 9608/43 May/June 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 |
|---|---|---|---|---|
| 54 | 48 | 41 | 34 | 27 |
Topics in this paper
Which syllabus chapters 9608/43 May/June 2015 tested, by marks. Each chapter links to every past-paper question on it.
| Chapter | Questions | Marks |
|---|---|---|
| Computational thinking and Problem-solving | 2 | 82 |
| Further Programming | 2 | 24 |
| Software Development | 1 | 9 |
Questions in 9608/43 May/June 2015
- Question 1
A petrol filling station has a single self-service petrol pump. A customer can use the petrol pump when it is ready to dispense petrol. The pump is in use when the customer takes the nozzle from a holster on the โฆ
- Question 2
A declarative programming language is used to represent the knowledge base shown below: 01 dairy_product(cheese). 02 meat(beef). 03 meat(chicken). 04 meat(lamb). 05 made_with(burger, beef). 06 made_with(kofta, lamb). 07 made_with(quiche, cheese). 08 made_with(quiche, egg). 09 made_with(quiche, flour). These clauses have the โฆ
- Question 4
A sports club stores data about its members. A program is to be written using an object-oriented programming language. A Member class is designed. Two subclasses have been identified: โข FullMember โข JuniorMember (a) Draw an inheritance diagram for these โฆ
- Question 5
A stack Abstract Data Type (ADT) has these associated operations: โข create stack โข add item to stack (push) โข remove item from stack (pop) The stack ADT is to be implemented as a linked list of nodes. Each node โฆ
- Question 6
A recursively defined procedure X is defined below: PROCEDURE X(BYVALUE n : INTEGER) IF โฆ
Other Computer Science papers from May/June 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