Revision Library
Choose a subject
Menu
Computer Science
Need a new topic?
Missing a topic, found a bug, or want something added?

Book 4 of 4

A Level Computer Science Exam Papers Set D

A Level Paper 4: Data and Networks, A Level Paper 5: Algorithms and Theory and A Level Paper 6: Systems and Theory Review

Level
A Level · AQA 7517 · OCR H446
Series
A Level Computer Science Exam Papers, book 4 of 4
Suitable for
Years 12-13, AQA / OCR
FreePDF download · 2027 edition · 72 A4 pages
  • One file, prints straight to A4
  • No account, no password

3 papers, mark schemes at the back. This set is one of 558 free PDFs on the shelf.

Pages
72 A4 pages
Papers
3 papers
Questions
64 · 260 marks
Answers
From page 52

What is inside

3 papers · answers from p52

Each paper starts with a page showing its marks and a suggested time, followed by the questions. The mark schemes for all 3 papers are at the back, so you can sit each paper as a mock and mark it afterwards.

  1. 01A Level Paper 4: Data and Networks20 questions · 80 marksp3
  2. 02A Level Paper 5: Algorithms and Theory19 questions · 80 marksp17
  3. 03A Level Paper 6: Systems and Theory Review25 questions · 100 marksp32
  4. AnswersMark schemes for every paperp52

Each paper is drawn from one of our worksheet packs. Follow a paper title for the full pack on its own page, or browse every A Level Computer Science pack. Every book on the shelf is a complete printable workbook of up to 120 A4 pages.

Explore this volume

A Level Computer Science Exam Papers Set D includes A Level Paper 4: Data and Networks (from page 3); A Level Paper 5: Algorithms and Theory (from page 17); A Level Paper 6: Systems and Theory Review (from page 32).

Worked question 5 - A Level Paper 4: Data and Networks

Convert the denary number -45 into an 8-bit two's complement binary number.

Answer

11010011

Mark scheme

M1for finding the binary representation of 45 as 00101101
M1for inverting all bits to give 11010010
M1for adding 1 to the inverted bits
A1for 11010011 Award equivalent credit for another valid complete conversion method; the particular listed route is not compulsory.

Question 8 - A Level Paper 4: Data and Networks

4 marks

An IPv4 address is 192.168.1.130 and its subnet mask is 255.255.255.192.

State the number of bits used for the network portion of the address under this subnet mask, and explain how a subnet mask is used to determine whether two IP addresses are on the same subnet.

Answer

26 network bits; two addresses are on the same subnet if ANDing each with the subnet mask gives the same network address

Mark scheme

M1for converting the last octet, 192, to binary: 11000000
A1for 26 network bits in total (8 + 8 + 8 + 2)
B1for explaining a bitwise AND is performed between an IP address and the subnet mask to find its network address
B1for stating two addresses are on the same subnet if this calculation gives the same network address for both

Question 3 - A Level Paper 4: Data and Networks

3 marks

A binary search tree has the following structure: the root holds 40; its left child holds 20 and its right child holds 60; 20's left child holds 10 and its right child holds 30.

List the values visited by an in-order traversal of this tree (left subtree, root, right subtree, applied recursively).

Answer

10, 20, 30, 40, 60

Mark scheme

M1for correctly traversing the left subtree of 40 first, giving 10, 20, 30
M1for visiting the root, 40, next
A1for the complete sequence 10, 20, 30, 40, 60

Question 9 - A Level Paper 4: Data and Networks

4 marks

A binary search tree is built by inserting values one at a time into an initially empty tree, in this order: 50, 25, 75, 10, 30.

Each new value is compared with the current node, moving left if it is smaller and right if it is larger, until an empty position is found.

State the parent value and the side (left or right child) that each of 10 and 30 is inserted as.

Answer

10 is the left child of 25; 30 is the right child of 25.

Mark scheme

A1for 10 having parent 25
A1for 10 being a left child.
A1for 30 having parent 25
A1for 30 being a right child. No ancestor comparison trace is required.

Question 15 - A Level Paper 5: Algorithms and Theory

6 marks

Insertion sort builds a sorted section at the start of a list by inserting each new element into its correct position, shifting larger elements along to make room.

The nearly-sorted list [2, 5, 9, 14, 8, 20] is sorted using insertion sort.

State how many shifts are needed to insert 8 into its correct position within the already-sorted section 2, 5, 9, 14, and explain why insertion sort performs much better on a nearly-sorted list like this than on a list in reverse order, referring to its best-case and worst-case time complexities.

Answer

Two shifts: 14, then 9; insert 8 after 5, producing [2,5,8,9,14,20]. Nearly sorted data needs few shifts. An already sorted list takes O(n) comparisons overall; reverse order requires 1+2+...+(n-1) shifts and O(n^2) time.

Mark scheme

A1for 2 shifts
A1for a count consistent with moving 14 and 9 past 8
A1for insertion after 5. The latter two may be inferred from the correct count for the printed section.
B1for explaining that nearly sorted data needs few shifts
B1for best-case O(n) on already sorted input
B1for worst-case O(n^2) on reverse order because the shifts sum to 1+2+...+(n-1). Accept equivalent valid complexity explanations; an intermediate comparison trace is not required.

