0% found this document useful (0 votes)

39 views16 pages

Cambridge O Level: Computer Science 2210/23

This document is an examination paper for the Cambridge O Level Computer Science subject, specifically Paper 2 on Algorithms, Programming, and Logic for October/November 2024. It includes instructions for candidates, a variety of questions related to computer science concepts, and requires answers to be written directly on the paper. The total mark for the paper is 75, and it consists of multiple sections covering topics such as data validation, algorithms, logic gates, and program development life cycle.

Uploaded by

pathirajadewdun889

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

39 views16 pages

Cambridge O Level: Computer Science 2210/23

Uploaded by

pathirajadewdun889

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 16

* 0000800000001 *

, ,

Cambridge O Level

¬O. 4mHuOªE`|5W
¬[tOmYsx98|-Q
¥EU55e5EU 5Eu5U
* 2 0 0 5 8 9 4 8 8 5 *

COMPUTER SCIENCE 2210/23

Paper 2 Algorithms, Programming and Logic October/November 2024

1 hour 45 minutes

You must answer on the question paper.

No additional materials are needed.

INSTRUCTIONS
● Answer all questions.
● Use a black or dark blue pen. You may use an HB pencil for any diagrams or graphs.
● Write your name, centre number and candidate number in the boxes at the top of the page.
● Write your answer to each question in the space provided.
● Do not use an erasable pen or correction fluid.
● Do not write on any bar codes.
● Calculators must not be used in this paper.

INFORMATION
● The total mark for this paper is 75.
● The number of marks for each question or part question is shown in brackets [ ].
● No marks will be awarded for using brand names of software packages or hardware.

This document has 16 pages. Any blank pages are indicated.

DC (ST) 347142
© UCLES 2024 [Turn over
* 0000800000002 *

DO NOT WRITE IN THIS MARGIN

2
, ,

1 Tick (✓) one box to show which of the following is used to validate data on input.

A checksum

B double entry check

C type check

D visual check
[1]

DO NOT WRITE IN THIS MARGIN

2 Tick (✓) one box to show a method used to construct a solution to a problem.

A abstraction

B structure diagram

C test data

D variable
[1]

DO NOT WRITE IN THIS MARGIN

3 Four logic gates and five logic gate symbols are shown.

Draw one line to link each logic gate to its correct symbol. Not all logic gate symbols will be used.

Logic gate Logic gate symbol

AND

DO NOT WRITE IN THIS MARGIN

NAND

NOR
DO NOT WRITE IN THIS MARGIN

XOR

ĬÍĊ®Ġ´íÈõÏĪÅĊÝú·þ×
[4]
© UCLES 2024 ĬāÙóÎīùüâþĂÖĀĂýĩćĂ
ĥĕąÕõÕĥÕõÕąÅąõåµĕÕ
2210/23/O/N/24
* 0000800000003 *
DO NOT WRITE IN THIS MARGIN

3
, ,

4 Complete the paragraph about databases. Use terms from the list. You may need to use a term
more than once. Some of the terms in the list will not be used.

fields comments columns constant key

table primary key program records rows

scripts database validation variable

DO NOT WRITE IN THIS MARGIN

Database tables consist of ...................................... and ...................................... .

Rows are ...................................... .

...................................... are fields.

Structured query language (SQL) ...................................... are used to query data.

A ...................................... uniquely identifies a record.

[6]
DO NOT WRITE IN THIS MARGIN

5 One stage of the program development life cycle is the analysis stage.

Identify and describe two other stages of the program development life cycle.

Stage ................................................................................................................................................

Description .......................................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................
DO NOT WRITE IN THIS MARGIN

..........................................................................................................................................................

Stage ................................................................................................................................................

Description .......................................................................................................................................

..........................................................................................................................................................

..........................................................................................................................................................
DO NOT WRITE IN THIS MARGIN

..........................................................................................................................................................
[6]

ĬÏĊ®Ġ´íÈõÏĪÅĊÝü·þ×
© UCLES 2024 ĬāÚôÖĝõČ×üïēÜúÙĩ÷Ă
ĥĕõĕµµąµĥåÕÅąĕÅõąÕ
2210/23/O/N/24 [Turn over
* 0000800000004 *

DO NOT WRITE IN THIS MARGIN

4
, ,

6 An incomplete algorithm has been written in pseudocode to count the number of values stored in
an array and to find their average.
Values have been stored in the array starting at A[1]
All the values to be counted are non-zero.
A value of zero in the array indicates there are no more values stored.

01 DECLARE A : ARRAY[1:50] OF INTEGER

02 DECLARE C : INTEGER

03 DECLARE W : INTEGER

DO NOT WRITE IN THIS MARGIN

04 DECLARE X : INTEGER

05 W 0

06 C .................................................................................................

07 WHILE A[C] <> 0

08 W .................................................................................................

09 C C + 1

DO NOT WRITE IN THIS MARGIN

10 ENDWHILE

11 X .................................................................................................

(a) Complete the given pseudocode algorithm. [3]

(b) Write pseudocode to display, with suitable messages:

• the number of values stored in the array

• the average of those values stored.

...................................................................................................................................................

DO NOT WRITE IN THIS MARGIN

...................................................................................................................................................

............................................................................................................................................. [3]
DO NOT WRITE IN THIS MARGIN

ĬÍĊ®Ġ´íÈõÏĪÅĊßú·Ā×
© UCLES 2024 ĬāÚñÖħćýäöøĜúÖûùÿĂ
ĥååĕõµąĕąąåÅÅĕĥõĕÕ
2210/23/O/N/24
* 0000800000005 *
DO NOT WRITE IN THIS MARGIN

5
, ,

(c) Meaningful identifiers have not been used in this algorithm.

Suggest suitable meaningful identifiers for:

The array

A ................................................................................................................................................

The variables

C ................................................................................................................................................
DO NOT WRITE IN THIS MARGIN

X ................................................................................................................................................

W ................................................................................................................................................
[3]

7 A programmer is testing a program that requires a positive value between 1 and 100 inclusive to
be entered. The range check in the program is to be tested.

Identify three different types of test data to be used.

DO NOT WRITE IN THIS MARGIN

For each type of test data, give an example of the value(s) to be used and the expected outcome.

Type 1 ..............................................................................................................................................

Example ...........................................................................................................................................

Outcome ...........................................................................................................................................

..........................................................................................................................................................

Type 2 ..............................................................................................................................................

Example ...........................................................................................................................................
DO NOT WRITE IN THIS MARGIN

Outcome ...........................................................................................................................................

..........................................................................................................................................................

Type 3 ..............................................................................................................................................

Example ...........................................................................................................................................

Outcome ...........................................................................................................................................

..........................................................................................................................................................
[9]
DO NOT WRITE IN THIS MARGIN

ĬÏĊ®Ġ´íÈõÏĪÅĊßü·Ā×
© UCLES 2024 ĬāÙòÎġċíÕĄĉÍÞÞßùïĂ
ĥåÕÕµÕĥõĕõõÅÅõąµąÕ
2210/23/O/N/24 [Turn over
* 0000800000006 *

DO NOT WRITE IN THIS MARGIN

6
, ,

8 A logic circuit is to be built to control the automatic opening of a window. The window W opens if
the temperature T is too high, the heater H is off, and the air conditioning A is off.

air conditioning off 0

air conditioning A
air conditioning on 1
not too high 0
temperature T
too high 1
heater off 0

DO NOT WRITE IN THIS MARGIN

heater H
heater on 1
window closed 0
window W
window open 1

Complete the truth table for this problem.

A T H W

0 0 0

DO NOT WRITE IN THIS MARGIN

0 0 1

0 1 0

0 1 1

1 0 0

1 0 1

DO NOT WRITE IN THIS MARGIN

1 1 0

1 1 1

[4]
DO NOT WRITE IN THIS MARGIN

ĬÑĊ®Ġ´íÈõÏĪÅĊÞü¶þ×
© UCLES 2024 ĬāÚòÑīģ÷Íćüè¾Ö¾ÑÿĂ
ĥõõÕµõĥÕÕĕÕÅąõåõÕÕ
2210/23/O/N/24
* 0000800000007 *
DO NOT WRITE IN THIS MARGIN

7
, ,

9 A flowchart checks that values stored in three variables are identical.

If they are different, the highest value is stored in all three variables.

START

Is A = B AND No
STOP
B = C ?
Yes
DO NOT WRITE IN THIS MARGIN

Is A >= B OR Yes
B A
A >= C ? C A
No

Is B >= A AND Yes A B

B >= C ? C B
No
DO NOT WRITE IN THIS MARGIN

A C
B C

Identify four errors in the flowchart and suggest a correction for each error. You may label each
error on the diagram with the corresponding error number.

Error 1 ..............................................................................................................................................

Correction .........................................................................................................................................
DO NOT WRITE IN THIS MARGIN

..........................................................................................................................................................

Error 2 ..............................................................................................................................................

Correction .........................................................................................................................................

..........................................................................................................................................................

Error 3 ..............................................................................................................................................

Correction .........................................................................................................................................

..........................................................................................................................................................
DO NOT WRITE IN THIS MARGIN

Error 4 ..............................................................................................................................................

Correction .........................................................................................................................................

..........................................................................................................................................................
[4]
ĬÓĊ®Ġ´íÈõÏĪÅĊÞú¶þ×
© UCLES 2024 ĬāÙñÙĝğćìñąġĚÞĚÑïĂ
ĥõąĕõĕąµÅĥąÅąĕÅµÅÕ
2210/23/O/N/24 [Turn over
* 0000800000008 *

DO NOT WRITE IN THIS MARGIN

8
, ,

10 An algorithm has been written in pseudocode to check that a password meets a set of rules.

01 OUTPUT "Please enter password "

02 INPUT Password
03 Accept TRUE
04 IF LENGTH(Password) < 8 OR LENGTH(Password) > 20
05 THEN
06 Accept FALSE
07 ENDIF
08 IF LCASE(Password) = Password OR UCASE(Password) = Password
09 THEN

DO NOT WRITE IN THIS MARGIN

10 Accept FALSE
11 ENDIF
12 Index 1
13 Found FALSE
14 WHILE NOT Found AND Accept AND Index < LENGTH(Password)
15 IF SUBSTRING(Password, Index, 1) = '!'
16 THEN
17 Found TRUE
18 ENDIF
19 Index Index + 1
20 ENDWHILE
21 IF NOT Found

DO NOT WRITE IN THIS MARGIN

22 THEN
23 Accept FALSE
24 ENDIF
25 IF Accept
26 THEN
27 OUTPUT "Accepted"
28 ELSE
29 OUTPUT "Rejected"
30 ENDIF

(a) Complete the three trace tables using the data shown for each one.

Data: MYWORD

DO NOT WRITE IN THIS MARGIN

Password Accept Index Found OUTPUT

DO NOT WRITE IN THIS MARGIN

ĬÑĊ®Ġ´íÈõÏĪÅĊàü¶Ā×
© UCLES 2024 ĬāÙôÙħčĂÏïþĪ¼Ă¼ÁćĂ
ĥÅÕĕµĕąĕåÅõÅÅĕĥµÕÕ
2210/23/O/N/24
* 0000800000009 *
DO NOT WRITE IN THIS MARGIN

9
, ,

Data: M!word

Password Accept Index Found OUTPUT

DO NOT WRITE IN THIS MARGIN

Data: My!Hidden

Password Accept Index Found OUTPUT

DO NOT WRITE IN THIS MARGIN

[6]
DO NOT WRITE IN THIS MARGIN

(b) State the rules that the password must meet.

...................................................................................................................................................

............................................................................................................................................. [3]
DO NOT WRITE IN THIS MARGIN

DO NOT WRITE IN THIS MARGIN

10
, ,

11 Building materials are sold in bags. A new database table called BuildStock has been set up to
store details about the materials for sale. Part of this table is given.

MtNo Name InStock WeightKg PricePerBag NumberBags

MT01 Builders sand Yes 50 4.50 50
MT02 Sharp sand Yes 25 3.50 21
MT03 Red sand No 50 2.75 0
MT04 Cement No 25 6.85 0

DO NOT WRITE IN THIS MARGIN

MT05 Chippings Yes 50 35.00 50
MT06 Cobbles No 75 67.35 0
MT07 Pebbles small Yes 50 34.50 3
MT08 Pebbles medium Yes 25 25.50 10
MT12 Pebbles large Yes 75 62.75 20
MT15 Washed gravel Yes 50 12.75 12
MT16 Pea gravel Yes 100 15.95 24

DO NOT WRITE IN THIS MARGIN

(a) Write the output from this structured query language (SQL) statement.

SELECT MtNo, Name

FROM BuildStock
WHERE WeightKg = 75
ORDER BY PricePerBag;

...................................................................................................................................................

............................................................................................................................................. [3]

DO NOT WRITE IN THIS MARGIN

(b) (i) Complete this SQL statement to display only the names of all the materials that are out
of stock.

SELECT .............................................................................................................................

FROM ..................................................................................................................................

WHERE ...............................................................................................................................
[2]

(ii) Explain how another SQL statement using a different field could be used to display the
same information.
DO NOT WRITE IN THIS MARGIN

...........................................................................................................................................

..................................................................................................................................... [2]
ĬÑĊ®Ġ´íÈõÏĪÅĊÝü¸þ×
© UCLES 2024 ĬāÜôÔĥĕĘÑøąÄØĄÐùïĂ
ĥĕµÕµĕåĕąõõąÅµĥµĥÕ
2210/23/O/N/24
DO NOT WRITE IN THIS MARGIN DO NOT WRITE IN THIS MARGIN DO NOT WRITE IN THIS MARGIN DO NOT WRITE IN THIS MARGIN DO NOT WRITE IN THIS MARGIN

ĥĕÅĕõõÅõĕąåąÅÕąõõÕ
ĬāÛóÜģęĨèĂüąĄüČùÿĂ
ĬÓĊ®Ġ´íÈõÏĪÅĊÝú¸þ×
,
11

2210/23/O/N/24
BLANK PAGE

[Turn over
* 0000800000012 *

DO NOT WRITE IN THIS MARGIN

12
, ,

12 Members of a litter picking group complete a litter pick every month. Members’ names are stored
in one-dimensional (1D) array PickerName[]

Each member stores the weight of the litter they have picked in another one-dimensional (1D)
array PickedWeight[]
The weights are in kilograms with one decimal place, for example 8.4

The position of each member’s data in the two arrays is the same. For example, the member
stored at index 10 in PickerName[] and at index 10 in PickedWeight[] is the same.

Every month, there is a small prize awarded to the members of the group who have the two

DO NOT WRITE IN THIS MARGIN

heaviest weights. Certificates are awarded to all members with a pick weight of over three
kilograms.

Write a program that meets the following requirements:

• allows the weight of members’ picks to be input and validated

• sorts the arrays PickedWeight[] and PickerName[] in descending order of weight
• outputs the member names and the pick weights of the members with the two heaviest picks
and identifies them as “Best in Group” and “Second best in Group”
• stores the names of all the members who will receive a certificate in the array
PickerCertificate[]
• outputs a message stating the number of certificates to be printed.

DO NOT WRITE IN THIS MARGIN

You must use pseudocode or program code and add comments to explain how your code works.

You do not need to declare any arrays or variables; you may assume that this has already been
done.

All inputs and outputs must contain suitable messages.

You do not need to initialise the data in the array PickerName[]

..........................................................................................................................................................

DO NOT WRITE IN THIS MARGIN

..........................................................................................................................................................

..........................................................................................................................................................
DO NOT WRITE IN THIS MARGIN

..........................................................................................................................................................

..........................................................................................................................................................
ĬÑĊ®Ġ´íÈõÏĪÅĊßü¸Ā×
© UCLES 2024 ĬāÛòÜĩīġÓĀóþâØêĩ÷Ă
ĥåĕĕµõÅÕõåÕąąÕåõĥÕ
2210/23/O/N/24
* 0000800000013 *
DO NOT WRITE IN THIS MARGIN

13
, ,