(MS) Yearly 9618 P2

SHAHARYAR LALANI
YEARLY
PAST PAPER
9618
PAPER 2
MARKING
SCHEME
Cambridge International AS & A Level
SHAHARYAR LALANI
COMPUTER SCIENCE 9618/02
Paper 2 For examination from 2021
MARK SCHEME
Maximum Mark: 75
Specimen
This document has 12 pages. Blank pages are indicated.
© UCLES 2018 [Turn over

Generic Marking Principles
These general marking principles must be applied by all examiners when marking candidate answers. They should be applied alongside the specific
9618/02
content of the mark scheme or generic level descriptors for a question. Each question paper and mark scheme will also comply with these marking
© UCLES 2018
principles.
GENERIC MARKING PRINCIPLE 1:
Marks must be awarded in line with:
• the specific content of the mark scheme or the generic level descriptors for the question
• the specific skills defined in the mark scheme or in the generic level descriptors for the question
• the standard of response required by a candidate as exemplified by the standardisation scripts.
Marks awarded are always whole marks(not half marks, or other fractions).
Marks must be awarded positively:
Page 2 of 12
SPECIMEN
• marks are awarded for correct/valid answers, as defined in the mark scheme. However, credit is given for valid answers which go beyond the
scope of the syllabus and mark scheme, referring to your Team Leader as appropriate
• marks are awarded when candidates clearly demonstrate what they know and can do
• marks are not deducted for errors
• marks are not deducted for omissions
• answers should only be judged on the quality of spelling, punctuation and grammar when these features are specifically assessed by the
question as indicated by the mark scheme. The meaning, however, should be unambiguous.
Cambridge International AS & A Level – Mark Scheme
Rules must be applied consistently e.g. in situations where candidates have not followed instructions or in the application of generic level
descriptors.
Marks should be awarded using the full range of marks defined in the mark scheme for the question(however; the use of the full mark range may be
limited according to the quality of the candidate responses seen).
For examination
from 2021
SHAHARYAR LALANI
9618/02
Marks awarded are based solely on the requirements as defined in the mark scheme. Marks should not be awarded with grade thresholds or grade
© UCLES 2018
descriptors in mind.
Page 3 of 12
SPECIMEN
For examination
from 2021
SHAHARYAR LALANI
Question Answer Marks
1(a)(i) 5
9618/02
Variable Data type
© UCLES 2018
Today STRING
WeekNumber INTEGER
Revision CHAR
MaxWeight REAL
LastBatch BOOLEAN
One mark per row

Accept suitable alternatives for REAL
1(a)(ii) 5
Expression Evaluates to
MID(Today, 3, 2) & Revision & "ape" “esCape”
INT(MaxWeight + 4.2) 64
LENGTH(MaxWeight) ERROR
Page 4 of 12
SPECIMEN
MOD(WeekNumber, 12) 1
(Revision <= 'D') AND (NOT LastBatch) FALSE
One mark per row

Row 1 must have capital ‘C’ and quotes
Rows 2 to 6 must not have quotes
1(b) 4
Item Statement Input Process Output

1 SomeChars ← "Hello World" 9
2 OUTPUT RIGHT(SomeChars,5) 9 9
3 READFILE MyFile, MyChars 9 (9)
4 WRITEFILE MyFile, "Data is " & MyChars 9 9
One mark per row

For examination
from 2021
SHAHARYAR LALANI
1(c) MyCount ← 101 4
9618/02
© UCLES 2018
REPEAT
OUTPUT MyCount
MyCount ← MyCount + 2
UNTIL MyCount > 199
One mark for each of the following:

Counter initialisation before loop
Repeat ... Until loop
Method for choosing (correct range of) odd numbers
Output all odd numbers in the range

2(a) • The identification of the modules // Checkout, Card payment, Account payment 3
Page 5 of 12
SPECIMEN
• The hierarchy of modules (allow ‘relationship’ )

• Parameters/data/variables passed between modules // The interface between the modules // or by example
• The sequence
One mark per item
Max 3
2(b) FUNCTION CardPayment(Amount : REAL, Name : STRING) RETURNS BOOLEAN 3
One mark per underlined part

Parameter order not significant
Function name and parameter names not important but must be present.
For examination
from 2021
SHAHARYAR LALANI
3(a) POP(): 4
9618/02
• The value ‘E’ is removed from the stack (and assigned to variable MyVar)
© UCLES 2018
• Top of Stack pointer is incremented to 102
PUSH():
• Top of Stack pointer is decremented to 101
• ‘Z’ is loaded into address 101
Allow follow through for PUSH()

3(b) • The received string will be reversed 2
• because the stack operates as a FILO structure

4(a) 6
Name of parameter Value Explanation
passing method output
(Call) by reference 5 • A pointer to address of the variable is passed.
Page 6 of 12
• Original variable is changed when parameter changed in called module.
SPECIMEN
(Call) by value 4 • A copy of the variable itself is passed.

• Original variable not changed when parameter changed in called module.
Mark as follows:
• One mark for each name and corresponding value
• One mark per bullet in explanation
Max 4 if explanations do not match answers in columns 1 and 2

4(b) • Procedures 2
• Local variable
One mark per item

For examination
from 2021
SHAHARYAR LALANI
5(a) Pseudocode: 3
9618/02
© UCLES 2018
TYPE StockItem
DECLARE ProductCode : STRING
DECLARE Price : REAL
DECLARE NumberInStock : INTEGER
ENDTYPE
(allow END)
Mark as follows:
• One mark for TYPE and ENDTYPE
• One mark for Productcode
• One mark for Price and NumberInStock
5(b) DECLARE Stock : ARRAY [1:1000] OF StockItem 3
One mark per underlined phrase

5(c) Stock[20].Price ← 105.99 2
Stock[20].NumberInStock ← Stock[20].NumberInStock + 12
Page 7 of 12
SPECIMEN
One mark per statement

For examination
from 2021
SHAHARYAR LALANI
5(d) Pseudocode: 4
9618/02
© UCLES 2018
DECLARE n : INTEGER
FOR n ← 1 to 1000
IF Stock[n].Price >= 100
THEN
OUTPUT "ProductCode: " & Stock[n].ProductCode &
" Number in Stock: " & Stock[n].NumberInStock
ENDIF
NEXT
One mark for each of:

• Loop through all elements of the array
• Check Price > 99.99
• OUTPUT of 2 fields ...
• ... with suitable supporting text
Page 8 of 12
SPECIMEN
For examination
from 2021
SHAHARYAR LALANI
6(a) Pseudocode solution: 9
9618/02
© UCLES 2018
FUNCTION ValidatePassword(Pass : STRING) RETURNS BOOLEAN
DECLARE LCaseChar, UCaseChar, NumChar, n : INTEGER
DECLARE NextChar : CHAR
DECLARE ReturnFlag : BOOLEAN
ReturnFlag ← TRUE
LCaseChar ← 0
UCaseChar ← 0
NumChar ← 0
n ← 1
WHILE n <= LENGTH(Pass) AND ReturnFlag = TRUE

NextChar ← MID(Pass, n, 1)
IF NextChar >= 'a' AND NextChar <= 'z'
THEN
LCaseChar ← LCaseChar + 1
ELSE
Page 9 of 12
SPECIMEN
IF NextChar >= 'A' AND NextChar <= 'Z'

THEN
UCaseChar ← UCaseChar + 1
ELSE
IF NextChar >= '0' AND NextChar <= '9'
THEN
NumChar ← NumChar + 1
ELSE
ReturnFlag ← FALSE //illegal character

ENDIF
ENDIF
ENDIF
n ← n + 1
ENDWHILE
For examination
from 2021
SHAHARYAR LALANI
6(a) IF LCaseChar > 1 AND UCaseChar > 1 AND NumChar > 2 AND ReturnFlag
9618/02
THEN
© UCLES 2018
ReturnFlag ← TRUE
ELSE
ReturnFlag ← FALSE
ENDIF
RETURN ReturnFlag
ENDFUNCTION
1 mark for each of the following:

1 Correct Function heading (including parameter) and ending
2 Declaration and initialisation of local counter integer variables
3 Correct loop
4 Loop terminates if illegal characters found
5 Picking up NextChar from Pass
6 Correct check and increment for lower case
7 Correct check and increment for upper case
8 Correct check and increment for numeric
9 Correct check for invalid character
Page 10 of 12
SPECIMEN
10 Correct final format check and returning correct Boolean value
one mark per bullet point Max. 9

6(b)(i) Password1: 1
Any valid string consisting of:

• at least 2 uppercase alphabetic
• at least 2 lowercase alphabetic
• at least 3 numeric characters

• No other characters
e.g. ‘ABcd123’
For examination
from 2021
SHAHARYAR LALANI
6(b)(ii) Modify Password1 for each rule: 4
9618/02
© UCLES 2018
Test string:
• Invalid passwords
– Lower case characters (e.g. ‘ABc123’)
– Upper case characters (e.g. ‘Acd123’)
– Numeric characters (e.g. ‘ABcd12’)
• Containing an invalid character (e.g. ‘ABcd12+3’)
Mark as follows:
One mark for correct invalid string + reason (testing different rules of the function); no half marks
Each test string must only break a single rule
6(b)(iii) White-box 1
6(b)(iv) One mark per bullet: 2
• Testing may be carried out before the modules are developed // not ready for full testing
• Module stubs contain simple code to provide a known response // temporary replacement for a called module/return a
fixed value/output a message to confirm the module has been called
Page 11 of 12
SPECIMEN
For examination
from 2021
SHAHARYAR LALANI
7 Pseudocode : 8
9618/02
© UCLES 2018
PROCEDURE LogEvents()
DECLARE FileData : STRING

DECLARE ArrayIndex : INTEGER
OPENFILE "LoginFile.txt" FOR APPEND
FOR ArrayIndex ← 1 TO 500 // 0 TO 499
IF LogArray[ArrayIndex]<> "Empty"
THEN
FileData ← LogArray[ArrayIndex]
WRITEFILE "LoginFile.txt", FileData
ENDIF
NEXT
CLOSEFILE "LoginFile.txt"
ENDPROCEDURE
Page 12 of 12
SPECIMEN

1 Procedure heading and ending (ignore any input parameters but don’t allow a return value)
2 Declare ArrayIndex (any name) as integer
3 Open file LoginFile for append
4 Correct loop
5 Extract data from array in a loop
6 Check for unused element in a loop
7 Write data to file in a loop
8 Close the file outside the loop
Allow single write to file outside loop if complete string built within loop
For examination
from 2021
SHAHARYAR LALANI
SHAHARYAR LALANI
Paper 2 Problem Solving & Programming Skills May/June 2021
MARK SCHEME
Maximum Mark: 75
Published
This mark scheme is published as an aid to teachers and candidates, to indicate the requirements of the
examination. It shows the basis on which Examiners were instructed to award marks. It does not indicate the
details of the discussions that took place at an Examiners’ meeting before marking began, which would have
considered the acceptability of alternative answers.
Mark schemes should be read in conjunction with the question paper and the Principal Examiner Report for
Teachers.
Cambridge International will not enter into discussions about these mark schemes.
Cambridge International is publishing the mark schemes for the May/June 2021 series for most Cambridge
IGCSE™, Cambridge International A and AS Level components and some Cambridge O Level components.
This document consists of 16 printed pages.

9618/21 Cambridge International AS & A Level – Mark Scheme May/June 2021
PUBLISHED
These general marking principles must be applied by all examiners when marking candidate answers.
They should be applied alongside the specific content of the mark scheme or generic level descriptors
SHAHARYAR LALANI
for a question. Each question paper and mark scheme will also comply with these marking principles.
Marks awarded are always whole marks (not half marks, or other fractions).
• marks are awarded for correct/valid answers, as defined in the mark scheme. However, credit
is given for valid answers which go beyond the scope of the syllabus and mark scheme,
referring to your Team Leader as appropriate
• answers should only be judged on the quality of spelling, punctuation and grammar when these
features are specifically assessed by the question as indicated by the mark scheme. The
meaning, however, should be unambiguous.
Rules must be applied consistently, e.g. in situations where candidates have not followed
instructions or in the application of generic level descriptors.
Marks should be awarded using the full range of marks defined in the mark scheme for the question
(however; the use of the full mark range may be limited according to the quality of the candidate
responses seen).
Marks awarded are based solely on the requirements as defined in the mark scheme. Marks should
not be awarded with grade thresholds or grade descriptors in mind.
© UCLES 2021 Page 2 of 16

PUBLISHED
1(a) 4
Example
SHAHARYAR LALANI
Explanation Variable name Data type
value
"Wong" The preferred name of the MemberName STRING

member joining the
football club
FALSE A value to indicate FamilyMember BOOLEAN

whether an existing
member of the club lives
at the same address
19/02/1983 When the member joined StartDate DATE

the football club
1345 The number of points a Points INTEGER

member has earned.
Members of the club earn
points for different
activities.
One mark for each appropriate variable name plus data type
1(b) 5
Statement Error
Should be arithmetic
Result ← 2 & 4 operator (not &) // 2 and 4
should be CHAR / STRING
SubString ← MID("pseudocode", 4, 1) NO ERROR
Not Boolean values /

IF x = 3 OR 4 THEN incorrect operator //
Condition incorrect
INT(X/2) doesn't evaluate

Result ← Status AND INT(X/2) to a boolean value /
incorrect operator
Can’t add string to number /

Message ← "Done" + LENGTH(MyString)
"Done" is not a number
One mark for each row

PUBLISHED
1(c) Structure: 3
SHAHARYAR LALANI
• Record
Justification:
• Allows different data types
• to be stored under one identifier
Mark as follows:
One mark for Structure
Two marks for justification.
Alternative
• Two (1D) arrays
• One of string, one of integer
• Where same index links the name with the score

PUBLISHED
2(a) 5
SHAHARYAR LALANI
One mark for:
1 All four boxes correctly labelled and positioned

2 Selection diamond (only on UpdateLoan and no iteration arrows)
3 Parameters to and from LoanExtend()
4 Parameters to and from CheckReserve()
5 Parameters to and from LoanReturn()
2(b) PROCEDURE LoanReturn (LoanID, BookID : STRING, 2

BYREF Fine : REAL)
One mark for each underlined part

PUBLISHED
2(c) Example solution: 6
SHAHARYAR LALANI
One mark for each functional group as listed below:

PUBLISHED
2(c) Explanation of mark points:
SHAHARYAR LALANI
1 Initialise MAX to first value input
2 Set Total to zero
3 Input 49 more values (or 50 values in total)
4 Sum all values input
5 Set new MAX when Input value > MAX in a loop
6 Sum all but largest (or subtract MAX from total), calculate and output
average
3(a)(i) One mark per bullet point: 2
• Data from the arrays is written to the files at the end of the day / before the
program is terminated / computer is switched off
• Data can then be read from the files at the start of the next day and written to
/ stored in the arrays
• No need to (re-)enter the data manually // only need to enter data once
Note: Max 2 marks
3(a)(ii) • The data is retained when the program is terminated / after the computer is 1
switched off // data is stored permanently // non-volatile storage
3(a)(iii) One mark per bullet point: 2
• Data items are combined to form a single string / saved as a single line in the
file
• Data items are separated by a special character // make each data item a
fixed length
ALTERNATIVE:
• Convert all data items / 'number of people' to strings

• Consecutive / each line stores a separate data item

PUBLISHED
3(b) PROCEDURE Preview (ThisFile : STRING) 5
SHAHARYAR LALANI
DECLARE LineNum : INTEGER
DECLARE ThisLine : STRING
OPENFILE ThisFile FOR READ

IF EOF(ThisFile) THEN
OUTPUT “Warning Message”
ELSE
LineNum ← 1
WHILE LineNum < 6 AND NOT EOF(ThisFile)
READFILE Thisfile, ThisLine
OUTPUT ThisLine
LineNum ← LineNum + 1
ENDWHILE
ENDIF
CLOSEFILE ThisFile
ENDPROCEDURE
Marks as follows:
1 Procedure heading (including parameter) and ending

2 File OPEN and subsequently CLOSE
3 Check if file is empty and output a warning message if it is
4 Conditional Loop
5 Output line (including blank lines) and read next line in a loop

PUBLISHED
4(a) 5
Name Flag Index NewName ThisChar
SHAHARYAR LALANI
"∇in∇a∇∇Cup"
TRUE 1 ""
'∇'
"∇"
2 'i'
FALSE "∇I"
3 'n'
"∇In"
4 '∇'
TRUE "∇In∇"
5 'a'
FALSE "∇In∇A"
6 '∇'
TRUE "∇In∇A∇"
7 '∇'
"∇In∇A∇∇"
8 'C'
FALSE "∇In∇A∇∇C"
9 'u'
"∇In∇A∇∇Cu"
10 'p'
"∇In∇A∇∇Cup"
FALSE 11 "∇In∇A∇∇Cup" 'p'
Mark as follows:
• One mark for each of columns 2 to 5 (condone missing final 11)
• One mark for final row all correct (including final 11)

PUBLISHED
4(b) Loop structure: A count-controlled loop 2
SHAHARYAR LALANI
Justification: The number of iterations is known
One mark per point
4(c)(i) A couple of solutions: 1
24 ThisChar ← LCASE(MID(Name, Index, 1)
ALTERNATIVE:
31 NewName ← NewName & LCASE(ThisChar)
Ignore line number
4(c)(ii) One mark for each: 2
Line number: 26
New position: Move to after line 27 / line 28

PUBLISHED
5 PROCEDURE Sort() 8
SHAHARYAR LALANI
DECLARE Temp : INTEGER
DECLARE NoSwaps : BOOLEAN
DECLARE Boundary, Row, Col : INTEGER
Boundary ← 999
REPEAT
NoSwaps ← TRUE
FOR Row ← 1 TO Boundary
IF Result[Row, 2] > Result[Row + 1, 2] THEN
FOR Col ← 1 TO 2
Temp ← Result [Row, Col]
Result [Row, Col] ← Result [Row + 1, Col]
Result [Row + 1, Col] ← Temp
NEXT Col
NoSwaps ← FALSE
ENDIF
NEXT J
Boundary ← Boundary - 1
UNTIL NoSwaps = TRUE
ENDPROCEDURE
Mark as follows:
1 Outer loop
2 Inner loop
3 Correct comparison in a loop
4 Correct swap of col1 array elements in a loop
5 Correct swap of col2 array elements in a loop (via loop or separate
statements)
6 'NoSwap' mechanism: Conditional outer loop including flag reset
7 'NoSwap' mechanism: Set flag in inner loop to indicate swap
8 Reducing Boundary in the outer loop
6(a) One mark per point: 4
1 Check for a free node

2 Search for correct insertion point
3 Assign data value B to first node in free list / node pointed to by start
pointer of free list
4 Pointer from A will be changed to point to node containing B (instead of
C)
5 Pointer from B will be changed to point to node containing C
6 Start pointer in free list moved to point to next free node
Note: max 4 marks

PUBLISHED
6(b) One mark per point: 2
SHAHARYAR LALANI
• An array (1D) to store the data and a second array (1D) to store the pointers
• An (integer) variable to hold the start pointer and an (integer) variable to store
the next free pointer
ALTERNATIVE:
• Define a record type comprising a data element and a pointer and declare an
array (1D) of this type
• An integer variable to hold the start pointer and an integer variable to store
the next free pointer

PUBLISHED
7(a) FUNCTION GetStart (WordNum : INTEGER) RETURNS INTEGER 7
SHAHARYAR LALANI
DECLARE Index, ThisPos, NumFound : INTEGER
DECLARE ThisChar : Char
CONSTANT SPACECHAR = ' '
Index ← -1
Numfound ← 0
ThisPos ← 1
IF WordNum = 1 THEN // if looking for word 1...

Index ← 1 // Word 1 always starts at index
// position 1
ELSE
// Otherwise start counting spaces...
WHILE ThisPos <= LENGTH(FNString) AND Index = -1
ThisChar ← MID(FNString, ThisPos, 1)
IF ThisChar = SPACECHAR THEN
NumFound ← NumFound + 1
IF NumFound = WordNum - 1 THEN
Index ← ThisPos + 1 // the start of the
// required word
ENDIF
ENDIF
ThisPos ← ThisPos + 1
ENDWHILE
ENDIF
RETURN Index
ENDFUNCTION
1 Function heading, including return type and function end

2 Loop counting spaces until word found or end of FNString
3 extract a character from FNString in a loop
4 compare with SPACECHAR and increment count if equal in a loop
5 compare count with WordNum - 1 (depending on initialisation
value) in a loop
6 if equal then set flag or Index to ThisPos + 1 in a loop
7 Return Index (correctly in all cases / following a reasonable attempt)
8 Works for special case when looking for word 1
Note: Max 7 marks

PUBLISHED
7(b) Marks awarded for any reference to each of the following steps of the algorithm: 4
SHAHARYAR LALANI
1 Mention of variable for use as array index
2 Use of a loop (to check through the array)
3 If word is the same as the current array element then return FALSE /
set flag
4 If word not already in array, loop to find unused element (second loop)
5 Store word in unused element and return TRUE, otherwise return
FALSE
VARIATION:
1 Mention of variable for use as array index

2 Use of a loop (to check through the array)
3 Save index of (first) unused element found
4 If word is the same as the current array element then return FALSE /
set flag
5 If word not already in array and unused element available, store word in
unused element and return TRUE otherwise return FALSE
Note: Max 4 marks

PUBLISHED
7(c) FUNCTION GetWord (Index : INTEGER) RETURNS STRING 5
SHAHARYAR LALANI
DECLARE NextWord : STRING
DECLARE Done : BOOLEAN
DECLARE ThisChar : CHAR
DECLARE Index : INTEGER
NextWord ← ""
Done ← FALSE
REPEAT
ThisChar ← MID(FNString, Index, 1)
IF ThisChar <> SPACECHAR THEN
NextWord ← NextWord & ThisChar // build up NextWord
ENDIF
IF ThisChar = SPACECHAR OR Index = LENGTH(FNString) THEN
Done ← TRUE
ENDIF
Index ← Index + 1
UNTIL Done = TRUE
RETURN NextWord
ENDFUNCTION
1 Conditional loop
2 Extract char from FNString and compare with SPACECHAR in a
loop
3 Concatenate with NextWord if not SPACECHAR in a loop
4 Exit loop when SPACECHAR encountered or when end of FNString
reached
5 Return NextWord (after reasonable attempt at forming, and must have
been initialised)

PUBLISHED
7(c) The ‘length and substring’ solution:
SHAHARYAR LALANI
FUNCTION GetWord (Index : INTEGER) RETURNS STRING
DECLARE Done : BOOLEAN
DECLARE Index, NextPos : INTEGER
Done ← FALSE
NextPos ← Index // must be at least one character in
// the required word
REPEAT
ThisChar ← MID(FNString, NextPos, 1)
IF ThisChar = SPACECHAR OR NextPos =
LENGTH(FNString) THEN
Done ← TRUE
ELSE
NextPos ← NextPos + 1
ENDIF
UNTIL Done = TRUE
IF NextPos = LENGTH(FNString) THEN

NextPos ← NextPos - 1 // special case when last word
ENDIF
RETURN MID(FNString, Index, NextPos - Index)
ENDFUNCTION
1 Conditional loop
2 ...extract char from FNString and compare with SPACECHAR in a
loop
3 .. increment count if word continues
4 Exit loop when SPACECHAR encountered or when end of FNString
reached
5 Apply substring function and Return

SHAHARYAR LALANI
Paper 2 Problem Solving & Programming Skills May/June 2021
MARK SCHEME
Maximum Mark: 75
Published
Teachers.
Cambridge International is publishing the mark schemes for the May/June 2021 series for most Cambridge
IGCSE™, Cambridge International A and AS Level components and some Cambridge O Level components.

PUBLISHED
SHAHARYAR LALANI
responses seen).

PUBLISHED
1(a)(i) 4
Variable Example data value Data type
SHAHARYAR LALANI
Name "Catherine" STRING
Index 100 INTEGER
Modified FALSE BOOLEAN
Holiday 25/12/2020 DATE
One mark per data type
1(a)(ii) 4
Modified OR Index > 100 FALSE
LENGTH("Student: " & Name) 18
INT(Index + 2.9) 102
MID(Name, 1, 3) "Cat"
One mark per value

Quotation marks must be present for final row and must be capital C
1(b) 3
Statement Selection Assignment Iteration
Index ← Index + 1 
IF Modified = TRUE THEN 
ENDWHILE 
One mark per row
2(a)(i) 4
The number of transitions that result in a different state 3
The number of transitions with associated outputs 2
The label that should replace ‘X’ Start
The final or halting state S3
One mark per row

PUBLISHED
2(a)(ii) Number of outputs: 1 2
SHAHARYAR LALANI
Current state: S2
2(b)(i) Answers include: 2
• User ID / Username
• Book ID
• Date of loan / return date
One mark for 1 correct

Two marks for all 3 correct
Note: Max 2 marks
2(b)(ii) Many examples but must be data that is NOT required for a loan, but which 1
COULD be required somewhere by the library system.
Note: must be data relating to users, books or loans
Answers include:
• Users name / address / phone number / DOB
• Book title / author / publisher / library rack number / ISBN number /
price
• Date of loan / return date (if not already given in part (i))
• The length of the loan (assumed to be the same for all books)
2(b)(iii) Many examples including: 2
• Create loan / borrow book

• Return book
• Send letter / email / contact a user ref an overdue book
• View the loan history for a given book
• View the loan history for a given user
One mark for each
Note: Max 2 marks
3(a) Linked list 1
3(b) Start pointer 1
3(c) One mark for each: 2
Name: Null pointer
Meaning: There are no further nodes in the list

PUBLISHED
3(d) 2
SHAHARYAR LALANI
One mark for:
• Start Pointer pointing to ‘Cat’ node

• Remaining arrows: Cat → Dolphin → Elk → Fish
4 Marks awarded for a description of each of the following steps of the 6

algorithm:
1 Reference variables for Count of students and Total marks

2 Loop through all students (Count)
3 Input individual mark (in loop)
4 Compare mark with threshold / boundary values to determine grade
(in loop)
5 Output the grade for a student (in loop)
6 Maintain a Total (and Count if required) (in loop)
7 Calculate average by dividing Total by Count and Output (after loop)
Note: Max 6 marks

PUBLISHED
5(a)(i) DECLARE RNum : ARRAY[1:100] OF INTEGER 6
SHAHARYAR LALANI
DECLARE Index, Count : INTEGER
Count ← 0
FOR Index ← 1 TO 100
RNum[Index] ← INT(RAND(200)) + 1
IF RNum[Index] >= 66 AND RNum[Index] <= 173 THEN
Count ← Count + 1
ENDIF
NEXT Index
OUTPUT Count
Mark as follows:
1 Array declaration
2 Loop for 100 iterations
3 Array element index 'syntax' (left-hand side of assignment
expression) in a loop
4 Use of RAND() to generate value in range (and assign to array
element) in a loop
5 Check if random number within range and if so, increment count in
a loop
6 Output of count (following a reasonable attempt) after the loop
5(a)(ii) One mark per bullet / sub-bullet point 3
1 Initialise the array to a rogue value (to indicate 'unassigned' element)

2 Add a conditional loop to:
3 Generate and store a random number (in the correct range)
4 Check the stored number against values already in the array
5 If the stored number is found then generate another random value
6 Otherwise add it to the array (and exit loop)
Note: Max 3 marks
5(b)(i) 4
Answer
Give a line number containing an example of an 07

initialisation statement.
Give a line number containing the start of a repeating 09 / 10

block of code.
Give a line number containing a logic statement. 12
Give the number of parameters of function MID(). 3
One mark for each row
5(b)(ii) IF (NextChar >= 'a') AND (NextChar <= 'z') THEN 2
One mark for IF ... AND ...

One mark for both conditions

PUBLISHED
6 PROCEDURE CountVowels(ThisString : STRING) 8
SHAHARYAR LALANI
FOR Index ← 1 to 6
CharCount[Index] ← 0 //initialise elements
NEXT Index
Index ← 1
FOR Index ← 1 TO LENGTH(ThisString)

ThisChar ← LCASE(MID(ThisString, Index, 1))
CASE OF ThisChar
'a' : CharCount[1] ← CharCount[1] + 1
'e' : CharCount[2] ← CharCount[2] + 1
'i' : CharCount[3] ← CharCount[3] + 1
'o' : CharCount[4] ← CharCount[4] + 1
'u' : CharCount[5] ← CharCount[5] + 1
'a' TO 'z': CharCount[6] ← CharCount[6] + 1
ENDCASE
NEXT Index
FOR Index ← 1 to 6
OUTPUT CharCount[Index] //output results
NEXT Index
ENDPROCEDURE
1 Procedure heading (with parameter) and ending

2 Declare local variable for Index as loop counter but not CharCount
array
3 Initialise elements of CharCount array to zero
4 Loop through all characters in ThisString
5 Use of MID() to extract single character
6 Test for each vowel and increment associated count
7 Test for consonants and increment associated count
8 Output the results (supporting text not necessary) after the loop
Note: Max 7 if CharCount not used to store count

PUBLISHED
7(a) Test string should contain: 3
SHAHARYAR LALANI
• At least one leading space (before the first word)
• at least one trailing space (after the last word)
• at least one instance of multiple spaces between words
• At least one upper case character
Mark as follows:
One mark for one correct
Two marks for three correct
Three marks for all correct
7(b) One mark for each: 2
• Dry run / produce a trace table / walk through the code

• Add output statements to allow the code to be tracked
• Insert a Breakpoint into the program // use single-stepping to execute
instructions // monitor variables using a watch window
• Try different test values to see which ones fail
Note: Max 2 marks

PUBLISHED
8(a) FUNCTION IgnoreWord (ThisWord : STRING) RETURNS BOOLEAN 5
SHAHARYAR LALANI
DECLARE Found : BOOLEAN
Found ← False
Index ← 1
ThisWord ← TO_LOWER(ThisWord)
REPEAT
IF TO_LOWER(IgnoreList[Index]) = ThisWord THEN
Found ← TRUE
ENDIF
Index ← Index + 1
UNTIL Found = TRUE OR Index > 10
RETURN Found
ENDFUNCTION
1 Loop through array elements

2 Convert both strings to same case
3 Compare array element with parameter in a loop
4 Set a flag (or similar) if match found (after reasonable attempt at
MP3) in a loop
5 Return TRUE or FALSE in all cases
Note: Max 4 if function declaration incorrect

PUBLISHED
8(b) Procedure GetInitials() 8
SHAHARYAR LALANI
DECLARE NewString, NextWord : STRING
DECLARE ThisWordNum, Index : INTEGER
ThisWordNum ← 0
NewString ← ""
REPEAT
ThisWordNum ← ThisWordNum + 1
Index ← GetStart(ThisWordNum)
IF Index <> -1 THEN //if there is ThisWordNum
NextWord ← GetWord(Index)
IF IgnoreWord(NextWord) = FALSE THEN
NewString ← NewString & UCASE(LEFT(NextWord, 1))
ENDIF
ENDIF
UNTIL Index = -1
OUTPUT NewString
ENDPROCEDURE

1 Declare NewString and initialise to empty string
2 Conditional loop to pick out all words from FNString
3 Evaluate result of GetStart() in a loop
4 Test result <> -1 and if not:
5 Assign result of GetWord()to a variable in a loop
6 Test result of IgnoreWord()in a loop
7 If not ignored, add the next initial letter to NewString in a
loop
8 Increment ThisWordNum (must have been initialised) in a loop
9 Output NewString (must be all upper case) outside loop
Note: Max 8 marks

SHAHARYAR LALANI
Paper 2 Problem Solving & Programming October/November 2021
MARK SCHEME
Maximum Mark: 75
Published
Teachers.
Cambridge International is publishing the mark schemes for the October/November 2021 series for most
Cambridge IGCSE™, Cambridge International A and AS Level components and some Cambridge O Level
components.

9618/21 Cambridge International AS & A Level – Mark Scheme October/November
PUBLISHED 2021
SHAHARYAR LALANI
responses seen).

