Scribd
Upload
77 views2 pages

CS2210 Oct Nov 2024 Paper 2 Variant 2 Marking Scheme

The document outlines the marking scheme for a Cambridge O Level question regarding data structures and algorithms, specifically focusing on a 2D array for managing weights and names of members. It details the requirements for input validation, sorting, and output of the top two members along with the number of certificates to be issued. An example pseudocode is provided to illustrate the expected solution, including the necessary loops and conditionals.

Uploaded by

Babar Shaikh
Copyright
© © All Rights Reserved
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
77 views2 pages

CS2210 Oct Nov 2024 Paper 2 Variant 2 Marking Scheme

The document outlines the marking scheme for a Cambridge O Level question regarding data structures and algorithms, specifically focusing on a 2D array for managing weights and names of members. It details the requirements for input validation, sorting, and output of the top two members along with the number of certificates to be issued. An example pseudocode is provided to illustrate the expected solution, including the necessary loops and conditionals.

Uploaded by

Babar Shaikh
Copyright
© © All Rights Reserved
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/ 2

2210/23 Cambridge O Level – Mark Scheme October/November 2024

PUBLISHED
Question Answer Marks

12 • AO2 (maximum 9 marks) 15


• AO3 (maximum 6 marks)

Data Structures required names shown underlined must match those given in the scenario
2D Array or list PickerName[], PickedWeight[], PickerCertificate[]
Variables

Requirements (techniques)
R1 Input and validate the weights (input and iteration)
R2 sort the PickerName[], and PickedWeight[]arrays in descending order of weight (nested iteration and sorting)
R3 Output top two members and the weights. Storing the members names who will receive a certificate and outputting the
number of certificates (iteration, selection, assignment, counting and output with appropriate messages)

Example 15-mark answer in pseudocode

CONSTANT GroupSize = 200 // setting the number of members in the club


DECLARE Position : Array[1:2} OF STRING

Position[1]  "Best in Group"


Position[2]  "Second best in Group"

FOR Index  1 TO GroupSize


REPEAT
PRINT "Please enter the weight for ", PickerName[Index],
INPUT PickedWeight[Index]
UNTIL PickedWeight[Index] > 0 AND PickedWeight[Index] < 15
NEXT Index
Last  GroupSize
REPEAT
Swap  FALSE

© Cambridge University Press & Assessment 2024 Page 11 of 14


2210/23 Cambridge O Level – Mark Scheme October/November 2024
PUBLISHED
Question Answer Marks

12 FOR Index  1 TO GroupSize -1


IF PickedWeight[Index] < PickedWeight[Index + 1]
THEN
TempWeight  PickedWeight[Index]
PickedWeight[Index]  PickedWeight[Index + 1]
PickedWeight [Index + 1]  TempWeight
TempName  PickerName[Index]
PickerName[Index]  PickerName[Index + 1]
PickerName[Index + 1]  TempName
Swap  TRUE
ENDIF
NEXT Index
Last  Last - 1
UNTIL NOT Swap or Last = 1
FOR Index  1 TO 2
OUTPUT Position[Index], PickerName[Index], " with a weight of ", PickedWeight[Index]
NEXT Index
Index  1
Count  0
WHILE PickedWeight[Index] > 3 DO // count number of certificates required and store names
Count  Count + 1
PickerCertificate[Count]  PickerName[Index]
Index  Index + 1
ENDWHILE
OUTPUT "Number of certificates to be printed is ", Count

© Cambridge University Press & Assessment 2024 Page 12 of 14

You might also like