Cambridge A Level ยท 9608 ยท Paper 4 ยท Further problem-solving & programming
Computer Science 9608/41 May/June 2018 past paper
Cambridge A Level Computer Science (9608) (previous syllabus, now 9618) Paper 4 (Further problem-solving & programming), variant 1, 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_41 ยท 9608_s18_ms_41
Grade thresholds for 9608/41 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/41 May/June 2018 tested, by marks. Each chapter links to every past-paper question on it.
| Chapter | Questions | Marks |
|---|---|---|
| Further Programming | 2 | 31 |
| Computational thinking and Problem-solving | 2 | 26 |
Questions in 9608/41 May/June 2018
- Question 1
A declarative language is used to represent facts and rules about flights. 01 direct(edinburgh, paris). 02 direct(palma, rome). 03 direct(glasgow, palma). 04 direct(glasgow, vienna). 05 direct(glasgow, salzburg). 06 07 flies(paris, fly_jet). 08 flies(mumbai, british_air). 09 flies(palma, ciebe). 10 flies(vienna, fly_jet). โฆ
- Question 2
The array ItemList[1:20] stores data. A bubble sort sorts these data. (a) Complete the pseudocode algorithm for a bubble sort. 01 MaxIndex 20 02 NumberItems 03 FOR Outer 1 TO 04 FOR Inner 1 to NumberItems 05 IF ItemList[Inner] > โฆ
- Question 5
A computer game is being developed using object-oriented programming. The following image is a screenshot from the game. There are scenery elements and animated elements. The playerโs character is one of the animated elements. Each game element has the attributes: โฆ
- Question 6
An Abstract Data Type (ADT) is used to create a linked list. The linked list is created as an array of records. The records are of type ListNode. An example of a record of ListNode is shown in the following โฆ
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/42 Further problem-solving & programming
- 9608/43 Further problem-solving & programming