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

Book 1 of 4

A Level Computer Science Exam Papers Set A

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

Level
A Level · AQA 7517 · OCR H446
Series
A Level Computer Science Exam Papers, book 1 of 4
Suitable for
Years 12-13, AQA / OCR
FreePDF download · 2027 edition · 56 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
56 A4 pages
Papers
3 papers
Questions
52 · 180 marks
Answers
From page 42

What is inside

3 papers · answers from p42

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. 01AS Paper 1: Data Representation and Logic19 questions · 60 marksp3
  2. 02AS Paper 2: Networks and Systems17 questions · 60 marksp15
  3. 03AS Paper 3: Algorithms and Structures16 questions · 60 marksp28
  4. AnswersMark schemes for every paperp42

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 A includes AS Paper 1: Data Representation and Logic (from page 3); AS Paper 2: Networks and Systems (from page 15); AS Paper 3: Algorithms and Structures (from page 28).

Worked question 7 - AS Paper 1: Data Representation and Logic

A computer's memory hierarchy includes CPU registers, cache memory and main memory (RAM), typically in that order from fastest to slowest.

State one reason a computer does not simply use registers for all of its memory, given how much faster they are than main memory.

Answer

Registers are much more expensive per byte than RAM.

Mark scheme

B1for stating one valid reason, such as registers being more expensive per byte than RAM or requiring more chip area per byte; either statement alone earns full credit.

Question 14 - AS Paper 1: Data Representation and Logic

2 marks

Simplify the Boolean expression Y = (A OR B) AND (A OR (NOT B)), showing each law used.

Answer

Y = A. Dual distributivity gives A OR (B AND NOT B). Complementarity gives B AND NOT B = 0. Identity gives A OR 0 = A.

Mark scheme

M1for showing valid laws for a complete simplification, such as distributivity, complementarity and identity; accept any valid derivation
A1for Y = A

Question 11 - AS Paper 1: Data Representation and Logic

4 marks

Convert the 8-bit unsigned binary number 10110110 into hexadecimal, and then convert the same binary number into denary.

Answer

Hexadecimal B6; unsigned denary 182.

Mark scheme

M1for splitting the byte into two nibbles, 1011 and 0110
A1for hexadecimal B6
M1for summing the correct place values, 128 + 32 + 16 + 4 + 2
A1for denary 182

Question 17 - AS Paper 1: Data Representation and Logic

3 marks

A function is defined as: FUNCTION AddOne(n): n = n + 1, RETURN n, ENDFUNCTION

In the main program: x = 5, y = AddOne(x), OUTPUT x, OUTPUT y

State the values output for x and y, and explain, in terms of parameter passing, why x is not changed by the call to AddOne even though the function reassigns its parameter n.

Answer

x = 5 and y = 6. The parameter receives a copy of the value of x; reassigning local n does not change x.

Mark scheme

A1for x = 5
A1for y = 6
B1for explaining that n receives a copy of the value of x, so reassigning local n does not change x

Question 17 - AS Paper 2: Networks and Systems

6 marks

The list [6, 2, 9, 1, 8, 3] is partitioned using quicksort, taking the first element, 6, as the pivot. Elements smaller than the pivot are moved before it, and elements larger than or equal to it are moved after it, preserving their relative order within each group.

State the two sublists formed either side of the pivot after partitioning, and the pivot's final index (counting from 0).

Answer

Before pivot: [2,1,3]; after pivot: [9,8]. Pivot 6 finishes at index 3.

Mark scheme

M1for comparing each remaining element with the pivot 6 in turn
M1for identifying the elements smaller than 6, in original order, as 2, 1, 3
A1for identifying the elements larger than or equal to 6, in original order, as 9, 8
M1for placing the smaller elements before the pivot and the larger elements after it
A1for the pivot 6 ending at index 3
A1for the two sublists: 2, 1, 3 before the pivot and 9, 8 after it Award all 6 marks for the complete correct requested answer: Before pivot: [2,1,3]; after pivot: [9,8]. Pivot 6 finishes at index 3. Accept equivalent valid notation and explanations. Intermediate method evidence below is optional and may be inferred from a correct requested result; do not require unasked states or extra explanations.

