Cambridge A Level · 9608 · Paper 4 · Further problem-solving & programming
Computer Science 9608/41 May/June 2015 past paper
Cambridge A Level Computer Science (9608) (previous syllabus, now 9618) Paper 4 (Further problem-solving & programming), variant 1, 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_41 · 9608_s15_ms_41
Grade thresholds for 9608/41 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/41 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 | 85 |
| Further Programming | 2 | 25 |
| Software Development | 1 | 5 |
Questions in 9608/41 May/June 2015
- Question 1
A turnstile is a gate which is in a locked state. To open it and pass through, a customer inserts a coin into a slot on the turnstile. The turnstile then unlocks and allows the customer to push the turnstile …
- Question 2
A declarative programming language is used to represent the knowledge base shown below: 01 capital_city(amman). 02 capital_city(beijing). 03 capital_city(brussels). 04 capital_city(cairo). 05 capital_city(london). 06 city_in_country(amman, jordan). 07 city_in_country(shanghai, china). 08 city_in_country(brussels, belgium). 09 city_in_country(london, uk). 10 city_in_country(manchester, uk). 11 country_in_continent(belgium, …
- Question 4
A payroll program is to be written using an object-oriented programming language. An Employee class is designed. Two subclasses have been identified: • HourlyPaidEmployee who is paid a monthly wage calculated from their hourly rate of pay and the number …
- Question 5
Data is stored in the array NameList[1:10]. This data is to be sorted. (a) (i) Complete the pseudocode algorithm for an insertion sort. FOR ThisPointer ← 2 TO // use a temporary variable to store item which is to // …
- Question 6
A queue Abstract Data Type (ADT) has these associated operations: • create queue • add item to queue • remove item from queue The queue ADT is to be implemented as a linked list of nodes. Each node consists of …
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/42 Further problem-solving & programming
- 9608/43 Further problem-solving & programming