AQA_2024: A-level Computer Science - Paper 1
(Merged Question Paper and Marking Scheme)
A-level
COMPUTER SCIENCE
Paper 1
Monday 10 June 2024 Afternoon Time allowed: 2 hours 30 minutes
Materials
For this paper you must have:
a computer
a printer
appropriate software
the Electronic Answer Document
an electronic version and a hard copy of the Skeleton Program
an electronic version and a hard copy of the Preliminary Material
an electronic version of the Data files puzzle1.txt, puzzle2.txt, puzzle3.txt and puzzle4.txt.
You must not use a calculator.
Instructions
Type the information required on the front of your Electronic Answer Document.
Before the start of the examination make sure your Centre Number, Candidate Name and
Candidate Number are shown clearly in the footer of every page (also at the top of the front
cover) of your Electronic Answer Document.
Enter your answers into the Electronic Answer Document.
Answer all questions.
Save your work at regular intervals.
Information
The marks for questions are shown in brackets.
The maximum mark for this paper is 100.
No extra time is allowed for printing and collating.
The question paper is divided into four sections.
Advice
You are advised to allocate time to each section as follows:
Section A – 40 minutes; Section B – 20 minutes; Section C – 20 minutes; Section D – 70 minutes.
At the end of the examination
Tie together all your printed Electronic Answer Document pages and hand them to the Invigilator.
Warning
It may not be possible to issue a result for this paper if your details are not on every page of your
Electronic Answer Document.
,For A-level Computer Science Paper 1, focusing on the Theory of Computer Science, the following areas
are crucial for revision:
1. Fundamentals of Programming:
Programming Concepts: Understand core programming concepts such as variables, constants,
data types (integer, string, boolean, float), operators, and control structures (if-else, for/while
loops).
Data Structures: Be familiar with key data structures, including:
o Arrays: How to declare, manipulate, and search arrays.
2. Algorithms:
Algorithm Design: Know how to design algorithms for common tasks, write pseudocode, and
represent algorithms using flowcharts.
Sorting and Searching:
o Sorting Algorithms: Understand algorithms like bubble sort, merge sort, quick sort, and
insertion sort. Know their time complexities (O(n²) for bubble sort, O(n log n) for merge and
quick sort).
3. Data Representation:
Binary and Hexadecimal: Understand how to convert between binary, decimal, and hexadecimal.
Practice binary arithmetic (addition, subtraction).
Character Representation: Learn how ASCII and Unicode represent characters and the difference
between them.
Data Structures in Memory: Understand how data structures like arrays and linked lists are
represented in memory.
4. Computer Systems:
CPU Architecture: Know the Von Neumann architecture—fetch-decode-execute cycle, and the
roles of the control unit, ALU, and memory.
Memory: Understand the difference between primary memory (RAM) and secondary storage
(hard drives, SSDs) in terms of speed, volatility, and capacity.
Input/Output Devices: Familiarize yourself with basic I/O devices and their functions in a computer
system.
5. Networking:
OSI Model: Understand the 7 layers of the OSI model (Application, Presentation, Session, Transport,
Network, Data Link, Physical) and what each layer does.
Network Protocols: Understand common network protocols such as TCP/IP, HTTP, FTP, and DNS.
Learn their roles in data transfer.
IP Addressing: Understand IPv4 and IPv6 addressing, including concepts like subnetting and
calculating subnet masks.
6. Databases:
Relational Databases: Understand the concept of tables, primary keys, foreign keys, and SQL
operations such as SELECT, INSERT, UPDATE, DELETE.
Normalization: Be able to normalize databases to 1st, 2nd, and 3rd normal form.
Entity-Relationship Diagrams: Know how to design and interpret ER diagrams.
IB/G/Jun24/G4001/E12 7517/1
, 2
Section A
You are advised to spend no longer than 40 minutes on this section.
Enter your answers for Section A in your Electronic Answer Document.
You must save this document at regular intervals.
0 1 State three advantages of using subroutines.
For each advantage, you must explain how the advantage is achieved.
[3 marks]
0 2 Circular queues and linear queues are examples of data structures that can be
implemented using a fixed-length array.
0 2 . 1 Explain why, when implemented using a fixed-length array, a circular queue is usually
considered to be a better choice of data structure than a linear queue.
[2 marks]
0 2 . 2 Describe the steps that must be completed to remove (dequeue) an item from a
circular queue that has been implemented using a fixed-length array.
[5 marks]
0 3
0 3 . 1 Describe the Halting problem.
[2 marks]
0 3 . 2 Explain the importance of the Halting problem.
[1 mark]
IB/G/Jun24/7517/1
, 3
0 4 Figure 1 shows four sets R, S, T and U. Three dots (…) means the remaining
members of the set follow the same pattern as the previous members of the set.
Figure 1
R = {a, b}
S = {a, abb, abbbb, abbbbbb, …}
T = {bb, bbbb, bbbbbb, …}
U = {c, d, bb, b}
0 4 . 1 What is meant by the cardinality of a set?
[1 mark]
0 4 . 2 Explain what is wrong with the statement:
‘The only subsets of R are the sets {a}, {b} and {a, b}’.
[1 mark]
0 4 . 3 How many members are there in the set formed by the intersection of R and U?
[1 mark]
0 4 . 4 The language defined by a regular expression can be represented as a set.
Explain the functionality of the | (vertical bar) metacharacter when it is used in a
regular expression.
[1 mark]
The members of the set V are strings that match the regular expression a?b+
Set W is formed by the union of sets S and T.
Set X is formed by the set operation V – W.
0 4
. 5 Write a regular expression that would match with all the members of the set W.
[2 marks]
0 4 . 6 Write a regular expression that would match with all the members of the set X.
[2 marks]
Turn over ►
IB/G/Jun24/7517/1
(Merged Question Paper and Marking Scheme)
A-level
COMPUTER SCIENCE
Paper 1
Monday 10 June 2024 Afternoon Time allowed: 2 hours 30 minutes
Materials
For this paper you must have:
a computer
a printer
appropriate software
the Electronic Answer Document
an electronic version and a hard copy of the Skeleton Program
an electronic version and a hard copy of the Preliminary Material
an electronic version of the Data files puzzle1.txt, puzzle2.txt, puzzle3.txt and puzzle4.txt.
You must not use a calculator.
Instructions
Type the information required on the front of your Electronic Answer Document.
Before the start of the examination make sure your Centre Number, Candidate Name and
Candidate Number are shown clearly in the footer of every page (also at the top of the front
cover) of your Electronic Answer Document.
Enter your answers into the Electronic Answer Document.
Answer all questions.
Save your work at regular intervals.
Information
The marks for questions are shown in brackets.
The maximum mark for this paper is 100.
No extra time is allowed for printing and collating.
The question paper is divided into four sections.
Advice
You are advised to allocate time to each section as follows:
Section A – 40 minutes; Section B – 20 minutes; Section C – 20 minutes; Section D – 70 minutes.
At the end of the examination
Tie together all your printed Electronic Answer Document pages and hand them to the Invigilator.
Warning
It may not be possible to issue a result for this paper if your details are not on every page of your
Electronic Answer Document.
,For A-level Computer Science Paper 1, focusing on the Theory of Computer Science, the following areas
are crucial for revision:
1. Fundamentals of Programming:
Programming Concepts: Understand core programming concepts such as variables, constants,
data types (integer, string, boolean, float), operators, and control structures (if-else, for/while
loops).
Data Structures: Be familiar with key data structures, including:
o Arrays: How to declare, manipulate, and search arrays.
2. Algorithms:
Algorithm Design: Know how to design algorithms for common tasks, write pseudocode, and
represent algorithms using flowcharts.
Sorting and Searching:
o Sorting Algorithms: Understand algorithms like bubble sort, merge sort, quick sort, and
insertion sort. Know their time complexities (O(n²) for bubble sort, O(n log n) for merge and
quick sort).
3. Data Representation:
Binary and Hexadecimal: Understand how to convert between binary, decimal, and hexadecimal.
Practice binary arithmetic (addition, subtraction).
Character Representation: Learn how ASCII and Unicode represent characters and the difference
between them.
Data Structures in Memory: Understand how data structures like arrays and linked lists are
represented in memory.
4. Computer Systems:
CPU Architecture: Know the Von Neumann architecture—fetch-decode-execute cycle, and the
roles of the control unit, ALU, and memory.
Memory: Understand the difference between primary memory (RAM) and secondary storage
(hard drives, SSDs) in terms of speed, volatility, and capacity.
Input/Output Devices: Familiarize yourself with basic I/O devices and their functions in a computer
system.
5. Networking:
OSI Model: Understand the 7 layers of the OSI model (Application, Presentation, Session, Transport,
Network, Data Link, Physical) and what each layer does.
Network Protocols: Understand common network protocols such as TCP/IP, HTTP, FTP, and DNS.
Learn their roles in data transfer.
IP Addressing: Understand IPv4 and IPv6 addressing, including concepts like subnetting and
calculating subnet masks.
6. Databases:
Relational Databases: Understand the concept of tables, primary keys, foreign keys, and SQL
operations such as SELECT, INSERT, UPDATE, DELETE.
Normalization: Be able to normalize databases to 1st, 2nd, and 3rd normal form.
Entity-Relationship Diagrams: Know how to design and interpret ER diagrams.
IB/G/Jun24/G4001/E12 7517/1
, 2
Section A
You are advised to spend no longer than 40 minutes on this section.
Enter your answers for Section A in your Electronic Answer Document.
You must save this document at regular intervals.
0 1 State three advantages of using subroutines.
For each advantage, you must explain how the advantage is achieved.
[3 marks]
0 2 Circular queues and linear queues are examples of data structures that can be
implemented using a fixed-length array.
0 2 . 1 Explain why, when implemented using a fixed-length array, a circular queue is usually
considered to be a better choice of data structure than a linear queue.
[2 marks]
0 2 . 2 Describe the steps that must be completed to remove (dequeue) an item from a
circular queue that has been implemented using a fixed-length array.
[5 marks]
0 3
0 3 . 1 Describe the Halting problem.
[2 marks]
0 3 . 2 Explain the importance of the Halting problem.
[1 mark]
IB/G/Jun24/7517/1
, 3
0 4 Figure 1 shows four sets R, S, T and U. Three dots (…) means the remaining
members of the set follow the same pattern as the previous members of the set.
Figure 1
R = {a, b}
S = {a, abb, abbbb, abbbbbb, …}
T = {bb, bbbb, bbbbbb, …}
U = {c, d, bb, b}
0 4 . 1 What is meant by the cardinality of a set?
[1 mark]
0 4 . 2 Explain what is wrong with the statement:
‘The only subsets of R are the sets {a}, {b} and {a, b}’.
[1 mark]
0 4 . 3 How many members are there in the set formed by the intersection of R and U?
[1 mark]
0 4 . 4 The language defined by a regular expression can be represented as a set.
Explain the functionality of the | (vertical bar) metacharacter when it is used in a
regular expression.
[1 mark]
The members of the set V are strings that match the regular expression a?b+
Set W is formed by the union of sets S and T.
Set X is formed by the set operation V – W.
0 4
. 5 Write a regular expression that would match with all the members of the set W.
[2 marks]
0 4 . 6 Write a regular expression that would match with all the members of the set X.
[2 marks]
Turn over ►
IB/G/Jun24/7517/1