PUBLISHED 2021
1(a)(i) One from: 1
SHAHARYAR LALANI
• The program obeys the rules / grammar of the programming language
used
• The program will run // it can be compiled / interpreted
• Accept by example. e.g. 'no mis-spelt keywords' / 'all brackets match'
1(a)(ii) One mark for type plus one for corresponding description 2
Type of error: A logic error
Description:
• An error in the algorithm / design of the solution
• the program does not behave as expected / give the expected output.
• Accept by example e.g. wrong arithmetic operator used / wrong loop
count
OR
Type of error: Run-time error
Description:
• The program performs an illegal instruction / invalid operation
• Accept by example: divide by zero or endless loop or simply 'crashes' /
freezes
1(b) 4
Use of variable Data type
The average mark in a class of 40 students REAL
An email address STRING
The number of students in the class INTEGER
Indicate whether an email has been read BOOLEAN
One mark per row

PUBLISHED 2021
1(c)(i) 3
Information Essential Not essential
SHAHARYAR LALANI
Departure time 
Flight Number 
Departure airport 
Aircraft type 
Ticket price 
Number of seats in aircraft 
One mark for two rows correct

Two mark for four rows correct
Three mark for all rows correct
1(c)(ii) One mark for technique and one for benefit, Max 1 mark for 'Benefit' 2
Technique: Abstraction
Benefit:
• The solution is simplified so easier / quicker to design / implement
• The system is tailored to the need of the user
1(c)(iii) Answers include: 2
• Destination / arrival airport

