Search EN Upload Download free for 30 days

 0 ratings · 8 views · 37 pages You might also like

9618_w24_ms_41 (1)
0% (1)
Css s24 Model Answer
Paper of Summer 2024
Exam Css
31 pages
Uploaded by Trynos AI-enhanced description

100% (1)
This document is the mark scheme for the Cambridge International AS & A Level Computer Science Paper 4
Question Bank Solutions
Practical for October/November 2024, detailing the requirements for marking candidate a… Full description
(Module-2-IAT 1) - IOT -
15CS81
Save 0% 0% Embed Share Print Report
12 pages

No ratings yet
Ask AI Download now
27 of 37  Search document  Catia V6 R2013X 64
Download as pdf or txt

13 pages

No ratings yet
Artifical Intellegence

Cambridge International AS & A Level 34 pages

80% (5)
COMPUTER SCIENCE 9618/41 Kudetemba Mutupo
Paper 4 Practical October/November 2024 Mukanya
MARK SCHEME
Maximum Mark: 75
2 pages

No ratings yet
Published Inheritance in C#

This mark scheme is published as an aid to teachers and candidates, to indicate the requirements of the 53 pages
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 woul d have
considered the acceptability of alternative answers. 100% (1)
Variation and Selection
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.
42 pages
Cambridge International is publishing the mark schemes for the October/November 2024 series for most
Cambridge IGCSE, Cambridge International A and AS Level components, and some Cambridge O Level
components. No ratings yet
Final Project of
Centralized Bill System

95 pages

No ratings yet
Cambridge International
AS & A Level: Computer
Science 9618/42
50 pages

No ratings yet
Cambridge International
AS & A Level: Computer
Science 9618/43…
October/November
23 pages
2022

This document consists of 37 printed pages. No ratings yet

Cambridge International
©Cambridge University Press & Assessment 2024 [Turn over AS & A Level: Computer
Science 9618/41…
May/June
34 pages
2022

Ad Download to read ad-free

No ratings yet
Cambridge International
AS & A Level: Computer
9618/41 Cambridge International AS & A Level – Mark Scheme
PUBLISHED
October/November 2024
Science 9618/41
Generic Marking Principles
38 pages
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 descriptions for a question. Each question paper and mark scheme will also comply with these
marking principles.
No ratings yet
GENERIC MARKING PRINCIP LE 1: Cambridge International
Marks must be awarded in line with: AS & A Level: Computer
• the specific content of the mark scheme or the generic level descriptors for the question
Science 9618/41
• 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. 37 pages

GENERIC MARKING PRINCIP LE 2:

Marks awarded are always whole marks (not half marks, or other fractions).
No ratings yet

GENERIC MARKING PRINCIP LE 3:

Cambridge International
AS & A Level: Computer
Marks must be awarded positively:
Science 9618/42
• 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
34 pages
• 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 No ratings yet
question as indicated by the mark scheme. The meaning, however, should be unambiguous.
Cambridge International
GENERIC MARKING PRINCIP LE 4:
AS & A Level: Computer
Rules must be applied consistently, e.g. in situations where candidates have not followed instructions or in the application of generic level
descriptors. Science 9618/42

34 pages

©C ambridge University Press & Assessment 2024 Page 2 of 37 No ratings yet

Mid Year Markscheme
Answers
Ad Download to read ad-free
31 pages

9618/41 Cambridge International AS & A Level – Mark Scheme October/November 2024 No ratings yet
PUBLISHED 9618_s24_ms_22
GENERIC MARKING PRINCIP LE 5:

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).

GENERIC MARKING PRINCIP LE 6: 12 pages

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.
No ratings yet
Cambridge International
AS & A Level: Computer
Science 9618/41

38 pages

No ratings yet
9626_w24_ms_33

16 pages

No ratings yet
Cambridge International
AS & A Level: Computer
Science 9618/22
©C ambridge University Press & Assessment 2024 Page 3 of 37
12 pages