Question 15 - AS Paper 2: Networks and Systems

5 marks

Quicksort partitions a list around a pivot value: elements smaller than the pivot are moved before it, and elements larger are moved after it.

The list [10, 4, 15, 2, 8, 12] is partitioned using the lower of the two middle elements (index 2), 15, as the pivot. The elements in each sublist keep their original relative order.

State the two sublists formed either side of the pivot after partitioning, and the pivot's final index (counting from 0).

Answer

Before pivot: [10,4,2,8,12]; pivot 15 at index 5; after pivot: [].

Mark scheme

M1for identifying the middle element (index 2), value 15, as the pivot
M1for comparing each remaining element, 10, 4, 2, 8, 12, against the pivot value 15
A1for recognising every one of these elements is smaller than 15
A1for concluding no elements belong after the pivot, so the pivot moves to the last index, index 5
B1for the sublist before the pivot containing all five remaining elements, 10, 4, 2, 8, 12, in their original relative order Award all 5 marks for the complete correct requested answer: Using the explicitly named pivot 15: before pivot [10,4,2,8,12]; after pivot []; final index 5. The list has two middle positions, so the wording should identify index 2 (the lower middle). Accept equivalent valid notation and explanations. Intermediate method evidence below is optional and may be inferred from a correct requested result; do not require unasked states or extra explanations.

Question 13 - AS Paper 2: Networks and Systems

5 marks

A sorting algorithm is described as stable if two elements that compare as equal always keep their original relative order after sorting.

A list of exam entries is sorted by grade: (Alex, grade B), (Bo, grade A), (Casey, grade B). A stable sort by grade should keep Alex before Casey in the result, since they are both grade B and Alex appeared first.

Explain why a stable sort matters in this scenario, and state whether a standard bubble sort, which only swaps adjacent elements that are strictly out of order, is stable.

Answer

Stability preserves the original order of equal-grade entries, keeping Alex before Casey. Standard bubble sort is stable.

Mark scheme

B1for identifying equal-grade entries as the relevant group
B1for explaining that stability preserves their original relative order. Accept any equivalent valid explanation, without inventing a submission-order context.
B1for applying that preservation to Alex and Casey
B1for keeping Alex before Casey. Award both marks for Alex stays before Casey, or an equivalent contextual explanation. A separate account of what an unstable sort might do is optional.
B1for stating that standard bubble sort is stable. Explaining why bubble sort is stable is optional. Award all 5 marks for preserving the original order of equal-grade entries, keeping Alex before Casey, and stating that standard bubble sort is stable.

Question 1 - AS Paper 3: Algorithms and Structures

2 marks

Convert the denary number 109 into an 8-bit unsigned binary number.

Answer

01101101

Mark scheme

M1for a valid conversion method, such as 109 = 64 + 32 + 8 + 4 + 1, or repeated division by 2.
A1for 01101101, including the leading zero.

Question 2 - AS Paper 3: Algorithms and Structures

3 marks

The list [8, 3, 6, 1] is sorted using a bubble sort. Each pass compares adjacent elements and swaps them if they are in the wrong order, working from the start of the list to the end.

State the contents of the list after one complete pass.

Answer

After one pass: [3,6,1,8].

Mark scheme

M1for swapping 8 and 3 to give 3, 8, 6, 1
M1for swapping 8 and 6, then swapping 8 and 1, moving 8 towards the end
A1for the list 3, 6, 1, 8 after one pass Award all 3 marks for the complete correct requested answer: After one pass: [3,6,1,8]. Accept equivalent valid notation and explanations. Intermediate method evidence below is optional and may be inferred from a correct requested result; do not require unasked states or extra explanations.

A Level Computer Science Exam Papers runs to 4 volumes

Book 1 of 4 · 259 pages in the set

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

Volume 1 · this book

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

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