• Arrival time / flight duration
• Date of flight
• Seat number
• Seat availability
Max 2 marks
2(a) One mark for reference to: 6
1 The use a variable as an index to the array

2 A loop to iterate through the array
3 An Inner loop (with a reducing range)
4 Test if current element is greater than next element
5 if so then swap elements
6 Description of swap
7 Attempt at efficient algorithm
Max 6 marks

PUBLISHED 2021
2(b) Count ← 1 6
SHAHARYAR LALANI
Flag ← FALSE
WHILE Flag = FALSE AND Count <= 5
CALL ReBoot()
Count ← Count + 1
Flag ← Check()
ENDWHILE
IF Flag = FALSE THEN

CALL Alert(27)
ENDIF
One mark per point:
1 Initialisation of Count AND Flag

2 WHILE ... ENDWHILE // REPEAT ... UNTIL loop
3 ... including both conditions
4 Call ReBoot() AND increment Count inside the loop
5 Assign return value from Check() to Flag inside the loop
6 Final test of Flag AND call to Alert(27) not in a loop
3(a)(i) One mark per point: 2
• EoQ pointer will move to point to location 4 // incremented EoQ (by 1)

• Data value "Octopus" will be stored in location pointed to be EoQ /
location 4
3(a)(ii) One mark for each bullet 2
• Value "Frog" // value pointed to by FoQ / location 0 is assigned to variable

AnimalName
• FoQ pointer will move to point to location 1 / point to "Cat" // incremented
FoQ (by 1)
0 Frog ← Front of queue pointer
1 Cat
2 Fish
3 Elk ← End of queue pointer
3(a)(iii) There is only one data item in the queue 1

PUBLISHED 2021
3(b)(i) One mark for data values plus one mark for pointers 3
SHAHARYAR LALANI
0 Frog
1 Cat
2 Fish ← Front of queue pointer
3 Elk
4 Wasp
5 Bee
6 Mouse ← End of queue pointer
One mark for each pointer

One mark for three new data values
3(b)(ii) 2
0 Shark ← End of queue pointer
1 (Cat)
2 (Fish)
3 (Elk)
4 Wasp ← Front of queue pointer
5 Bee
6 Mouse
7 Dolphin
One mark for BOTH pointers

One mark for all data values as shown
3(c) One mark per point: 3
1 If incremented EoQ = FoQ then error condition: queue is full

2 Increment the EoQ
3 Manage wrap-around

PUBLISHED 2021
4(a) 4
Test Test data value Explanation Expected Outcome
SHAHARYAR LALANI
1 23 Normal Data Data is accepted
2 0 Boundary Data Data is accepted
3 40 Boundary Data Data is accepted
4 >= 41 Abnormal Data Data is rejected
5 <= −1 Abnormal Data Data is rejected
One mark per row for rows 2 to 5.
4(b) 3
One mark for each label:
• Temp < 10 (Heaters Off to Heaters On)

• Temp > 20 (Heaters On to Heaters Off)
• on BOTH loops (non-contradictory values)
5(a) One mark for the character and one for the corresponding reason. 2
• Character: Any except alphabetic, numeric, ',' ':' or space
• Reason: character doesn't occur in data to be recorded
5(b) Design 1

PUBLISHED 2021
5(c) FUNCTION LogEvents(StudentID : STRING) RETURNS INTEGER 7
SHAHARYAR LALANI
DECLARE FileData : STRING
DECLARE Index, Count : INTEGER
CONSTANT LogFile = "LogFile"
Count ← 0
OPENFILE LogFile FOR APPEND
FileData ← LogArray[Index]
IF LEFT(FileData, 6) = StudentID THEN

WRITEFILE (LogFile, FileData) //brackets optional
Count ← Count + 1
LogArray[Index] ← "" // clear the element
ENDIF
NEXT Index
CLOSEFILE LogFile
RETURN Count
ENDFUNCTION
1 Function heading and ending including parameter and return type

2 OPEN file LogFile for APPEND and subsequent CLOSE
3 Loop for 2000 iterations
4 Extract first 6 characters from array element in a loop
5 Compare first 6 characters with parameter in a loop
6 If equal:
• write whole array element string to file and
• increment Count and
• clear array element in a loop
7 Return Count (must have been declared and initialised)

PUBLISHED 2021
6(a) PROCEDURE SetRow(Row, SkipNum, SetNum : INTEGER) 5
SHAHARYAR LALANI
DECLARE Col : INTEGER
// array is 1280 x 800
FOR Col ← SkipNum + 1 TO SkipNum + SetNum

Screen[Row, Col] ← 1
NEXT Index
ENDPROCEDURE
ALTERNATIVE 1:
FOR Col ← 1 TO SetNum

Screen[Row, SkipNum + Col] ← 1
NEXT Col
ALTERNATIVE 2:
WHILE SetNum > 0

Screen[Row, SkipNum + SetNum] ← 1
SetNum ← SetNum - 1
ENDWHILE
Mark as follows:
1 Procedure heading and ending including parameters

2 Declaration of local Integer for Col
3 Count-controlled loop with meaningful start number
4 correct stop number
5 Reference Screen Array element and set to 1 in a loop

PUBLISHED 2021
6(b) FUNCTION SearchInRow(ThisRow, StartCol : INTEGER) RETURNS 8
SHAHARYAR LALANI
INTEGER
DECLARE ThisCol, Step : INTEGER
DECLARE Found: BOOLEAN
// array is 1280 x 800
Found ← FALSE
ThisCol ← StartCol
// first decide which way to search

IF StartCol = 1 THEN
Step ← 1
EndCol ← 1281
ELSE
Step ← -1
EndCol ← 0
ENDIF
WHILE ThisCol <> EndCol AND Found = FALSE

IF Screen[ThisRow, ThisCol] <> 1 THEN
ThisCol ← ThisCol + Step
ELSE
Found ← TRUE
ENDIF
ENDWHILE
IF Found = FALSE THEN

ThisCol ← -1
ENDIF
RETURN ThisCol
ENDFUNCTION
Mark as follows:
1 Interpreting StartCol parameter to determine direction of search

2 An attempt at searching both up and down
3 Conditional Loop / Count-controlled loop with use of ThisCol index
4 Using correct values for StartCol, EndCol and Step
5 Reference a Screen element and compare with 1 in a loop
6 If equal save column or immediately Return column in a loop
7 Return column number or −1
Loop(s) terminate when element with value = 1 found
Max 7 marks if function heading, including return type, and ending is incorrect
or incomplete

PUBLISHED 2021
6(c) FUNCTION GetCentreCol(ThisRow : INTEGER) RETURNS INTEGER 6
SHAHARYAR LALANI
DECLARE StartCol, EndCol, CentreCol : INTEGER
StartCol ← SearchInRow(ThisRow, 1)
IF StartCol = -1 THEN
CentreCol ← StartCol
ELSE
EndCol ← SearchInRow(ThisRow, 1280)
CentreCol ← INT((StartCol + EndCol)/2)
ENDIF
RETURN CentreCol
ENDFUNCTION
Mark as follows:
1 Declaration of local INTEGER for return value

2 Use SearchInRow() with correct parameters and check for -1
3 Use SearchInRow(ThisRow, 1) and SearchInRow(ThisRow,
1280)
4 Calculate centre column
5 Use of INT() function // use of DIV
6 Return –1 or centre value
Max 5 marks if function heading, including return type, and ending is incorrect
or incomplete

