AQA_2024: AS Computer Science - Paper 2
(Merged Question Paper and Marking Scheme)
Please write clearly in block capitals.
Centre number Candidate number
Surname
Forename(s)
Candidate signature
I declare this is my own work.
AS
COMPUTER SCIENCE
Paper 2
Tuesday 21 May 2024 Afternoon Time allowed: 1 hour 30 minutes
Materials
For this paper you must have: For Examiner’s Use
a calculator.
Question Mark
Instructions 1
Use black ink or black ball-point pen. 2
Fill in the boxes at the top of this page. 3
Answer all questions.
4
You must answer the questions in the spaces provided. Do not write outside
the box around each page or on blank pages. 5
If you need extra space for your answer(s), use the lined pages at the end of 6
this book. Write the question number against your answer(s).
7
Do all rough work in this book. Cross through any work you do not want to
be marked. 8
9
Information 10
The marks for questions are shown in brackets.
11
The maximum mark for this paper is 75.
TOTAL
Advice
In some questions you are required to indicate your answer by completely
shading a lozenge alongside the appropriate answer as shown.
If you want to change your answer you must cross out your original answer as
shown.
If you wish to return to an answer previously crossed out, ring the answer you
now wish to select as shown.
,For AS Computer Science Paper 2, which focuses on Computational Thinking, Algorithms, and Problem
Solving, concentrate on the following key areas:
1. Computational Thinking:
Problem Decomposition: Be able to break down complex problems into smaller, manageable sub-
problems. Understand how to structure your approach logically and methodically.
Pattern Recognition: Practice identifying patterns within data or algorithms. This involves recognizing
similarities in problems that can be solved using the same method or approach.
2. Algorithms:
Algorithm Efficiency: Know how to analyze algorithms in terms of time complexity (Big O notation)
and space complexity. Be able to assess and compare algorithms for their efficiency.
Sorting Algorithms: Be familiar with common sorting algorithms, including:
o Bubble sort: Understand its process and time complexity (O(n²)).
o Merge sort: Understand its divide-and-conquer approach and time complexity (O(n log n)).
3. Data Structures:
Arrays: Know how to declare, initialize, and access arrays. Understand common operations like
insertion, deletion, and searching in arrays.
Lists: Be familiar with linked lists, both singly and doubly linked. Understand the difference between
arrays and linked lists and their advantages/disadvantages in terms of memory usage and access time.
Stacks: Understand how stacks work (LIFO – Last In, First Out). Practice operations such as push,
pop, and peek.
4. Programming Concepts:
Procedural Programming: Be comfortable writing code in a procedural style. Understand how to use
functions to break down problems.
Recursion: Practice writing and understanding recursive algorithms, especially in problems like
factorial calculation, Fibonacci sequence, and binary search. Be aware of the concept of base
cases and recursive calls.
Iteration: Know how to convert recursive algorithms to iterative ones, and understand when iteration is
more efficient than recursion.
5. Software Development:
Testing: Be familiar with the process of unit testing and integration testing. Understand the
importance of edge cases and boundary testing.
Debugging: Know techniques for identifying and fixing errors in code, such as using breakpoints, step-
through debugging, and examining error logs.
6. Data Representation:
Binary and Hexadecimal: Be confident in converting between binary, decimal, and hexadecimal.
Practice operations such as binary addition and subtraction.
Data Structures Representation: Know how data structures like arrays, linked lists, and trees are
represented in memory and how they are manipulated.
IB/G/Jun24/G4001/E11 7516/2
, 2
Do not write
outside the
Answer all questions in the spaces provided. box
0 1 . 1 Describe the set of real numbers.
[1 mark]
15
0 1 . 2 The number 5 can be written as
3
Shade two lozenges to indicate which of the following statements are true.
[2 marks]
A 15 and 3 are not integers
B 15 and 3 are irrational numbers
C 5 is an irrational number
D 5 is a natural number
E 5 is a rational number
0 1 . 3 Shade one lozenge to indicate which of the symbols below represents the set of
rational numbers.
[1 mark]
A ℂ
B ℕ
C ℚ
D ℝ
E ℤ 4
IB/G/Jun24/7516/2
, 3
Do not write
outside the
0 2 . 1 Convert the bit pattern 10001010 to hexadecimal. box
[1 mark]
0 2 . 2 Represent the decimal number 139 as an 8-bit unsigned binary integer.
[1 mark]
0 2 . 3 Show how the unsigned binary number 00100011 can be added to the unsigned
binary number 00101011 without converting the numbers into decimal.
You must show all your working in binary.
[2 marks]
0 0 1 0 0 0 1 1
+ 0 0 1 0 1 0 1 1
Question 2 continues on the next page
Turn over ►
IB/G/Jun24/7516/2
(Merged Question Paper and Marking Scheme)
Please write clearly in block capitals.
Centre number Candidate number
Surname
Forename(s)
Candidate signature
I declare this is my own work.
AS
COMPUTER SCIENCE
Paper 2
Tuesday 21 May 2024 Afternoon Time allowed: 1 hour 30 minutes
Materials
For this paper you must have: For Examiner’s Use
a calculator.
Question Mark
Instructions 1
Use black ink or black ball-point pen. 2
Fill in the boxes at the top of this page. 3
Answer all questions.
4
You must answer the questions in the spaces provided. Do not write outside
the box around each page or on blank pages. 5
If you need extra space for your answer(s), use the lined pages at the end of 6
this book. Write the question number against your answer(s).
7
Do all rough work in this book. Cross through any work you do not want to
be marked. 8
9
Information 10
The marks for questions are shown in brackets.
11
The maximum mark for this paper is 75.
TOTAL
Advice
In some questions you are required to indicate your answer by completely
shading a lozenge alongside the appropriate answer as shown.
If you want to change your answer you must cross out your original answer as
shown.
If you wish to return to an answer previously crossed out, ring the answer you
now wish to select as shown.
,For AS Computer Science Paper 2, which focuses on Computational Thinking, Algorithms, and Problem
Solving, concentrate on the following key areas:
1. Computational Thinking:
Problem Decomposition: Be able to break down complex problems into smaller, manageable sub-
problems. Understand how to structure your approach logically and methodically.
Pattern Recognition: Practice identifying patterns within data or algorithms. This involves recognizing
similarities in problems that can be solved using the same method or approach.
2. Algorithms:
Algorithm Efficiency: Know how to analyze algorithms in terms of time complexity (Big O notation)
and space complexity. Be able to assess and compare algorithms for their efficiency.
Sorting Algorithms: Be familiar with common sorting algorithms, including:
o Bubble sort: Understand its process and time complexity (O(n²)).
o Merge sort: Understand its divide-and-conquer approach and time complexity (O(n log n)).
3. Data Structures:
Arrays: Know how to declare, initialize, and access arrays. Understand common operations like
insertion, deletion, and searching in arrays.
Lists: Be familiar with linked lists, both singly and doubly linked. Understand the difference between
arrays and linked lists and their advantages/disadvantages in terms of memory usage and access time.
Stacks: Understand how stacks work (LIFO – Last In, First Out). Practice operations such as push,
pop, and peek.
4. Programming Concepts:
Procedural Programming: Be comfortable writing code in a procedural style. Understand how to use
functions to break down problems.
Recursion: Practice writing and understanding recursive algorithms, especially in problems like
factorial calculation, Fibonacci sequence, and binary search. Be aware of the concept of base
cases and recursive calls.
Iteration: Know how to convert recursive algorithms to iterative ones, and understand when iteration is
more efficient than recursion.
5. Software Development:
Testing: Be familiar with the process of unit testing and integration testing. Understand the
importance of edge cases and boundary testing.
Debugging: Know techniques for identifying and fixing errors in code, such as using breakpoints, step-
through debugging, and examining error logs.
6. Data Representation:
Binary and Hexadecimal: Be confident in converting between binary, decimal, and hexadecimal.
Practice operations such as binary addition and subtraction.
Data Structures Representation: Know how data structures like arrays, linked lists, and trees are
represented in memory and how they are manipulated.
IB/G/Jun24/G4001/E11 7516/2
, 2
Do not write
outside the
Answer all questions in the spaces provided. box
0 1 . 1 Describe the set of real numbers.
[1 mark]
15
0 1 . 2 The number 5 can be written as
3
Shade two lozenges to indicate which of the following statements are true.
[2 marks]
A 15 and 3 are not integers
B 15 and 3 are irrational numbers
C 5 is an irrational number
D 5 is a natural number
E 5 is a rational number
0 1 . 3 Shade one lozenge to indicate which of the symbols below represents the set of
rational numbers.
[1 mark]
A ℂ
B ℕ
C ℚ
D ℝ
E ℤ 4
IB/G/Jun24/7516/2
, 3
Do not write
outside the
0 2 . 1 Convert the bit pattern 10001010 to hexadecimal. box
[1 mark]
0 2 . 2 Represent the decimal number 139 as an 8-bit unsigned binary integer.
[1 mark]
0 2 . 3 Show how the unsigned binary number 00100011 can be added to the unsigned
binary number 00101011 without converting the numbers into decimal.
You must show all your working in binary.
[2 marks]
0 0 1 0 0 0 1 1
+ 0 0 1 0 1 0 1 1
Question 2 continues on the next page
Turn over ►
IB/G/Jun24/7516/2