Question 17 - A Level Paper 5: Algorithms and Theory

6 marks

Quicksort partitions a list around a pivot, then recursively sorts the sublist before the pivot and the sublist after the pivot.

The list [7, 3, 9, 1, 5] is partitioned using the last element, 5, as the pivot, giving the sublist [3, 1] before the pivot and [7, 9] after it, with 5 at index 2.

State the two recursive calls made next, and explain why quicksort's worst-case time complexity is O(n^2) even though its average case is O(n log n).

Answer

Recursive calls sort [3, 1] and [7, 9]; the worst case is O(n^2) because a poor pivot choice (e.g. smallest/largest each time) gives n levels of recursion instead of log n, each doing O(n) work

Mark scheme

M1for identifying the first recursive call as sorting the sublist before the pivot, [3, 1]
A1for identifying the second recursive call as sorting the sublist after the pivot, [7, 9]
B1for explaining the average case splits the list into two roughly equal halves each time, giving O(log n) levels of recursion with O(n) work partitioning at each level, hence O(n log n)
B1for explaining the worst case occurs when a pivot is chosen that is the smallest or largest remaining value each time, for example on an already-sorted list with a fixed choice of pivot
B1for explaining this gives sublists of size (n-1) and 0 at every level, meaning n levels of recursion instead of log n
B1for concluding n levels each doing O(n) work partitioning gives O(n^2) overall in the worst case

Question 3 - A Level Paper 5: Algorithms and Theory

3 marks

A linear search checks each element of a list in turn, starting from index 0, until the target is found or the list is exhausted.

State the best-case number of comparisons for a linear search on a list of n elements, describe the circumstance in which this best case occurs, and state the best-case time complexity in Big O notation.

Answer

Best case: 1 comparison, when the target is at index 0; best-case complexity O(1)

Mark scheme

B1for stating the best case is 1 comparison
B1for describing this occurring when the target is the first element checked, at index 0
B1for stating the best-case time complexity is O(1)

Question 11 - A Level Paper 6: Systems and Theory Review

3 marks

A website can be accessed using HTTP or HTTPS. HTTPS encrypts the data sent between the browser and the server; HTTP does not.

Explain why HTTPS is important for a website that asks visitors to enter a password or payment details, and state what a digital certificate is used for in establishing an HTTPS connection.

Answer

HTTPS encrypts data so it cannot be read if intercepted, which matters for passwords/payment details; the digital certificate verifies the website's identity and helps establish the encrypted connection

Mark scheme

B1for explaining that without encryption, data sent over HTTP could be intercepted and read by a third party as it travels across the network
B1for explaining HTTPS protects sensitive data, such as a password or payment details, by encrypting it so it cannot be read even if intercepted
B1for stating a valid certificate purpose in establishing HTTPS, such as authenticating the named server by binding its identity to a public key; do not require an additional key-establishment point.

Question 22 - A Level Paper 6: Systems and Theory Review

6 marks

A 2 megabyte (MB, where 1 MB = 1,000,000 bytes) file is sent over a connection with a bandwidth of 8 megabits per second (Mbps, where 1 Mbps = 1,000,000 bits per second) and a one-way latency of 50 milliseconds before any data starts to arrive.

Calculate the total time taken for the file to be fully received, from the moment sending begins, including both the latency and the time needed to transfer the data itself.

Answer

Transfer time = 2 seconds; total time including latency = 2 + 0.05 = 2.05 seconds

Mark scheme

M1for converting the file size to bits: 2,000,000 x 8 = 16,000,000 bits
M1for stating the bandwidth in bits per second: 8,000,000 bits per second
M1for dividing to find the transfer time: 16,000,000 / 8,000,000
A1for a transfer time of 2 seconds
M1for converting the latency to seconds (50 ms = 0.05 s) and adding it to the transfer time
A1for a total time of 2.05 seconds

A Level Computer Science Exam Papers runs to 4 volumes

Book 4 of 4 · 259 pages in the set

Each set is a separate free PDF with its own mark schemes at the back.

Volume 1

56 pp · 52 Qs

AS Paper 1: Data Representation and Logic, AS Paper 2: Networks and Systems and AS Paper 3: Algorithms and Structures

Volume 2

72 pp · 74 Qs

AS Paper 4: Mixed Practice A, AS Paper 5: Mixed Practice B and AS Paper 6: Full AS Review

Volume 3

59 pp · 48 Qs

A Level Paper 1: Algorithms and Data Structures, A Level Paper 2: Programming Theory and A Level Paper 3: Computer Systems

Volume 4 · this book

72 pp · 64 Qs

A Level Paper 4: Data and Networks, A Level Paper 5: Algorithms and Theory and A Level Paper 6: Systems and Theory Review

More A Level books

A Level Computer Science Topic Workbook 1

97 pp · 102 Qs

Structure and Function of the Processor, Types of Software and Development Methodologies, Exchanging Data: Databases, Networks and Web Technologies and 7 more