SHAHARYAR LALANI
MARK SCHEME
Maximum Mark: 75
Published
teachers.
components.

PUBLISHED 2021
SHAHARYAR LALANI
responses seen).

PUBLISHED 2021
1(a) The process involves: 2
SHAHARYAR LALANI
1 Breaking down a problem / task into sub problems / steps / smaller parts
2 In order to explain / understand // easier to solve the problem
3 Leading to the concept of program modules // assigning problem parts to
teams
Max 2
1(b) 3
Answer
The number of dimensions of ThisArray 1
The technical terms for minimum and Lower bound, upper bound
maximum values that variable n may take
The technical term for the variable n in the Index / Subscript

pseudocode expression.
One mark per row
1(c) 4
ASC('C') 67
2 * STR_TO_NUM ("27") 54
INT(27 / 2) 13
"Sub" & MID("Abstraction" , 4 , 5) "Subtract"
One mark per row
Function names must be exactly as shown
1(d) 2
PressureOK AND HiFlow FALSE
PumpOn OR PressureOK TRUE
NOT PumpOn OR (PressureOK AND NOT HiFlow) TRUE
NOT (PumpOn OR PressureOK) AND NOT HiFlow FALSE
1 mark for any two rows correct

2 marks for all rows correct.

PUBLISHED 2021
2(a) 5
SHAHARYAR LALANI
One mark for each outlined group.
Note:
• Sum and increment steps (bottom-right rectangles) may be in reverse
order in which case sum group will have two output lines
• Max 4 for non-working solution

PUBLISHED 2021
2(b)(i) One mark for each: 2
SHAHARYAR LALANI
Life cycle method: Iterative // Rapid Application Development (RAD)
Reason: Provides a working model / prototype at an early stage for the

principal to approve / review
2(b)(ii) Decisions will be made regarding: 3
• Data structures
• Algorithms / flowcharts / pseudocode
• Program structure (modules) / use of library routines / module - team
allocation
• User interface // Web-page layout / content (for given scenario)
• Testing method / plan
• Choice of programming language / program environment
Max 3
3(a)(i) Pseudocode: 3
TYPE Student
DECLARE StudentID : STRING
DECLARE Email : STRING
DECLARE Club_1 : INTEGER
ENDTYPE
Mark as follows:
• One mark for TYPE and ENDTYPE

• One mark for StudentID and Email fields as STRING
• One mark for all Club fields as INTEGER
3(a)(ii) DECLARE Membership : ARRAY [1:3000] OF Student 2
3(a)(iii) One mark for any one of: 1
• Assign a value (of the corrrect data type) outside the normal range to one
of the fields
• Assign an empty string to the StudentID field / Email field
• or value out of range to any club field
3(a)(iv) A number outside the range 1 to 99 1

PUBLISHED 2021
3(b) PROCEDURE GetIDs() 7
SHAHARYAR LALANI
DECLARE ThisClub, Count : INTEGER
OUTPUT "Please Input Club Number: "

INPUT ThisClub
Count ← 0

IF Membership[Index].Club_1 = ThisClub OR __
Membership[Index].Club_2 = ThisClub OR __
Membership[Index].Club_3 = ThisClub THEN
Count ← Count + 1
OUTPUT Membership[Index].StudentID
ENDIF
NEXT Index
OUTPUT "There are ", Count, " Students in the club"

ENDPROCEDURE
Mark as follows:
1 Declare and initialise Count

2 Prompt and Input club number before the loop
3 Loop through 3000 elements
4 Compare one club field with number input
5 Compare all Club fields with number input
6 If number found, OUTPUT of StudentID field and increment Count
7 Final OUTPUT of Count outside the loop
Note:
Max 6 if procedure heading and ending missing or incorrect (but allow array
as parameter)
4(a) 5
Answer
A line number containing a variable being incremented 19 / 21 / 23
The type of loop structure pre-condition
The number of functions used 3
The number of parameters passed to function 1

STR_TO_NUM()
The name of a procedure other than Check() Result

PUBLISHED 2021
SHAHARYAR LALANI
• Meaningful variable names
• Indentation / white space / blank lines
• Capitalisation of keywords
4(c)(i) One mark per point: 2
Structure: A count-controlled loop
Justification: The number of iterations is known // repeats for the length of

InString
4(c)(ii) 15, 23 1
One mark for both line numbers

PUBLISHED 2021
5(a) PROCEDURE MakeNewFile(OldFile, NewFile, Status : STRING) 7
SHAHARYAR LALANI
DECLARE Line1, Line2, Line3 : STRING
DECLARE NumCopied, NumRecs : INTEGER
NumRecs ← 0
NumCopied ← 0
OPENFILE OldFile FOR READ

OPENFILE NewFile FOR WRITE
WHILE NOT EOF(OldFile)

READFILE OldFile, Line1
NumRecs ← NumRecs + 1
IF Line3 <> Status THEN
WRITEFILE NewFile, Line1
NumCopied ← NumCopied + 1
ENDIF
ENDWHILE
OUTPUT "File " , OldFile , " contained " , NumRecs ,__

" employee details"
OUTPUT Numcopied , " employee sets of details were __
written to file", NewFile
CLOSEFILE OldFile
CLOSEFILE NewFile
ENDPROCEDURE
Mark as follows:
1 Procedure heading and ending, including parameters

2 OPEN OldFile for READ and NewFile for WRITE and subsequently
CLOSE both files
3 Conditional loop until EOF(OldFile)
4 Read three lines from OldFile in a loop
5 Compare 3rd line read with Status parameter and if not equal write
3 lines to NewFile in a loop
6 Count number of sets read and those written in a loop
7 Final output including both counts and file names with suitable text after a
loop
Note:
MP6: Both counts must have been declared and initialised
5(b)(i) Store all three items on one line 1

PUBLISHED 2021
5(b)(ii) One mark per point: 2
SHAHARYAR LALANI
Advantage: Fewer file operations required
Disadvantage: Algorithm to combine / extract individual data items is more

complex
6(a) FUNCTION FirstRowSet() RETURNS INTEGER 7

DECLARE Row, Col : INTEGER
// array is 1280 × 800

Row ← 1
Found ← FALSE
WHILE Row <= 800 AND Found = FALSE // top to bottom
Col ← 1
WHILE Col <= 1280 AND Found = FALSE // left to right
IF Screen[Row,Col] = 1 THEN
Found ← TRUE // end function as soon as first
// found
ENDIF
Col ← Col + 1
ENDWHILE
Row ← Row + 1
ENDWHILE
IF Found = FALSE THEN // nothing found

Row ← 0
ENDIF
RETURN Row - 1
ENDFUNCTION
Mark as follows:
1 Function heading and ending and return type

2 (Conditional) outer loop 1 to 800 (row)
3 (Conditional) inner loop 1 to 1280 // 1280 to 1 (column)
4 Reference Screen element and test for = 1 // <> 0
5 and if true save row number and exit loops
6 Increment index variables in both inner and outer loop
7 Return Row number or −1, following a reasonable attempt
6(b) One mark for: 2
• (A flag is used to) exit the loops // iteration is terminated

• as soon as a Screen element with value 1 is found

PUBLISHED 2021
6(c)(i) One mark for: 2
SHAHARYAR LALANI
• Parameter(s) need to be passed to the module to identify the type of
search
• Search algorithm is controlled by (global) variables / parameters
Alternative:
• The search algorithms from the original modules are included in the new
module
• The new module needs to return / store the four values (the results of the
four searches)
6(c)(ii) One mark for advantage and one for disadvantage: 2

Advantage: (max 1)
• Only have to change one module if specification changes
• Less repetitive code / fewer lines of code
• Aids re-usability
Disadvantage: (max 1)
• Single module more complex / more error prone / more difficult to
debug ...
• Single module cannot be split among programmers / teams
Max 2
6(d) PROCEDURE GetCentre () 6

DECLARE StartRow, EndRow, StartCol, EndCol : INTEGER
StartRow ← FirstRowSet()
IF StartRow = -1 THEN
CentreRow ← -1 // no 'touch' detected
ELSE
EndRow ← LastRowSet()
StartCol ← FirstColSet()
EndCol ← LastColSet()
CentreRow ← INT((StartRow + EndRow)/2)
CentreCol ← INT((StartCol + EndCol)/2)
ENDIF
ENDPROCEDURE
Mark as follows:
1 Call <any Set function> and check for -1 // check for no element set
2 ...and if so set CentreRow to –1
3 Call all 4 Set functions to get 'extremity' values
4 Calculate centre row and centre column
5 Use of INT() function or DIV operator on values from MP4
6 Assign calculated values to CentreRow and CentreCol
Note:
Max 5 if procedure heading and ending missing or incorrect (ignore array if
passed as a parameter) or any local variables are undefined or of incorrect
type

SHAHARYAR LALANI
Paper 21 Fundamental Problem Solving & Programming Skills May/June 2022
MARK SCHEME
Maximum Mark: 75
Published
Teachers.
Cambridge International is publishing the mark schemes for the May/June 2022 series for most
Cambridge IGCSE, Cambridge International A and AS Level and Cambridge Pre-U components, and some
Cambridge O Level components.

PUBLISHED
SHAHARYAR LALANI
 the specific content of the mark scheme or the generic level descriptors for the question
 the specific skills defined in the mark scheme or in the generic level descriptors for the question
 the standard of response required by a candidate as exemplified by the standardisation scripts.
 marks are awarded for correct/valid answers, as defined in the mark scheme. However, credit
 marks are awarded when candidates clearly demonstrate what they know and can do
 marks are not deducted for errors
 marks are not deducted for omissions
 answers should only be judged on the quality of spelling, punctuation and grammar when these
responses seen).

PUBLISHED
1(a) An algorithm 1
SHAHARYAR LALANI
1(b)(i) 4
Variable Use of variable Data type
Temp Stores the average temperature REAL
PetName Stores the name of my pet STRING
MyDOB To calculate how many days until my DATE

next birthday
LightOn Stores state of light; light is only on or off BOOLEAN
One mark for each data type
1(b)(ii) One mark for variable name, and one for reason 2
Variable: Temp
Reason: Name does not indicate what the variable is used for
1(c) 4
Expression Evaluation
INT((31 / 3) + 1) 11
MID(TO_UPPER("Version"), 4, 2) "SI"
TRUE AND (NOT FALSE) TRUE
NUM_TO_STR(27 MOD 3) "0"
One mark per row
2(a) One mark per row 3

Answer
The number of different inputs 3
The number of different outputs 3
The single input value that could result in S4 Button-Y

PUBLISHED
2(b) One mark per row 4
SHAHARYAR LALANI
Example answer
Note: Accept other valid answers
3(a) One mark per description of appropriate sub-problem for given scenario. 3
Examples include:
 Allows the user to search for films being shown // input name of film they
want to see
 Allows the user to search for available seats
 Calculate cost of booking
 Book a given number of seats for a particular screening
3(b) Function 1

Answer
The value that has been on the stack for the longest time. 'H'
The memory location pointed to by TopOfStack if three

206
POP operations are performed.

PUBLISHED
4(b) 4
Stack Pointer
SHAHARYAR LALANI
Memory
Value
location
200
201 'D'  TopOfStack
202 'C'
203 'A'
204 'X'
205 'Z'
206 'N'
207 'P'
One mark for:

1 TopOfStack pointing to 'D'
2 Value 'D' in 201
3 Values 'C' & 'A' in 202 and 203
4 Values 'X' to 'P' unchanged (204 to 207)
5 One mark per point to Max 6 6

1 Open file in read mode
2 Set up a conditional loop, repeating until the value is found or the EOF()
is reached
3 Read a line from the file in a loop
4 Extract Field 2
5 Description of how Field 2 could be extracted e.g. using substring
function and lengths of Field 1 and Field 2
6 Compare extracted field with search value
7 If search value found, extract Field 1and Field 3 and output them
8 Close the file after loop has finished

PUBLISHED
6(a) Simple Solution: 5
SHAHARYAR LALANI
DECLARE ThisInt, Count : INTEGER
Count  0
FOR ThisInt  100 TO 200

IF ThisInt MOD 10 = 7 THEN
OUTPUT ThisInt
Count  Count + 1
ENDIF
NEXT ThisInt
OUTPUT Count
Mark as follows:
1 Declare loop variable and counter as integers, counter initialised

2 Loop 100 to 200, no step defined
3 Test value in a loop
4 Output selected value and incrementing a counter in a loop
5 Output the counter, following a reasonable attempt, after the loop
Alternative Solution:
DECLARE ThisInt, Count : INTEGER

Count  0
FOR ThisInt  107 TO 197 STEP 10

OUTPUT ThisInt
Count  Count + 1
NEXT ThisInt
OUTPUT Count
Mark as follows:
1 Declare loop variable and counter as integers, , counter initialised

2 Loop (107 to 197)
3 STEP 10 or explicit increment if conditional loop used
4 Output each value and incrementing a counter in a loop
5 Output the counter, following a reasonable attempt, after the loop

PUBLISHED
6(b) IF MySwitch = 1 THEN 4
SHAHARYAR LALANI
ThisChar  'a'
ELSE
IF MySwitch = 2 THEN
ThisChar  'y'
ELSE
IF MySwitch = 3 THEN
ThisChar  '7'
ELSE
ThisChar  '*'
ENDIF
ENDIF
ENDIF
Mark as follows:
1. ANY test of MySwitch = 1, 2 or 3

2. All three comparisons and corresponding assignments
3. OTHERWISE, or initial assignment of default value
4. Completely correct IF...THEN...ELSE...ENDIF syntax