No ratings yet
Ad Download to read ad-free Cambridge International
AS & A Level: Computer
Science 9618/23

13 pages

No ratings yet
Cambridge International
AS & A Level: Computer
Science 9618/42…
May/June
36 pages
2022

No ratings yet
Cambridge International
AS & A Level: Computer
Science 9608/43…
October/November
19 pages
2021

No ratings yet
Cambridge International
AS & A Level: Computer
Science 9618/42…
October/November 2022
24 pages

No ratings yet
Cambridge International
AS & A Level: Computer
Science 9618/ NA
12 pages
Ad Download to read ad-free

No ratings yet
This Document Consists
of 30 Printed Pages.:
(Turn Over
30 pages

No ratings yet
1.3 (2) Sahil -
22bda70064

5 pages

No ratings yet
June 2023 (v1) MS

38 pages

No ratings yet
Cambridge International
Examinations: Computer
Science 9608/21…
May/June
13 pages
2017

No ratings yet
Laboratory Drill No. 3
Ad Download to read ad-free Variables, Scripts, and
Visualization
3 pages

No ratings yet
Cambridge International
AS & A Level: Information
Technology 9626/12…
February/March 2024
12 pages

No ratings yet
Cambridge IGCSE™:
Information and
Communication…
Technology
9 pages
0417/11
October/November 2020
No ratings yet
python's DICTIONARY
_20240101_025122_0000

26 pages

No ratings yet
Subject Code: 18CS3064:
Time: 2 Hours Max.
Marks: 50 Key and…
Scheme of Evaluation
17 pages

Ad Download to read ad-free No ratings yet

9618_Specimen_Paper_
Answers_Paper_2_(for_e
xamination_from_2021)
28 pages

No ratings yet
Digital System Design:
Course Code
Prerequisites
6 pages

No ratings yet
Css s24 Model Answer
Paper of Summer 2024
Exam Css

31 pages

No ratings yet
Ch10 Object Oriented

40 pages

No ratings yet
Inheritance in C#: Date-
14-04-2011

Ad Download to read ad-free

52 pages

No ratings yet
Java

12 pages

No ratings yet
ITECH1101 Assignment 3
Design A Minimal Viable
Solution-2024-V3
3 pages

No ratings yet
Course Specifications:
and Management
Technology in Maadi
6 pages

No ratings yet
Cambridge International
AS & A Level: Computer
Science 9608/22…
October/November
19 pages
2021

No ratings yet
Ad Download to read ad-free Css s24 Model Answer
Paper of Summer 2024
Exam Css

31 pages

No ratings yet
21.2 - Y1S2 - 12aug2022 -
OOP With C#

3 pages

No ratings yet
UFCFC3 30 1 Group
Coursework OCT 2020
2021 (Comp A) 222
27 pages

No ratings yet
Object Oriented
Programming Lab-06
(Inheritance and Frien…
Functions)
5 pages

No ratings yet
IB352 Warwick Wk2 -
Lecture2

16 pages
Ad Download to read ad-free

No ratings yet
MS MockTest Group1
Gr10

22 pages

No ratings yet
Programming 622
Assignments

4 pages

No ratings yet
Var2 MS

14 pages

No ratings yet
Lab Format ADSA Lab

2 pages

No ratings yet
02 Array, Encapsulation,
Class Properties
Ad Download to read ad-free
(Methods, Fields)

58 pages

No ratings yet
Cambridge IGCSE ™:
Computer Science
0478/23
16 pages

No ratings yet
Model Answer Paper
Summer 2019

24 pages

No ratings yet
05 Query Processing-
NDN

33 pages

No ratings yet
Examples 1

5 pages

Ad Download to read ad-free No ratings yet

Cambridge Assessment
International Education:
Computer Science…
9608/23
13 pages
October/November 2019
No ratings yet
2410 CCP6214
Assignment (Dynamic)

8 pages

No ratings yet
Proposed Course Outline
(EEEB1014)

11 pages

No ratings yet
20240601 Hkeaa Edb Ict -
Elective c

16 pages

No ratings yet
Assignment 02 - FA24

Ad Download to read ad-free

5 pages

No ratings yet
CS-20004 (Oop) - CS End
April 2024

26 pages

No ratings yet
couchbase-certified-
java-developer-sample

8 pages

No ratings yet
Sample Paper

33 pages

No ratings yet
R Programming For BIA
B452F

21 pages

No ratings yet

Ad Download to read ad-free So!ware

7 pages

No ratings yet
9618_w24_qp_21

20 pages

No ratings yet
Further Maths-S2

3 pages

No ratings yet
Protocols Notes A level

9 pages

No ratings yet
Boolean Algebra
Applications

57 pages
Ad Download to read ad-free
No ratings yet
Network Hardware

3 pages

No ratings yet
SOILS

10 pages

No ratings yet
Transport in Plants

56 pages

No ratings yet
Text Representation

4 pages

No ratings yet
????? ?? ?????? ?? 1857

Ad Download to read ad-free

6 pages

No ratings yet
Adt

9 pages

No ratings yet
Notes

24 pages

No ratings yet
Cambridge International
Advanced Level

16 pages

No ratings yet
Section 4 Further
Problem-Solving and
Programming Skills
26 pages

Ad Download to read ad-free No ratings yet

Control Flow:
Conditional Blocks 1.
Flow of Control
9 pages

No ratings yet
Differences DBMS RDBMS

4 pages

No ratings yet
Activity 8 - Transaction
Processing and Financial
Reporting
2 pages

No ratings yet
Question Bank For
Digital Signal Processing
Regulation 2013
8 pages

No ratings yet
Test Header: Orderdate
Region Rep Item Units
Unit Cost Total
Ad Download to read ad-free 9 pages

No ratings yet
rM2TH Manual

16 pages

No ratings yet
105slplus Parts Catalog
en Us

13 pages

No ratings yet
162 ‫حاضرة الثانية‬,‫ا‬
1446_

39 pages

No ratings yet
CR 9200000037 - Web
Site Integration

11 pages

No ratings yet
Hindi Book Final For
Ad Download to read ad-free
Printing

303 pages

No ratings yet
Nature of The Action:
Complaint For Forfeiture

8 pages

No ratings yet
(Ebooks PDF) Download
Fundamentals of
Information Systems…
Security Full Chapters
49 pages

No ratings yet
05 Activity 1

2 pages

No ratings yet
06 EasyIO FC20 Sedona
Kitsv1.2 PDF

63 pages

Ad Download to read ad-free

No ratings yet
Cst206 Scheme

4 pages

No ratings yet
(Bu I 3) PTIT -
Penetration - Testing

20 pages

No ratings yet
Kiosk Banking Solution
Document:: Sub-Bc Can
Login With The Admin…
Link
11 pages

No ratings yet
E-Healthcare Advisor
Final

22 pages

No ratings yet
Assignment Front Page
Format Word File 2
Ad Download to read ad-free

2 pages

No ratings yet
DPC BUS BRO S Series
Brochure

4 pages

No ratings yet
Project Report On Co2
Monitoring

23 pages

No ratings yet
Precios 04112022

36 pages

No ratings yet
List of So!ware Installed
On My Operating System

2 pages

No ratings yet
Ad Download to read ad-free
AnitoBasasSilao Ch1 Ch2

9 pages

No ratings yet
Tutorial Electro Scheme
en

55 pages

No ratings yet
Scanning Report 01
December 2010 00:30:30
- 01:11:02: Result: 36…
Malware
27 pages
Found

No ratings yet
Cloud Computing MCQ
(Multiple Choice
Questions)
11 pages

Ad Download to read ad-free

Ad Download to read ad-free

 Ad Download to read ad-free

9618/41 Cambridge International AS & A Level – Mark Scheme October/November 2024

PUBLISHED

Question Answer Marks

2(e)(ii) J ava
Double Total = 0.0;
Double Chance = 0.0;
Double Average = 0.0;
for(Integer y = 0; y < 2; y ++){
Total = 0.0;
for(Integer x = 0; x < 4; x++){
Chance = Horses[y].Success(Course[x].GetHeight(), Course[y].GetRisk());
System.out.println(Horses[y].GetName() + " Fence " + (x + 1) + " chance of
success is " + Chance + "%");
Total = Total + Chance;
}
Average = Total / 4;
AverageSuccess[y] = Average;
System.out.println(Horses[y].GetName() + " average success rate is " + Average +
"%");
}
Double Highest = AverageSuccess[0];
Integer Winner = 0;
for(Integer x = 1; x < 2; x++){
if(Highest < AverageSuccess[x]){
Winner = x;
Highest = AverageSuccess[x];
}
}
System.out.println(Horses[Winner].GetName() + " has the highest average chance of
success");

©C ambridge University Press & Assessment 2024 Page 24 of 37

Ad Download to read ad-free

9618/41 Cambridge International AS & A Level – Mark Scheme October/November 2024

PUBLISHED

Question Answer Marks

2(e)(iii) 1 mark each 2

• Outputting showing correct input values for all fences, and correct chance for each horse on each jump
• Outputs of average chance of each horse and horse name with highest average

e.g.

©C ambridge University Press & Assessment 2024 Page 25 of 37

Ad Download to read ad-free

9618/41 Cambridge International AS & A Level – Mark Scheme October/November 2024

PUBLISHED

Question Answer Marks

3(a) 1 mark each 2

• LinkedList declared as 2D array with (min) 20  2 elements (Integer) with all data initialised to -1, all nodes linked
correctly
• (Global) FirstNode (Int) initialised as -1 and (global) FirstEmpty (Int) initialised as 0

VB.NET
Dim LinkedList(20, 2) As Integer
Dim FirstNode As Integer
Dim FirstEmpty As Integer

Sub Main(args As String())

FirstNode = -1
FirstEmpty = 0
For x = 0 To 18
LinkedList(x, 0) = -1
LinkedList(x, 1) = x + 1

Next
LinkedList(19, 0) = -1
LinkedList(19, 1) = -1
End Sub

©C ambridge University Press & Assessment 2024 Page 26 of 37

Ad Download to read ad-free

9618/41 Cambridge International AS & A Level – Mark Scheme October/November 2024

PUBLISHED

Question Answer Marks

3(a) Python
LinkedList = [] #global
FirstNode = -1
FirstEmpty = 0
for x in range(0, 19):
LinkedList.append([-1, x + 1])
LinkedList[19][0] = -1
LinkedList[19][1] = -1

J ava
private static Integer[][] LinkedList = new Integer[20][2];
private static Integer FirstNode;
private static Integer FirstEmpty;
public static void main(String args[]){
FirstNode = -1;
FirstEmpty = 0;
for(Integer X = 0; X < 19; X++){
LinkedList[X][0] = -1;
LinkedList[X][1] = X + 1;
}
LinkedList[19][0] = -1;
LinkedList[19][1] = -1;
}

©C ambridge University Press & Assessment 2024 Page 27 of 37

Ad Download to read ad-free

Ad Download to read ad-free

9618/41 Cambridge International AS & A Level – Mark Scheme October/November 2024

PUBLISHED

Question Answer Marks

3(b) 1 mark each to max 6 6

• Procedure header (and end) taking (min) 5 data items as input from the user
• Checking if linked list is full (FirstEmpty = -1) …
• …ending procedure/loop/not doing anything further

• (otherwise) LinkedList[FirstEmpty, 0] =data input

• LinkedList[FirstEmpty, 1] = FirstNode
• FirstNode = FirstEmpty
• FirstEmpty = LinkedList[FirstEmpty, 1] before any update to FirstEmpty ‘s pointer

e.g.
Python
def InsertData():
global LinkedList
global FirstNode
global FirstEmpty
for _ in range(5):
if FirstEmpty != -1:
nextEmpty = LinkedList[FirstEmpty][1]
LinkedList[FirstEmpty][0] = int(input("Value: "))
LinkedList[FirstEmpty][1] = FirstNode
FirstNode = FirstEmpty
FirstEmpty = nextEmpty

©C ambridge University Press & Assessment 2024 Page 28 of 37

Ad Download to read ad-free

9618/41 Cambridge International AS & A Level – Mark Scheme October/November 2024

PUBLISHED

Question Answer Marks

3(b) VB.NET
Sub InsertData()
Dim NewItem As Integer
Dim NextEmpty As Integer

For x = 0 To 4
Console.WriteLine("Enter the next number")
NewItem = Console.ReadLine()

If FirstEmpty = -1 Then
x = 5
Else
NextEmpty = LinkedList(FirstEmpty, 1)
LinkedList(FirstEmpty, 0) = NewItem
LinkedList(FirstEmpty, 1) = FirstNode
FirstNode = FirstEmpty
FirstEmpty = NextEmpty
End If

Next x
End Sub

©C ambridge University Press & Assessment 2024 Page 29 of 37

Ad Download to read ad-free

9618/41 Cambridge International AS & A Level – Mark Scheme October/November 2024

PUBLISHED

Question Answer Marks

3(b) J ava
public static void InsertData(){
Integer NewItem;
Integer CurrentPointer = 0;
Integer PreviousPointer = 0;
Scanner scanner = new Scanner(System.in);
Integer NextEmpty;

for(Integer X = 0; X < 5; X++){

System.out.println("Enter the next number");
NewItem = Integer.parseInt(scanner.nextLine());
if(FirstEmpty == -1){
X = 5;
}else{
NextEmpty = LinkedList[FirstEmpty][1];
LinkedList[FirstEmpty][0] = NewItem;
LinkedList[FirstEmpty][1] = FirstNode;
FirstNode = FirstEmpty;
FirstEmpty = NextEmpty;
}
}
}

©C ambridge University Press & Assessment 2024 Page 30 of 37

Ad Download to read ad-free

9618/41 Cambridge International AS & A Level – Mark Scheme October/November 2024

PUBLISHED

Question Answer Marks

3(c)(i) 1 mark each 2

• Procedure header (and end) starting with node at index FirstNode and outputting data
LinkedList[FirstNode,0]
• Following pointers until end reached and outputting data for each node

Python
def OutputLinkedList():
global LinkedList
global FirstNode
global FirstEmpty
CurrentPointer = FirstNode
Flag = True
while Flag:
print(LinkedList[CurrentPointer][0])
CurrentPointer = LinkedList[CurrentPointer][1]
if CurrentPointer == -1:
Flag = False

VB.NET
Sub OutputLinkedList()

Dim CurrentPointer As Integer = FirstNode

Dim Flag As Boolean = True
While Flag
Console.WriteLine(LinkedList(CurrentPointer, 0))
CurrentPointer = LinkedList(CurrentPointer, 1)
If CurrentPointer = -1 Then
Flag = False
End If
End While

©C ambridge University Press & Assessment 2024 Page 31 of 37

Ad Download to read ad-free

Ad Download to read ad-free

Ad Download to read ad-free

Ad Download to read ad-free

Ad Download to read ad-free

Ad Download to read ad-free

Ad Download to read ad-free

Reward Your Curiosity

Everything you want to read.
Anytime. Anywhere. Any device.

Read free for 30 days

No Commitment. Cancel anytime.

Share this document

    

About Support Legal Social Get our free apps

About Scribd Help / FAQ Terms Instagram

Everand: Ebooks & Accessibility Privacy Twitter

Audiobooks
Purchase help Copyright Facebook
SlideShare
AdChoices Cookie Preferences Pinterest
Join our team!
Do not sell or share my
Contact us personal information

Documents
Language: English Copyright © 2025 Scribd Inc.