An algorithm has been written in pseudocode to allow the names of 50 cities and their countries to
be entered and stored in a two-dimensional (2D) array. The contents of the array are then output.

01 DECLARE City ARRAY[1:50, 1:2] OF BOOLEAN
02 DECLARE Count : INTEGER
03 DECLARE Out : INTEGER
04 Count ← 1
05 IF
06
OUTPUT "Enter the name of the city"
07
INPUT City[Count, 2]
08
OUTPUT "Enter the name of the country"
09
INPUT City[Count, 2]
10
Count← Count + 1
11 UNTIL Count
=
50
12 FOR Out ← 1 TO 1
13
OUTPUT "The city ", City[Out, 1], " is in ", City[Out, 2]
14 NEXT Out

Q: What topic does this question test?

This question tests Algorithm design and problem-solving in O-Level Computer Science (syllabus code 2210). It is worth 9 marks.

Q: Which exam paper is this question from?

This question appeared in the Cambridge O-Level Computer Science Oct/Nov 2023 examination, Paper 2 Variant 2 (2210_w23_qp_22.pdf).

Question

An algorithm has been written in pseudocode to allow the names of 50 cities and their countries to
be entered and stored in a two-dimensional (2D) array. The contents of the array are then output.

01 DECLARE City ARRAY[1:50, 1:2] OF BOOLEAN
02 DECLARE Count : INTEGER
03 DECLARE Out : INTEGER
04 Count ← 1
05 IF
06 
OUTPUT "Enter the name of the city"
07 
INPUT City[Count, 2]
08 
OUTPUT "Enter the name of the country"
09 
INPUT City[Count, 2]
10 
Count← Count + 1
11 UNTIL Count 
= 
50
12 FOR Out ← 1 TO 1
13 
OUTPUT "The city ", City[Out, 1], " is in ", City[Out, 2]
14 NEXT Out

Oracle Prep · Accepted Answer

Sign up to Oracle Prep to view the full model answer with examiner insights.

📋 Examiner Report & Trap Analysis

🎯 Mark Scheme Breakdown

Unlock the Examiner's Analysis

About This O-Level Computer Science Question

Topic

Source

Practice on Oracle Prep

Related Computer Science Questions