PUBLISHED
7(a) FUNCTION IsPalindrome(InString : STRING) RETURNS BOOLEAN 7
SHAHARYAR LALANI
DECLARE IsPal : BOOLEAN
DECLARE Index, Num : INTEGER
DECLARE CharA, CharB : CHAR
IsPal  TRUE
Index  1
Num  INT(LENGTH(InString) / 2)
WHILE Index <= Num AND IsPal = TRUE

CharA  MID(InString, Index, 1)
CharB  MID(Instring, LENGTH(Instring) – Index + 1,
1)
IF UCASE(CharA) <> UCASE(CharB) THEN
IsPal  FALSE // RETURN FALSE
ENDIF
Index  Index + 1
ENDWHILE
RETURN IsPal // RETURN TRUE
ENDFUNCTION
Mark as follows:
1 Functions header including parameter, ending and return type

2 Calculation of number of pairs to match (length or half length)
3 Loop for half or whole string
4 …Extracting characters to compare // create reverse string
5 Convert characters to same case
6 Check for mismatch of characters inside loop / test for mismatch after
loop for reversed string
7 Returning Boolean in both cases

PUBLISHED
7(b) 4
Label Text
SHAHARYAR LALANI
A Set OutString to ""
B Is Index > LENGTH(InString)?
C Is MID(InString, Index, 1) = " "?
Set OutString to OutString & MID(InString, Index,

D
1)
E Set Index to Index + 1
F YES
G NO
Mark for each of:

 B
 D
 C
 ...F and G
Note: The mark for F and G is dependent on a reasonable attempt at C

PUBLISHED
8(a) FUNCTION RandomChar() RETURNS CHAR 6
SHAHARYAR LALANI
DECLARE ThisRange : INTEGER
//First select the range

ThisRange  INT(RAND(3)) + 1 // 1 to 3
CASE OF ThisRange
1: ThisChar  CHR(INT(RAND(26) + 65)) // 65 to 90:
'A' to 'Z'
ThisChar  LCASE(ThisChar) // 'a' to 'z'
2: ThisChar  CHR(INT(RAND(26) + 65)) // 65 to 90:
A to Z
3: ThisChar  NUM_TO_STR(INT(RAND(10)) // '0' to '9'
ENDCASE
RETURN ThisChar
ENDFUNCTION
Mark as follows:
1 Generation of any integer random number

2 Randomly decide which of the three ranges to select
3 Selection structure based on range
4 One alphanumeric character range correct
5 All alphanumeric character ranges correct
6 Return ThisChar, following a reasonable attempt to generate a
character in each range

PUBLISHED
8(b) FUNCTION FindPassword(Name: STRING) RETURNS STRING 7
SHAHARYAR LALANI
DECLARE Password : STRING
Password  ""
Index  1
WHILE Password = "" AND Index <= 500

IF Secret[Index, 1] = Name THEN
Password  Decrypt(Secret[Index, 2])
ELSE
Index  Index + 1
ENDIF
ENDWHILE
IF Password = "" THEN

OUTPUT "Domain name not found"
ENDIF
RETURN Password
ENDFUNCTION
Mark as follows:
1 Declare all local variables used, attempted solution has to be reasonable

2 Conditional loop while not found and not end of array
3 Compare value of element in column 1 with parameter passed into
function
4 ...and use Decrypt() with element in column 2 as parameter
5 …use the return value of Decrypt()
6 Output warning message if parameter not found
7 Return STRING value
8(c) One mark for the name, one for the description 3
Name:
 Stub testing
Description:
 A simple module is written to replace each of the modules.
 The simple module will return an expected value // will output a message
to show they have been called
8(d) Accept one example of a valid password to Max 2 2
One mark for each password example that breaks one of the rules due to:
 Length too long // length too short
 Invalid character
 Incorrect grouping (including number of hyphens)
 Duplicated characters

PUBLISHED
8(e) One mark for each part: 3
SHAHARYAR LALANI
 Generate a random integer divisible by 3
 Split range into 1/3 and set as numeric
 Else alphabetic character

SHAHARYAR LALANI
SUBJECT 9618/22
Paper 22 Fundamental Problem Solving & Programming Skills May/June 2022
MARK SCHEME
Maximum Mark: 75
Published
Teachers.

PUBLISHED
SHAHARYAR LALANI
responses seen).

PUBLISHED
1(a) Correct answer only: 1
SHAHARYAR LALANI
Breakpoint
1(b) One mark per row 4
Activity Life cycle stage
An identifier table is produced. Design
Syntax errors can occur. Coding
The developer discusses the program requirements with the Analysis

customer.
A trace table is produced. Testing
1(c) One mark per bullet point to Max 2 2
 A description of what the identifier is used for / the purpose of the identifier
 The data type of the identifier
 The number of elements of an array // the length of a string
 An example data value
 Value of any constants used
 The scope of the variable (local or global)
1(d) One mark per row 4
Statement Error
Status  TRUE AND FALSE NO ERROR
IF LENGTH("Password") < "10" shouldn’t be a string // must be an

"10" THEN integer
Code  Parameter must be a char // cannot be a

LCASE("Electrical") string
Alternative:
LCASE should be TO_LOWER
Result  IS_NUM(-27.3) Parameter must be a string / char //

cannot be a number

PUBLISHED
2 4
One mark per point: SHAHARYAR LALANI

1 Initialise Count before loop AND Input NextNum in a loop
2 Loop until NextNum < 0 AND OUTPUT statement including Count plus a
message
3 Use of IsPrime(NextNum)as a function (must return a value)
4 Check return value AND increment Count if appropriate

PUBLISHED
3(a)(i) One mark per red annotation 3
SHAHARYAR LALANI
3(a)(ii) 3
Label Module name
A Head
B Mod_W
C Mod_X
D Mod_V
E Mod-Z
F Mod_Y
Marks as follows:
 Two rows correct – one mark
 Four rows correct – two marks
 All rows correct – three marks

 Breaking a complex problem down makes it easier to understand / solve //
smaller problems are easier to understand / solve
 Smaller problems are easier to program / test / maintain
 Sub-problems can be given to different teams / programmers with different
expertise // can be solved separately

PUBLISHED
4(a) PROCEDURE LastLines(ThisFile : STRING) 6
SHAHARYAR LALANI
DECLARE ThisLine, LineX, LineY, LineZ : STRING
LineY  ""
LineZ  ""
WHILE NOT EOF(ThisFile)

READFILE Thisfile, ThisLine // read a line
LineX  LineY
LineY  LineZ
LineZ  ThisLine
ENDWHILE
CLOSEFILE ThisFile
OUTPUT LineX
OUTPUT LineY
OUTPUT LineZ
ENDPROCEDURE
Marks as follows to Max 6:

2 Declaration of local variables for three lines AND File OPEN in READ mode AND
CLOSE
3 Loop until EOF(ThisFile)
4 Read line from file... in a loop
5 Attempt at a shuffle… in a loop
6 Correctly shuffle LineX, LineY and LineZ in a loop
7 OUTPUT the three lines in correct sequence, following reasonable attempt

PUBLISHED
4(a) Alternative (using two loops):
SHAHARYAR LALANI
PROCEDURE LastLines(ThisFile : STRING)
DECLARE ThisLine, LineX, LineY, LineZ : STRING
DECLARE Count, Count2 : INTEGER
Count  0
WHILE NOT EOF(ThisFile)

Count  Count + 1
ENDWHILE
CLOSEFILE ThisFile
FOR Count2  1 TO Count - 3

NEXT Count2
READFILE Thisfile, LineX

READFILE Thisfile, LineY
READFILE Thisfile, LineZ
OUTPUT LineX
OUTPUT LineY
OUTPUT LineZ
CLOSEFILE ThisFile
ENDPROCEDURE

2 Declaration of local variables for three lines AND (at least one) File OPEN in
READ mode AND CLOSE
3 Loop until EOF(ThisFile)
4 Read line from file and increment Count in a loop
5 Two separate loops, closing and re-opening the file between loops
6 Read Count - 3 lines from the file
7 OUTPUT the last three lines in correct sequence, following reasonable attempt

PUBLISHED
4(b) One mark per point to Max 3: 3
SHAHARYAR LALANI
1 Change the procedure header to include a (numeric) parameter (as well as the
filename)
2 Replace LineX, Y and Z with an array
3 Amend shuffle mechanism
4 Use new parameter to determine first line to output
5 Output the lines in a loop
Alternative 'two loop' solution to Max 3:

1 Change the procedure header to include a numeric parameter (as well as the
filename)
2 A loop to count the total number of lines in the file
3 Ref use of single variable rather than LineX, LineY and LineZ
4 Close and re-open the file
5 Use the new parameter value to determine first line to output
6 Output the lines in a loop

PUBLISHED
5(a) One mark for type and one mark for condition: 2
SHAHARYAR LALANI
Independent marks
Type: pre-condition
Condition: when the value of ThisNum / the input value is equal to zero
5(b) 6
ThisNum ThisChar CountA CountB Flag OUTPUT
0 10 TRUE
12 '1' 1
24 '2'
57 '5' "Ignored"
43 '4' 9 FALSE
56 '5' 4
22 '2' TRUE "Flip"
31 '3' 8
32 '3' 7
47 '4' 6 FALSE
99 '9' TRUE "Flip"
0 4
Marks as follows:
One mark per outlined group
If no marks per group then mark by columns (columns 3 to 6) for max 4
5(c) One mark per point: 2

 Modules that have already been tested individually
 are combined into a single (sub) program which is then tested as a whole

PUBLISHED
6 PROCEDURE Parse(InString : STRING) 7
SHAHARYAR LALANI
DECLARE Count, Total, Index : INTEGER
DECLARE Average : REAL
DECLARE NumString : STRING
CONSTANT COMMA = ','
Count  0
Total  0
NumString  ""
FOR Index  1 to LENGTH(InString)

ThisChar  MID(InString, Index, 1)
IF ThisChar = COMMA THEN
Total  Total + STR_TO_NUM(NumString)
Count  Count + 1
NumString  ""
ELSE
NumString  NumString & ThisChar // build the number
string
ENDIF
NEXT Index
// now process the final number

Total  Total + STR_TO_NUM(NumString)
Count  Count + 1
Average  Total / Count

OUTPUT "The total was ", Total, " and the average was ",
Average
ENDPROCEDURE
Marks as follows:
1 Declare and initialise Count, Total and NumString
2 Loop for number of characters in InString
3 Extract a character and test for comma in a loop
4 If comma, convert NumString to integer and update Total and Count
5 and reset NumString
6 Otherwise append character to NumString
7 Calculate average AND final output statement(s) outside the loop

PUBLISHED
7(a) FUNCTION MID(InString : STRING, Start, Num : INTEGER) 4
SHAHARYAR LALANI
RETURNS STRING
DECLARE MidString : STRING
DECLARE InStringLen : INTEGER
InStringLen  LENGTH(InString)
// solution for RIGHT() then LEFT()

MidString  RIGHT(InString, InStringLen – Start + 1)
MidString  LEFT(MidString, Num)
// alternative solution for LEFT() then RIGHT()

MidString  LEFT(InString, Start + Num - 1)
MidString  RIGHT(MidString, Num)
RETURN MidString
ENDFUNCTION
Marks as follows:
1 Function heading and ending including parameters and return type
2 Correct use of one substring functions
3 Correct use of both substring functions (in correct sequence)
4 Return substring after a reasonable attempt
7(b) One mark per point 2
Check that:
 Start and/or Num are >= 1 // positive
 Length of InString is "sufficient" for required operation

PUBLISHED
8(a) FUNCTION Exists(ThisString : STRING, Search : CHAR) 5
SHAHARYAR LALANI
RETURNS BOOLEAN
Found  FALSE
Index  1
WHILE Found = FALSE AND Index <= LENGTH(ThisString)

IF MID(ThisString, Index, 1) = Search THEN
Found  TRUE
ELSE
Index  Index + 1
ENDIF
ENDWHILE
RETURN Found
ENDFUNCTION
Marks as follows (Conditional loop solution):

1 Conditional loop while character not found and not end of string
2 Extract a char in a loop
3 Compare with parameter without case conversion in a loop
4 If match found, set termination logic in a loop
5 Return BOOLEAN value
ALTERNATIVE (Using Count-controlled loop):

FOR Index  1 TO LENGTH(ThisString)
IF MID(ThisString, Index, 1) = Search THEN
RETURN TRUE
ENDIF
NEXT Index
RETURN FALSE
Marks as follows (Count-controlled loop variant):

1 Loop for length of ThisString (allow from 0 or 1)
2 Extract a char in a loop
3 Compare with parameter without case conversion in a loop
4 If match found, immediate RETURN of TRUE
5 Return FALSE after the loop // Return Boolean if no immediate RETURN

PUBLISHED
8(b) PROCEDURE SearchDuplicates() 8
SHAHARYAR LALANI
DECLARE IndexA, IndexB : INTEGER
DECLARE ThisPassword, ThisValue : STRING
DECLARE Duplicates : BOOLEAN
Duplicates  FALSE
IndexA  1
WHILE Duplicates = FALSE AND IndexA < 500

ThisValue  Secret[IndexA, 2]
IF ThisValue <> "" THEN
ThisPassword  Decrypt(ThisValue)
FOR IndexB  IndexA + 1 TO 500 //
IF Secret[IndexB, 2] <> "" THEN
IF Decrypt(Secret[IndexB, 2]) = ThisPassword
THEN
OUTPUT "Password for " & Secret[IndexA, 1] &
"also used for " & Secret[IndexB, 1]
Duplicates  TRUE
ENDIF
ENDIF
NEXT IndexB
ENDIF
IndexA  IndexA + 1
ENDWHILE
IF Duplicates = FALSE THEN

OUTPUT "No duplicate passwords found"
ENDIF
ENDPROCEDURE
1. (Any) conditional loop...

