Cambridge O Level ยท 2210 ยท Paper 2 ยท Algorithms, programming & logic
Computer Science 2210/22 May/June 2020 past paper
Cambridge O Level Computer Science (2210) Paper 2 (Algorithms, programming & logic), variant 2, May/June 2020: the question paper and its official mark scheme, 18 questions worth 50 marks. Free to open, no account needed.
- Questions
- 18
- Marks
- 50
File names: 2210_s20_qp_22 ยท 2210_s20_ms_22
Topics in this paper
Which syllabus chapters 2210/22 May/June 2020 tested, by marks. Each chapter links to every past-paper question on it.
| Chapter | Questions | Marks |
|---|---|---|
| Databases | 2 | 30 |
| Scenario Question | 1 | 20 |
| Programming | 14 | โ |
| Algorithm Design and Problem-Solving | 1 | โ |
Questions in 2210/22 May/June 2020
- Question 1
All variables, constants and other identifiers must have meaningful names. (a) Identify two variables that you could have used for Task 1. Give the data type and state the use of each variable. Variable 1 Data type Use Variable 2 โฆ
- Question 2
Most programming languages include basic data types. Ahmad is describing the basic data types he has used. State the data type that Ahmad is describing in each sentence. Choose the data type from this list of programming terms. Array Boolean โฆ
- Question 3
(a) An algorithm has been written in pseudocode to input the names and marks of 35 students. The algorithm stores the names and marks in two arrays Name[ ] and Mark[ ]. The highest mark awarded is found and the โฆ
- Question 4
FOR Count โ 1 TO 35 04 OUTPUT "Please enter student name"
- Question 5
OUTPUT Please enter student name 05 INPUT Name[Count]
- Question 6
INPUT Name[Count] 06 OUTPUT "Please enter student mark"
- Question 7
OUTPUT Please enter student mark 07 INPUT Mark[Counter]
- Question 8
INPUT Mark[Counter] 08 IF Mark[Count] = HighestMark
- Question 9
IF Mark[Count] = HighestMark 09 THEN
- Question 10
THEN 10 HighestMarkStudents โHighestMarkStudents โ 1
- Question 11
HighestMarkStudents โ HighestMarkStudents 1 11 ENDIF
- Question 12
ENDIF 12 IF Mark[Count] > HighestMark
- Question 13
IF Mark[Count] > HighestMark 13 THEN
- Question 14
THEN 14 Mark[Count] โHighestMark
- Question 15
Mark[Count] โ HighestMark 15 HighestMarkStudents โ1
- Question 16
HighestMarkStudents โ 1 16 ENDIF
- Question 17
- Question 18
NEXT Count 18 OUTPUT "There are ", HighestMarkStudents," with the highest mark of ", HighestMark Give line numbers where the four errors are to be found in the pseudocode. Suggest a correction for each error. Error 1 line number Correction โฆ