2. ... from 1 to 499 while (attempt at) no duplicate
3. Skip unused password
4. Use Decrypt() and assign return value to ThisPassword
5. Inner loop from outer loop index + 1 to 500 searching for duplicates
6. Compare ThisPassword with subsequent passwords (after use of
Decrypt())
7. If match found, set outer loop termination
8. and attempt an Output message giving duplicate
9. Output 'No duplicate passwords found' message if no duplicates found after the
loop

PUBLISHED
8(c) One mark for each point that is referenced: 6
SHAHARYAR LALANI
1 Initialise password to empty string at the start and return (attempted) password
at the end of the function
2 Two loops to generate 3 groups of 4 characters // One loop to generate 12 / 14
characters
3 Use of RandomChar()to generate a character in a loop
4 Reject character if Exists()returns TRUE, otherwise form string in a loop
5 (Attempt to) use hyphens to link three groups
6 Three groups of four characters generated correctly with hyphens and without
duplication (completely working algorithm)

SHAHARYAR LALANI
Paper 23 Problem Solving & Programming May/June 2022
MARK SCHEME
Maximum Mark: 75
Published
Teachers.

PUBLISHED
SHAHARYAR LALANI
responses seen).

PUBLISHED
SHAHARYAR LALANI
1(b)(i) 1 mark for any two rows correct 2
1 mark for all rows correct
1(b)(ii) One mark from: 1
 To terminate a (conditional) loop when a value has been found

 When the variable can take only one of two possible values
 (Accept by example): When a variable is recording when an action has
been done e.g. Yes or No // light is on

PUBLISHED
2 Dependent marks 4
SHAHARYAR LALANI
One mark for type; one mark for matching reason
Answers include:
Type: Adaptive
Reason: To accommodate a change in the requirement / technology /
legislation
e.g. a new HTML version is available
Type: Corrective
Reason: The program does not operate as expected / contains a bug
e.g. passwords are not hidden
3(a) One mark per point to show: 2
 module relationships / hierarchy / selection / repetition // how a problem is

broken down
 the parameters that are passed between the sub-tasks / modules //
whether a module is a function or a procedure
3(b) 5
One mark for each:
1 Four boxes linked as shown correctly labelled (Order of lower 3 not

important)
2 Parameters to Sub1_A
3 Parameter to Sub1_B and return value
4 Parameters to Sub1_C
5 Selection diamond

PUBLISHED
4 One mark per row 2 to 7 to Max 4 4
SHAHARYAR LALANI
Type of Example Expected
Explanation
test data test value return value
Value within the acceptable

Normal 153 "PASS"
range
Outside acceptable range /

Abnormal < 149 "FAIL"
too small
Abnormal /
149 "FAIL" Maximum unacceptable
Boundary
Boundary /
Extreme / 150 "PASS" Minimum acceptable
Normal
Boundary /
Extreme / 155 "PASS" Maximum acceptable
Normal
Abnormal /
156 "FAIL" Minimum unacceptable
Boundary
Outside acceptable range /

Abnormal >156 "FAIL"
too large
5(a)(i) TYPE Employee 4

DECLARE EmployeeNumber : INTEGER
DECLARE Name : STRING
DECLARE Department : STRING
DECLARE Born : DATE
DECLARE Attendance : REAL
ENDTYPE
One mark for each:
1. TYPE Employee and ENDTYPE

2. Fields: EmployeeNumber and Name and Department
3. Field: Born
4. Field: Attendance
5(a)(ii) DECLARE Staff : ARRAY [1:500] OF Employee 2

PUBLISHED
5(b)(i) Example answers to Max 1: 1
SHAHARYAR LALANI
 So that unused elements may be recognised when processing /
searching
 Otherwise the element may contain old / unexpected data
5(b)(ii) Use of any 'impossible' field value, for example: 1
 An EmployeeNumber field. e.g. < 1

 An empty string / impossible string e.g. "EMPTY" for name or department
 DOB a long time ago...
 Zero / Negative value for attendance
5(c) PROCEDURE Absentees() 4

FOR Index  1 TO 500
IF Staff[Index].EmployeeNumber <> −1 THEN // not empty
IF Staff[Index].Attendance <= 90 THEN
OUTPUT Staff[Index].EmployeeNumber
OUTPUT Staff[Index].Name
ENDIF
ENDIF
NEXT Index
ENDPROCEDURE
1 Procedure heading and ending and declaration of loop counter

2 loop through 500 elements
3 attempt to skip unused element
4 test Staff[Index].Attendance <= 90 in a loop
5 if so, output EmployeeNumber and Name fields in a loop

PUBLISHED
6(a) FUNCTION Factorial(ThisNum : INTEGER) RETURNS INTEGER 6
SHAHARYAR LALANI
DECLARE Value : INTEGER
IF ThisNum < 0 THEN

Value  -1
ELSE
Value  1
WHILE ThisNum <> 0
Value  Value * ThisNum
ThisNum  ThisNum – 1
ENDWHILE
ENDIF
RETURN Value
ENDFUNCTION
1 Function heading and ending including parameter and return value

2 Declaration and initialisation (to 1) of local Integer Value for result
3 Check for illegal value (< 0)
4 (Conditional) loop while ThisNum not zero // loop for ThisNum iterations
5 Attempt to form answer by successive multiplication
6 Completely correct MP5
7 Return INTEGER value correctly in both cases: ThisNum < 0 and >= 0
ALTERNATIVE RECURSIVE SOLUTION:
FUNCTION Factorial(ThisNum : INTEGER) RETURNS INTEGER
IF ThisNum > 1 THEN

RETURN ThisNum * Factorial(ThisNum – 1)
ELSE
IF ThisNum = 1 OR ThisNum = 0 THEN
RETURN 1
ELSE
RETURN -1
ENDIF
ENDIF
ENDFUNCTION
Marks as follows:
1 Function heading and ending including parameter and return value

2 Test for ThisNum > 1
3 and if so return product of Thisnum and Factorial(ThisNum-1)
4 Check for special case...
5 ...return 1 for 0 and 1 and return −1 for negative values
6 Return INTEGER value (correctly in all cases)

PUBLISHED
6(b) One mark for: 4
SHAHARYAR LALANI
 Rows A, B AND C
 Each of rows D, E and F
Label Text
A Is Num > 9?
B YES
C NO
D Set <Identifier> to Factorial(Num)
E OUTPUT "Factorial of ", Num, " is ", <Identifier>
F Set Num to Num + 1 // Increment Num
7(a)(i) The lines are output in an incorrect sequence / in the wrong order / not as 1
they appear in the file
7(a)(ii) Description of error: (Max 2 marks) 4
 If the final line of the file is not written into array element 3
 then outputting the elements in the sequence 1 to 3 will give the error.
Explanation of error correction: (Max 2 marks)
 Attempt at description of 'shuffle'

 Copy Buffer[2] to Buffer[1] AND copy Buffer[3] to Buffer[2]
 Read a line from the file and write it to Buffer[3]
OR
 Store the index of the last element written to buffer (the last line of the
file)
 Replace the FOR loop with something that starts at index
 and then wraps around (MOD 3)
OR (two-loop solution, not using an array)

 Loop to read file to end to get number of lines
 close and re-open file
 read (and discard) lines to number of lines - 3, then loop to read and
output last 3 lines
7(b) If the number of lines in the text file is a multiple of three 1

PUBLISHED
7(c) Correct answers include: 2
SHAHARYAR LALANI
LineNum  (LineNum MOD 3) + 1 // ((LineNum + 3) MOD 3)
+ 1
One mark for assignment to LineNum making any use of MOD

One for completely correct statement
8(a) 3
One mark for:
1 (at least) three intermediate shapes with at least one valid stage names
2 Up and Down arrows between each pair of shapes
3 Design – Coding – Testing labels in correct sequence
8(b) Downward arrows: result from one stage is input / passed to the next 2
Upward arrows: more work is required at a previous stage to complete the

current stage
8(c) For example: 1
Iterative / Rapid Application Development (RAD)

PUBLISHED
9(a) FUNCTION Generate() RETURNS STRING 7
SHAHARYAR LALANI
DECLARE Password, Group : STRING
DECLARE NextChar : CHAR
DECLARE ACount, BCount : INTEGER
CONSTANT HYPHEN = '-'
Password  ""
FOR ACount  1 TO 3
Group  ""
FOR BCount  1 TO 4
REPEAT
NextChar  RandomChar()
UNTIL Exists(Group, NextChar) = FALSE
Group  Group & NextChar
NEXT BCount
Password  Password & Group & HYPHEN
NEXT ACount
Password  LEFT(Password, 14) // remove final hyphen
RETURN Password
ENDFUNCTION
1 Declaration and initialisation of Password as STRING

2 Outer loop for three groups / until password is complete // three group
loops
3 Attempt to use of both RandomChar() and Exists()in a loop
4 (Inner) loop for 4 characters in a group // note every 4 chars in a
loop
5 Conditional loop until char is unique
6 Concatenating unique character to Group in a loop
7 Concatenate Group / random character to Password in a loop
8 (Attempt to) insert hyphens between groups (or removing later) and
Return Password

PUBLISHED
9(b) FUNCTION AddPassword(Name, Password : STRING) 6
SHAHARYAR LALANI
RETURNS BOOLEAN
DECLARE Added : BOOLEAN
Added  FALSE
Index  1
IF FindPassword(Name) = "" THEN // Domain name not in

// array
WHILE Added = FALSE AND Index <= 500
IF Secret[Index, 1] = "" THEN
Secret[Index, 1]  Name
Secret[Index, 2]  Encrypt(Password)
Added  TRUE
ELSE
Index  Index + 1
ENDIF
ENDWHILE
ENDIF
RETURN Added
ENDFUNCTION
Marks as follows:
1 Check that the website domain name isn't already in array using
FindPassword() / linear search, otherwise:
2 (Conditional) loop while not added and not end of array
3 Check for unused element by testing value in column 1 in a loop
4 If unused, write parameter values to column 1 and 2 and set flag /
variable
5 ...having used Encrypt() on the password
6 Return BOOLEAN value (correctly in all cases)
9(c) One mark per point to Max 3. 3
Solution based on field length:
 Convert the length of the website domain name (either field) …

 … to a string of fixed length
 Form a string by concatenate this string with the other two (and write as
one line of the file)
Solution based on use of separator character:
 Select a (separator) character that cannot occur in the domain name (e.g.
space)
 Create a string from the domain name followed by the separator
 ...Concatenate the encrypted password (and write as one line of the file)

SHAHARYAR LALANI

MARK SCHEME
Maximum Mark: 75
Published
Teachers.
components.

PUBLISHED 2022
SHAHARYAR LALANI
responses seen).

PUBLISHED 2022
SHAHARYAR LALANI
1 They are tried and tested so free from errors
2 They perform a function that you may not be able to program yourself
(for example encryption)
3 They are readily available / speed up development time
1(b)(i) One mark per point: 3
1 Algorithm to process / search / organise the data is easier to implement

// Values may be accessed via a loop-controlled variable / iterated
through using index
2 Makes the program easier to design / code / test / understand
3 Multiple instances referenced via a single identifier / so fewer identifiers
needed // Easier to amend the program when the number of students
increases
1(b)(ii) One mark per point: 2
Purpose: It identifies / references an individual array element // provides the

index to the array
Data type: Integer
1(c) One mark per row: 4
Statement Error
IF EMPTY  "" THEN Should be "=" not 
Status  IS_NUM(-23.4) Parameter should be a string (or

char) // should not be a real
X  STR_TO_NUM("37") + 5 NO ERROR
Y  STR_TO_NUM("37" + "5") Wrong operator – should be & or

Parameter is not a string

PUBLISHED 2022
2(a) One mark for Explanation: 3
SHAHARYAR LALANI
• Abstraction is used to filter out information / data that is not necessary
for the task
Or the opposite:
• To keep only information / data that is necessary for the task
One mark for each TWO data items (not dependent on 'Explanation'):
Items include:
• Car details: ID, Car Registration, car type etc

• Customer details: ID, name, address, licence details etc
• Start date (of hire)
• Return date / Number of days (of hire)
• Cost of hire
2(b) One mark for each (Max 2) 2
Examples include:
1 Input customer details

2 Input car details
3 Input payment details
4 Create hire / start hire
5 Return car / end hire
6 Change / check car status (hired / available / written-off)
7 Cancel hire
8 Process payment / calculate hire cost
3 One mark per point (Max 5): 5
1 Declare a variable / an integer Max

2 Assign value of first / any element to Max
3 Set up a loop to repeat 200 times / from start to end of array
4 Use the loop counter as the array index
5 If value of current element is greater than Max...
6 ...then assign value to Max
7 After the loop, Output Max

PUBLISHED 2022
4(a)(i) One mark for each: 4
SHAHARYAR LALANI
1 Data A and K stored in new / existing nodes
2 Start pointer points to Node A
3 Node A points to Node C and Node C points to Node K
4 Node K contains Null Pointer
4(a)(ii) One mark per point: 2
1 Pointers determine the ordering of data // only the pointers need to be

changed when data changed
2 Easier to add / delete data (to maintain correct sequence) in a linked list
// description of moving data to maintain correct sequence when array
used
4(a)(iii) One mark per point: 2
1 Need to store pointers as well as data

2 More complex (to setup / implement)
4(b) One mark per point (Max 4): 4
1 Declare two (1D) arrays

2 One for data, one for pointers
3 Elements from same index represent one node
4 Declare an integer / variable for StartPointer // explain its use
5 Define appropriate value for null pointer // explain its use
6 Declare an integer / variable for FreeList pointer // explain its use
7 Routines are needed to add / delete / search
Alternative MP1, 2 and 3 for record-based implementation:
1 Define a record type with fields for data and pointer

2 Declare one (1D) array
3 ...of the defined record type

PUBLISHED 2022
5 Mark as follows (Max 5): 5
SHAHARYAR LALANI
1 Procedure heading and ending and declaration of both indexes
2 Loop to process all elements from Array1
3 Sum (any) three consecutive values from Array1 and divide by 3
in a loop
4 Convert result to Integer
5 Assign value to correct element of Array2 in a loop
6 Increment Array2 index in a loop
PROCEDURE Summarise()
DECLARE Value : REAL
DECLARE IxA, IxB : INTEGER // Index variables
IxB  1
FOR IxA  1 TO 598 STEP 3

Value  Array1[IxA] + Array1[IxA + 1] + Array1[IxA + 2]
Value  Value / 3
Array2[IxB]  INT(Value)
IxB  IxB + 1
NEXT IxA
ENDPROCEDURE
6(a) One mark for any part correct (accept equivalent wording) (Max 1): 1
• Condition evaluates to TRUE if bracket contents evaluate to FALSE:
• Bracket contents evaluate to FALSE if:
• Dots: zero / less than one

or
• Ats: not equal to one
or
• Others: less than nine

PUBLISHED 2022
6(b)(i) One mark for each area as outlined: 5
SHAHARYAR LALANI
Index NextChar Dots Ats Others Valid
0 0 0 TRUE
1 'L' 1
2 'i' 2
3 'z' 3
4 '.' 1
5 '1' 4
6 '2' 5
7 '3' 6
8 '@' 1
9 'b' 7
10 'i' 8
11 'g' 9
12 '@' 2 FALSE
6(b)(ii) FALSE 1

PUBLISHED 2022
7(a)(i) One mark per point (Max 7) as follows: 7
SHAHARYAR LALANI
1 Declaration of local variables for Par1 Par2 and Par3
2 Loop to end of (parameter) string // until operator is found
3 Extract a character in a loop...
4 Attempt at extraction of three parts of expression using substring
functions
5 Completely correct extraction of all three parts of expression
6. Convert string to Integer using STR_TO_NUM(<something
sensible>)
7 Attempt to interpret at least two operators (Par2): + - * /
8 Corresponding correct calculation (all operators) and final Output of
result
PROCEDURE Calculate(Expression : STRING)

DECLARE Val1, Val2, Index : INTEGER
DECLARE Result : REAL
DECLARE Par1, Par2, Par3 : STRING
CONSTANT PLUS = '+'

CONSTANT MINUS = '-'
CONSTANT MULTIPLY = '*'
CONSTANT DIVIDE = '/'
FOR Index  1 TO LENGTH(Expression) //search for

operator
ThisChar  MID(Expression, Index, 1)
IF IS_NUM(ThisChar) = FALSE THEN
Par1  LEFT(Expression, Index – 1)
Par2  ThisChar
Par3  RIGHT(Expression, LENGTH(Expression) –
Index)
ENDIF
NEXT Index
Val1  STR_TO_NUM(Par1)
Val2  STR_TO_NUM(Par3)
CASE OF Par2
PLUS : Result  Val1 + Val2
MINUS : Result  Val1 - Val2
MULTIPLY : Result  Val1 * Val2
DIVIDE : Result  Val1 / Val2
ENDCASE
OUTPUT Result
ENDPROCEDURE
7(a)(ii) FUNCTION Calculate(Expression : STRING) RETURNS REAL 1

PUBLISHED 2022
7(b) Example string: "23/0" (Any divide by zero example) 2
SHAHARYAR LALANI
Reason: The result is infinity / cannot be represented / is undefined // will
cause the program to crash
8(a) One mark for each point (Max 7) as follows: 7

2 Declaration and initialisation of local Integer for Count
3 OPEN in READ mode and CLOSE
4 Conditional loop until EOF()
5 Read a line in a loop
6 If non-blank, increment count in a loop
7 Terminate loop when 10 non-blank lines have been read
8 Return Boolean in both cases
FUNCTION CheckFile(Thisfile : STRING) RETURNS BOOLEAN

DECLARE Valid : BOOLEAN
DECLARE Count : INTEGER
Count  0
Valid  FALSE
OPEN ThisFile FOR READ
WHILE NOT EOF(ThisFile) AND Valid = FALSE

READFILE ThisFile, ThisLine
IF ThisLine <> "" THEN
Count  Count + 1
IF Count > 9 THEN
Valid  TRUE
ENDIF
ENDIF
ENDWHILE
CLOSEFILE ThisFile
RETURN Valid
ENDFUNCTION
8(b) CALL CountErrors("Jim01Prog.txt", 20) 2
One mark for each:
1 Module name, at least one parameter in brackets and one parameter

correct
2 Completely correct statement

PUBLISHED 2022
8(c) Mark as follows: 8
SHAHARYAR LALANI
2 Declaration and initialisation of local Integer value for ErrCount
3 Use of CheckFile(), output message and terminate if it returns
FALSE
4 Conditional loop until EOF()
5 ...or ErrCount > MaxErrors
6 Read line and use as parameter to CheckLine()in a loop
7 Test return value and increment ErrCount if non-zero in a loop
8 Output either message once only as appropriate
PROCEDURE CountErrors(ThisFile : STRING, MaxErrors :

INTEGER)
DECLARE ErrCount, ThisError : INTEGER
ErrCount  0
IF CheckFile(ThisFile) = FALSE THEN

OUTPUT "That program file is not valid"
ELSE
OPEN ThisFile FOR READ
REPEAT
READFILE, ThisFile, ThisLine
ThisError  CheckLine(ThisLine)
IF ThisError <> 0 THEN
ErrCount  ErrCount + 1
ENDIF
UNTIL ErrCount > MaxErrors OR EOF(ThisFile)
IF EOF(ThisFile) = FALSE THEN

OUTPUT "Check terminated – too many errors"
ELSE
OUTPUT "There were ", ErrCount, " errors."
ENDIF
CLOSEFILE ThisFile
ENDIF
ENDPROCEDURE
8(d) One mark for each (Max 2): 2
Examples:
1 Incorrect block structure. Missing keyword denoting part of block (for
example ENDPROCEDURE, ENDFUNCTION, ENDTYPE)
2 Data type errors, for example, assigning an integer value to a string
3 Identifier used before it is declared
4 Incorrect parameter use

SHAHARYAR LALANI

MARK SCHEME
Maximum Mark: 75
Published
Teachers.
components.

PUBLISHED 2022
SHAHARYAR LALANI
responses seen).

PUBLISHED 2022
1(a)(i) One mark for each point (Max 2): 2
SHAHARYAR LALANI
• When a task which is repeated / reused / performed in several places
• When a part of an algorithm performs a specific task
• Reduces complexity of program / program is simplified // subroutine
already available
• Testing / debugging / maintenance is easier
1(a)(ii) One mark for each part: 2
Term: Parameter(s)
Use: to pass values / arguments to the procedure
1(b) One mark for test stage, one mark for each description point 4
(Max 3 for Description)
Test stage: Beta testing
Description:
1 Testing carried out by a small group of (potential) users

2 Users will check that the software works as required / works in the real
world / does not contain errors
3 Users will feedback problems / suggestions for improvement
4 Problems / suggestions identified are addressed (before the program is
sold)
1(c) One mark per row: 3
Expression Evaluation
MID(CharList, MONTH(FlagDay), 1) 'D'
INT(Count / LENGTH(CharList)) 4
(Count >= 99) AND (DAY(FlagDay) > 23) FALSE

PUBLISHED 2022
2(a)(i) One mark per step (or equivalent): 5
SHAHARYAR LALANI
1 Open file in APPEND mode (and subsequent Close)
2 Prompt and Input a student name and mark
3 If mark greater than or equal to 20 jump to step 5
4 Write only the name to the file
5 Repeat from Step 2 for 35 times / the number of students
2(a)(ii) Data in a file is saved after the computer is switched off / stored 1
permanently // no need to re-enter the data when the program is re-run
2(a)(iii) Example answer: 1
So that existing file data is not overwritten.
2(b) One mark per row (row 2 to 5): 4
Input Output Next state
S1
Input-A Output-X S2
Input-A (none) S2
Input-B Output-W S3
Input-A Output-W S4

PUBLISHED 2022
3(a) One mark for name, Max two for features (Max 3 in total) 3
SHAHARYAR LALANI
Name: Queue
Features:
1 Each queue element contains one data item
2 A Pointer to the front / start of the queue
3 A Pointer to the back / end of the queue
4 Data is added at back / end and removed from front / start // works on a
FIFO basis
5 May be circular
ALTERNATIVE:
Name: Linked List
Features:
1 Each node contains data and a pointer to the next node
2 A Pointer to the start of the list
3 Last node in the list has a null pointer
4 Data may be added / removed by manipulating pointers (not moving
data)
5 Nodes are traversed in a specific sequence
6 Unused nodes are stored on a free list // a free-list pointer to the Free
List
1 Declare a (1D) array of data type STRING

2 The number of elements in that array corresponds to the size of the
required stack
3 Declare an integer / variable for StackPointer
4. Declare an integer / variable for the size of the stack // for the max value
of StackPointer
5 Use the StackPointer as an index to the array
6 Pointers and variables initialised to indicate empty stack
7 Store each item on the stack as one array element / Each stack item
maps to one array element
8 Attempt to describe Push and Pop operations
9 Push and Pop routines need to check for full or empty conditions

PUBLISHED 2022
3(c) One mark for each: 5
SHAHARYAR LALANI
1 Data 'After Group 1' (as shown, including blank cells)
4 SP 'After Group 1' pointing to location 955
5 Final two SPs pointing to locations 952 and 954

PUBLISHED 2022
SHAHARYAR LALANI
1 Input UserID and use of GetAverage()and assignment
2 Initialisation of Total to zero and Index to 4
3 Conditional loop with Index from 4 to 6
4 Assignment of Last from element SameMonth[Index] in a loop
5 Structure: IF...THEN...ELSE...ENDIF in a loop
6 Correct assignments and final call to Update()after the loop
INPUT UserID
Average  GetAverage(UserID)
Total  0
Index  4
WHILE Index < 7 // REPEAT

Last  SameMonth[Index]
IF Average > Last THEN
Total  Total + Average
ELSE
Total  Total + Last
ENDIF
Index  Index + 1
ENDWHILE // UNTIL Index = 7
CALL Update(UserID, Total)
Alternative solution using FOR loop:
One mark per point FOR loop solution:

1 Input UserID and use of GetAverage()and assignment
2 Initialisation of Total to zero
3 loop Index from 4 to 6
4 Assignment of Last from array SameMonth in a loop
5 Comparison IF...THEN...ELSE...ENDIF in a loop
6 Appropriate assignments in a loop AND final call to Update()after
the loop
INPUT UserID
Average  GetAverage(UserID)
Total  0
FOR Index  4 TO 6
Last  SameMonth[Index]
IF Average > Last THEN
Total  Total + Average
ELSE
Total  Total + Last
ENDIF
NEXT Index
CALL Update(UserID, Total)

PUBLISHED 2022
4(b) Pre-condition (loop) / count-controlled (loop) 1
SHAHARYAR LALANI
5 One mark per IF...THEN...ENDIF clause: 4
1 IF A AND B AND C THEN

CALL Sub1()
ENDIF
2 IF (A AND B) AND NOT C THEN

CALL Sub2()
ENDIF
3 IF (NOT A) AND (NOT C) THEN

CALL Sub3()
ENDIF
4 IF (NOT A) AND C THEN

CALL Sub4()
ENDIF

PUBLISHED 2022
6(a) Example by repeated multiplication: 7
SHAHARYAR LALANI
Mark as follows (multiplication solution), (Max 7):

2 Declaration and initialisation of local Num
3 Any conditional loop
4 Conditional loop until ThisValue found or Try out of range
5 Multiply Try by Num in a loop
6 Compare Try with ThisValue and set termination if the same in
a loop
7 Increment Num and repeat in a loop
8 Attempt to Return Num if ThisValue is a factorial or -1 otherwise
FUNCTION FindBaseNumber(ThisValue : INTEGER) RETURNS

INTEGER
DECLARE Num, Try : INTEGER
Num  0
Found  FALSE
Try  1
WHILE Try <= ThisValue AND Found = FALSE

Num  Num + 1
Try  Try * Num
IF Try = ThisValue THEN //BaseNumber found
Found  TRUE
ENDIF
ENDWHILE
IF Found = TRUE THEN

RETURN Num
ELSE
RETURN -1
ENDIF
ENDFUNCTION

PUBLISHED 2022
6(a) Alternative FOR LOOP solution.
SHAHARYAR LALANI
Mark as follows:
2 Declaration of local Integer value for Num and Try
3 Count-controlled Loop from 1 to ThisValue
4 Multiply Try by Num in a loop
5 Compare Try with ThisValue in a loop
6 ...Immediate return of Num if they are the same in a loop
7 Return –1 if ThisValue not found after loop
FUNCTION FindBaseNumber(ThisValue : INTEGER) RETURNS

INTEGER
DECLARE Num, Try : INTEGER
Try  1
FOR Num  1 TO ThisValue

Try  Try * Num
IF Try = ThisValue THEN //BaseNumber found
RETURN Num
ENDIF
NEXT Num
RETURN -1
ENDFUNCTION
6(b) One mark per row. 4
Examples of invalid strings:
1 Non-numeric but not "End" // contains space or other non-numeric

characters
2 Real number
3 Integer value out of range (i.e. <= 0)
4 Empty string
5 Correct word but wrong case e.g. "end" rather than "End"
Input Reason for choice
"Aardvark" Non-numeric (and not "End")
"27.3" Numeric but not an integer
"-3" // "0" A non-positive integer
"" An empty string

PUBLISHED 2022
7(a) One mark per point (Max 6): 6
SHAHARYAR LALANI
2 Conditional loop containing incrementing Index...
3 ...terminating when ErrNum found
4 ...terminating when ErrCode[Index] > ErrNum (i.e. ErrNum
not found)
5 ... OR after element 500 tested
6 Test if found and OUTPUT 'Found' message
7 ...otherwise OUTPUT 'Not Found' message
PROCEDURE OutputError(LineNum, ErrNum : INTEGER)

Index  0
// Search until ErrNum found OR not present OR end of

array
REPEAT
Index  Index + 1
UNTIL ErrCode[Index] >= ErrNum OR Index = 500
IF ErrCode[Index] = ErrNum THEN

OUTPUT ErrText[Index], " on line ", LineNum
//Found
ELSE
OUTPUT "Unknown error on line ", LineNum //Not
found
ENDIF
ENDPROCEURE

PUBLISHED 2022
SHAHARYAR LALANI
1 Procedure heading and ending as shown
2 Conditional loop correctly terminated
3 An inner loop
4 Correct range for inner loop
5 Comparison (element J with J+1) in a loop
6 Swap elements in both arrays in a loop
7 'No-Swap' mechanism:
• Conditional outer loop including flag reset
• Flag set in inner loop to indicate swap
8 Efficiency (this scenario): terminate inner loop when ErrCode = 999
9 Reducing Boundary in the outer loop
PROCEDURE SortArrays()
DECLARE TempInt, J, Boundary : INTEGER
DECLARE TempStr : STRING
DECLARE NoSwaps : BOOLEAN
Boundary  499
REPEAT
NoSwaps  TRUE
FOR J  1 TO Boundary
IF ErrCode[J]> ErrCode[J+1] THEN
//first swap ErrCode elements
TempInt  ErrCode[J]
ErrCode[J]  ErrCode[J+1]
ErrCode[J+1]  TempInt
//now swap corresponding ErrText elements
TempStr  ErrText[J]
ErrText[J]  ErrText[J+1]
ErrText[J+1]  TempStr
NoSwaps  FALSE
ENDIF
NEXT J
Boundary  Boundary - 1
UNTIL NoSwaps = TRUE
ENDPROCEDURE
7(c)(i) ErrCode should be an INTEGER // ErrCode should not be a STRING 1

PUBLISHED 2022
7(c)(ii) Benefits include: 2
SHAHARYAR LALANI
1 Array of records can store mixed data types / multiple data types under
a single identifer
2 Tighter / closer association between ErrCode and ErrText // simpler
code as fields may be referenced together // values cannot get out of
step as with two arrays
3 Program easier to design / write / debug / test / maintain / understand
One mark per point
Note: Max 2 marks
7(c)(iii) DECLARE Error : ARRAY[1:500] OF ErrorRec 1

SHAHARYAR LALANI

MARK SCHEME
Maximum Mark: 75
Published
Teachers.
components.

PUBLISHED 2022
SHAHARYAR LALANI
responses seen).

PUBLISHED 2022
SHAHARYAR LALANI
Variable use Data type
Store the number of days in the current month INTEGER
Store the first letter of the customer's first name CHAR
Store an indication of whether a year is a leap

BOOLEAN
year
Store the average amount spent per customer

REAL
visit
1(b)(i) Easier to manage/plan/cost // Clear deliverables produced at (end of) each 1

stage
1(b)(ii) One mark per point (Max 1): 1
• The problem definition

• Requirements specification // Client requirements
• Documentation related to current system (e.g. ER diagram of current
system, DFD of current system, feasibility study)
1(c)(i) One mark per point (Max 1): 1
• Modules are developed in parallel / as prototypes

• Minimal / no detailed planning is carried out // Allows for changes to
requirements
• Flexible development process
• Small incremental releases are made, each adding functionality
• Used for time critical development
• Client involved during (all stages) of development
1(c)(ii) Examples include: 3
Benefits: (Max 2 marks)

• Quicker development possible / Multiple areas can be worked on at
same time
• Prototype produced (at early stage in process)
• Easier to change requirements / quicker delivery of usable modules
• Early review possible / closer cooperation between client and
developers
Drawback: (Max 1 mark)

• Difficult to estimate cost / time to complete project
• Documentation often omitted
• Lack of client availability throughout life cycle // too easy for client to
keep changing their mind

PUBLISHED 2022
1(d) One mark for each point (Max 2) 2
SHAHARYAR LALANI
Examples include:
1 Change to website requirements

2 New technologies available to host website // changes made to library
modules used
3 Change in relevant legislation
2 One mark for name and two marks for use (Max 3 in total): 3
Examples include:
Module: SelectCharity()
Use: Allows the user to choose a particular charity
Module: SpecifyAmountAndType()
Use: Allows the user to specify a single or regular payment
Module: MakePayment()
Use: Make payment to the charity
Module: ValidatePayment()
Use: Validate payment details (by accessing bank computer)
Module: AddBankAccountDetails() / AddPaymentDetails()

Use: Allows the user to add bank account information that donation to be
taken from
Module: AddDonorDetails()
Use: Allows user to add details such as name and contact details
3 One mark per point, for example: 5
1 Declare two (REAL)variables for the two sum values AND initialise both
to zero
2 Prompt AND Input a number
3 If number greater than zero add to positive sum and If number less
than zero add to negative sum
4 Repeat from step 2 if number not zero
5 After loop the Output SumPos and SumNeg
4(a) The data type (of the item to be stored) 1

PUBLISHED 2022
4(b)(i) Operation: Add an item / Enqueue 4
SHAHARYAR LALANI
Check: There are unused elements in the array // The queue is not full
Operation: Remove an item / Dequeue

Check: There are items in the array // The queue is not empty
One mark for reason and one mark for reason it could not be completed.
1 Declare a (1D) array of size >= 10

2 …of data type CHAR
3 Declare integer variable for FrontOfQueuePointer
4 Declare integer variable for EndOfQueuePointer
5 Initialise FrontOfQueuePointer and EndOfQueuePointer to
represent an empty queue
6 Declare integer variable or NumberInQueue
7 Declare integer variable for SizeOfQueue to count / limit the max
number of items allowed // Reference to mechanism for defining 'wrap'
of circular queue
8 Initialise SizeOfQueue // Initialise NumberInQueue
5(a)(i) One mark per point: 6
1 Procedure heading and ending including four parameters...

2 ...and use of BYREF for the three extracted values
3 Extract and assign SID
4 Extract and assign SDesc
5 Calculation of length of SCost (remainder of string)
6 Extract and assign SCost following an attempt at MP5
PROCEDURE UnPack(BYVAL TLine : STRING, BYREF SID, SDesc,

SCost : STRING)
SID  LEFT(TLine, 5)
SDesc  MID(TLine, 6, 32)
SCost  RIGHT(TLine, LENGTH(TLine) – 37)
ENDPROCEDURE
5(a)(ii) One mark each (Max 2): 2
1 Provides a mechanism to allow calling program to pass data

2 Defines the four parameters of Unpack()
3 … giving their data type and order
5(b)(i) LineData.Cost  12.99 1

PUBLISHED 2022
SHAHARYAR LALANI
• The new function will return an item of type StockItem
• Need to declare/use a (local) variable of type StockItem
• Costfield needs to be converted from a string to a real
5(c) One mark for reason 3

One mark for each example (Max 2)
Reason:
• Makes the code easier to understand // Describes the purpose of the
identifier // Makes the code easier to debug/test/maintain
Further examples include:

• White space
• Indentation
• Keywords in capitals
• Comments
• Local variables // parameters
5(d) One mark per point (Max 3) 3
1 The program is checked by creating a trace table / going through the

program a line at a time
2 ….to record/check variable (values) as they change
3 Error may be indicated when variable given an unexpected value
4 Error may be indicated by an unexpected path through the program //
Faults in the logic of the program can be detected
Examples:
Test Component Expected return

Min Max
number weight value
1 300 290 315 'A'
2 > 317 290 315 'R'
3 317 290 315 'C'
4 288 290 315 'C'
5 < 288 290 315 'R'

PUBLISHED 2022
SHAHARYAR LALANI
1 Function heading and ending including parameters
2 Declaration of local variable for Result / alt mechanism
3 Check for Reject
4 Check for Accept
5 Check for Recheck (or just default to third option)
6 Return Result following a reasonable attempt
Function Status(Actual, Min, Max : INTEGER) RETURNS CHAR

DECLARE Result : CHAR
CONSTANT Accept = 'A'
CONSTANT Reject = 'R'
CONSTANT ReCheck = 'C'
Result  ReCheck
//Check if reject
IF Actual > Max + 2 OR Actual < Min – 2 THEN
Result  Reject
ENDIF
//Check if acceptable
IF Actual < Max - 2 AND Actual > Min + 2 THEN
Result  Accept
ENDIF
RETURN Result
ENDFUNCTION

PUBLISHED 2022
7(a) One mark per point (Max 8): 8
SHAHARYAR LALANI
1 Declaration and initialisation of local integer for Count
2 Appropriate prompt and two inputs
3 (Conditional) loop while error number input is in range // error code 999
reached
4 …and not end of array
5 Check if this ErrCode needs to be output in a loop
6 if so check for blank error text in a loop
7 Output in both cases
8 ….and increment count in a loop
9 OUTPUT of header and summary including count
PROCEDURE OutputRange()
DECLARE First, Last, Count, Index, ThisErr : INTEGER
DECLARE ThisMess : STRING
DECLARE PastLast: BOOLEAN
Count  0
Index  1
PastLast  FALSE
OUTPUT "Please input first error number: "

INPUT First
OUTPUT "Please input last error number: "
INPUT Last
OUTPUT "List of error numbers from ", First, " to ",

Last
WHILE Index < 501 AND NOT PastLast

ThisErr  ErrCode[Index]
IF ThisErr > Last THEN
PastLast  TRUE
ELSE
IF ThisErr >= First THEN
ThisMess  ErrText[Index]
IF ThisMess = "" THEN
ThisMess  "Error Text Missing"
ENDIF
OUTPUT ThisErr, " : ", ThisMess
Count  Count + 1
ENDIF
ENDIF
Index  Index + 1
ENDWHILE
OUTPUT Count, " error numbers output"
ENDPROCEDURE

PUBLISHED 2022
7(b)(i) One mark per point: 6
SHAHARYAR LALANI
1 (Conditional) loop terminating when item added OR end of array
reached
2 Test for unused element in a loop
3 Assignment of values to arrays // save index of first blank location and
assign after loop
4 Set loop termination if empty element found in a loop
5 Call SortArrays() once
6 Calculation of remaining unused elements and return Integer value (for
both cases)
FUNCTION AddError(ErrNum : INTEGER, ErrMess : STRING)

RETURNS INTEGER
DECLARE Index, Remaining : INTEGER
CONSTANT Unused = 999
Index  1
Remaining  -1
REPEAT
IF ErrCode[Index] = Unused THEN
ErrCode[Index]  ErrNum
ErrText[Index]  ErrMess
CALL SortArrays()
Remaining  500 – Index
ENDIF
Index  Index + 1
UNTIL Remaining <> -1 OR Index > 500
RETURN Remaining
ENDFUNCTION
1. Loop through 500 elements (while error number not found)

2. Compare ErrCode for current element with the error number
3. If same, set element value to 999 (and terminate loop)
4. ... and call SortArrays() (to move 999 to the end) – once only

(MS) Yearly 9618 P2

Uploaded by

Copyright:

Available Formats

You might also like

(MS) Yearly 9618 P2

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

(MS) Yearly 9618 P2

Uploaded by

Copyright:

Available Formats

SHAHARYAR LALANI

This document has 12 pages. Blank pages are indicated.

© UCLES 2018 [Turn over

GENERIC MARKING PRINCIPLE 1:

Marks must be awarded in line with:

Marks must be awarded positively:

GENERIC MARKING PRINCIPLE 4:

Variable Data type

One mark per row

One mark per row

Item Statement Input Process Output

One mark per row

UNTIL MyCount > 199

One mark for each of the following:

Question Answer Marks

• The hierarchy of modules (allow ‘relationship’ )

One mark per item

One mark per underlined part

Allow follow through for PUSH()

Question Answer Marks

(Call) by value 4 • A copy of the variable itself is passed.

Max 4 if explanations do not match answers in columns 1 and 2

One mark per item

One mark per underlined phrase

One mark per statement

One mark for each of:

WHILE n <= LENGTH(Pass) AND ReturnFlag = TRUE

IF NextChar >= 'A' AND NextChar <= 'Z'

ReturnFlag ← FALSE //illegal character

1 mark for each of the following:

10 Correct final format check and returning correct Boolean value

one mark per bullet point Max. 9

Any valid string consisting of:

• at least 3 numeric characters

DECLARE FileData : STRING

1 mark for each of the following:

8 Close the file outside the loop

This document consists of 16 printed pages.

© UCLES 2021 [Turn over

Generic Marking Principles

GENERIC MARKING PRINCIPLE 1:

Marks must be awarded in line with:

GENERIC MARKING PRINCIPLE 2:

GENERIC MARKING PRINCIPLE 3:

Marks must be awarded positively:

GENERIC MARKING PRINCIPLE 4:

GENERIC MARKING PRINCIPLE 5:

GENERIC MARKING PRINCIPLE 6:

© UCLES 2021 Page 2 of 16

Question Answer Marks

"Wong" The preferred name of the MemberName STRING

FALSE A value to indicate FamilyMember BOOLEAN

19/02/1983 When the member joined StartDate DATE

1345 The number of points a Points INTEGER

SubString ← MID("pseudocode", 4, 1) NO ERROR

Not Boolean values /

INT(X/2) doesn't evaluate