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

A Level Paper 6: Systems and Theory Review

A wide-ranging review paper covering linear data structures, computer architecture, data representation, networks, databases and SQL, boolean logic and logic gates, programming paradigms and the theory of computation.

25 questions - 100 marks

Download PDF

Open A Level Computer Science workspace

Questions

Question 1 [1 mark]

Boolean Algebra and Logic Gates

A logic circuit implements the Boolean expression X = (A AND B) OR (NOT C).

Evaluate X when A = 1, B = 0 and C = 0.

Question 2 [2 marks]

Networks and Communication

State the purpose of DNS (Domain Name System), and explain why it is needed even though a computer could technically connect directly to another computer's IP address.

Question 3 [2 marks]

Boolean Algebra and Logic Gates

A logic circuit implements the Boolean expression X = (NOT A) OR (B AND C).

Evaluate X when A = 1, B = 1 and C = 0, and state the general rule for when the OR operator gives an output of 1.

Question 4 [2 marks]

Programming Paradigms

In object-oriented programming, abstraction means exposing only the essential features of an object while hiding the complex implementation details.

State what is meant by abstraction, and give one benefit it gives to a programmer using the object.

Question 5 [3 marks]

Data Representation

Convert the hexadecimal number 2F into denary, and then into an 8-bit binary number.

Question 6 [3 marks]

Databases and SQL

A database table Student has columns StudentID, FirstName, LastName and YearGroup.

Write an SQL statement to select the FirstName and LastName of all students in YearGroup 12.

Question 7 [3 marks]

Computer Architecture and the CPU

A CPU is connected to memory using three buses: the address bus, the data bus and the control bus.

State the purpose of each of these three buses.

Question 8 [3 marks]

Linear Data Structures

A doubly linked list stores each node as a value, a pointer to the next node and a pointer to the previous node. The list currently holds, in order, 9 <-> 14 <-> 20, with a head pointer to the node holding 9 (whose previous pointer is null).

Describe, as a sequence of steps, how a new node holding the value 3 is inserted at the head of the list, so the list becomes 3 <-> 9 <-> 14 <-> 20. You do not need to write code.

Question 9 [4 marks]

Theory of Computation

A finite state machine has states S0 (start), S1 and S2 (accepting state). From S0, input a goes to S1 and input b goes to S0. From S1, input a goes to S1 and input b goes to S2. From S2, input a goes to S1 and input b goes to S0.

Trace the machine for the input string bab, and state whether the string is accepted.

Question 10 [2 marks]

Boolean Algebra and Logic Gates

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

Question 11 [3 marks]

Networks and Communication

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.

Question 12 [3 marks]

Boolean Algebra and Logic Gates

Use De Morgan's laws to write an equivalent expression for NOT (A OR B), using only AND, NOT and the individual variables A and B, then confirm your answer is correct by evaluating both expressions when A = 0 and B = 1.

Question 13 [5 marks]

Theory of Computation

A decision problem is in class P if an algorithm exists that can solve any instance of it in polynomial time. A decision problem is in class NP if, given a proposed solution, that solution can be checked (verified) in polynomial time, even if no polynomial-time algorithm is known to find a solution from scratch.

Explain the difference between a problem being in P and a problem being in NP, and state one fact about the relationship between the two classes that is not yet known to be proven either way.

Question 14 [4 marks]

Networks and Communication

A large file is sent across a network using packet switching, rather than being sent as one continuous stream.

Explain what is meant by packet switching, and state one advantage it has over circuit switching, in which a dedicated path is reserved for the communication.

Question 15 [5 marks]

Theory of Computation

The halting problem asks whether it is possible to write a general algorithm that can determine, for any given program and input, whether that program will eventually halt or run forever.

Explain why the halting problem is described as undecidable, and state one practical consequence of this for software testing.

Question 16 [5 marks]

Linear Data Structures

A stack is implemented using an array of fixed capacity 3, with a top pointer that starts at -1 (meaning empty). isFull() returns true once top = 2.

The operations push(5), push(9), push(2) and push(7) are attempted in that order.

State which of these operations succeed, and explain what happens on the operation that fails.

Question 17 [4 marks]

Databases and SQL

The Student table also has columns YearGroup and AverageGrade.

Write an SQL statement to select the FirstName and LastName of students who are in YearGroup 13 AND have an AverageGrade of at least 80.

Question 18 [5 marks]

Theory of Computation

The regular expression (ab)+d matches strings that consist of one or more repetitions of 'ab', followed by a single d.

State, with a reason, whether each of the following strings matches the regular expression: 'abd', 'ababd', 'ad'.

Question 19 [5 marks]

Databases and SQL

A school wants to list every student's FirstName and LastName, together with their CourseName if they are enrolled on one, but the list should still include students who are not enrolled on any course.

Explain why a LEFT JOIN (from Student to Enrolment) should be used here rather than an INNER JOIN, and write the SQL statement.

Question 20 [6 marks]

Theory of Computation

A simple Turing machine has a tape of cells, each holding a 0, 1 or blank symbol, and a read/write head that can move left or right one cell at a time.

The machine starts in state A, positioned on the leftmost cell of the tape 0 1 1 blank.

Its rules are: in state A, if it reads 0, write 0, move right, stay in state A; if it reads 1, write 0, move right, go to state B. In state B, if it reads 1, write 1, move right, stay in state B; if it reads blank, write 1, halt.

Trace the machine's execution and state the final contents of the tape.

Question 21 [6 marks]

Programming Paradigms

A developer needs to find every customer in a large customer database whose total orders exceed 500 pounds. One option is to write a SQL query stating this condition directly. Another option is to write a Python loop that manually reads each record, adds up their orders, and checks the condition.

Explain the difference between the declarative and imperative approaches here, and recommend which is generally more suitable when working directly with a large database, justifying your answer.

Question 22 [6 marks]

Networks and Communication

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.

Question 23 [6 marks]

Programming Paradigms

A team is choosing a programming language for a large, long-lived project maintained by many developers over several years. One option uses static typing, where variable types are checked at compile time; another uses dynamic typing, where types are checked at run time.

Explain the difference between static and dynamic typing, and recommend which is more suitable for this scenario, justifying your answer.

Question 24 [6 marks]

Theory of Computation

A simple Turing machine has a tape of cells, each holding a 0, 1 or blank symbol, and a read/write head that can move left or right one cell at a time.

The machine starts in state A, positioned on the leftmost cell of the tape 1 1 0 blank.

Its rules are: in state A, if it reads 1, write 0, move right, stay in state A; if it reads 0, write 1, move right, go to state B. In state B, if it reads blank, write 0, halt.

Trace the machine's execution and state the final contents of the tape.

Question 25 [6 marks]

Linear Data Structures

A queue of maximum size 4 is implemented as a circular buffer using an array with indices 0 to 3, a front pointer and a rear pointer. isFull() is true exactly when (rear + 1) MOD 4 equals front.

The queue currently holds, from front to rear, 7, 2, 9, with front pointing at index 0 and rear pointing at index 2.

enqueue(5) is attempted, followed by enqueue(1).

State whether each enqueue succeeds, showing the isFull() check used each time, and state the queue's contents after both attempts.

Model solutions

Mark scheme for Question 1 [1 mark]
Question 1[1 mark]
Answer or workingMarks
X = 1; correct output alone earns full creditA1
Final answer: X = 1.
Mark scheme for Question 2 [2 marks]
Question 2[2 marks]
Answer or workingMarks
DNS looking up IP address information for domain names.B1
explaining why names are useful despite direct IP connections being possible, such as being easier to remember or remaining stable when an address changes; one reason suffices.B1
Final answer: DNS resolves names to IP addresses; names are easier to remember and can stay stable when addresses change
Mark scheme for Question 3 [2 marks]
Question 3[2 marks]
Answer or workingMarks
X = 0A1
OR producing 1 when at least one input is 1, including bothB1
Final answer: X = 0; OR gives 1 when at least one operand is 1 (including both).
Mark scheme for Question 4 [2 marks]
Question 4[2 marks]
Answer or workingMarks
a definition such as: abstraction presents a simplified view of an object, showing only what it does rather than how it does it internallyB1
a benefit such as: the programmer using the object can work with a simple, high-level interface without needing to understand or manage its internal complexityB1
Final answer: Abstraction hides internal complexity, showing only what an object does; it lets a programmer use it via a simple interface without needing to understand the implementation
Mark scheme for Question 5 [3 marks]
Question 5[3 marks]
Answer or workingMarks
converting each hex digit to decimal: 2 = 2, F = 15M1
denary 47 (2 x 16 + 15)A1
8-bit binary 00101111A1
Final answer: Denary 47, binary 00101111
Mark scheme for Question 6 [3 marks]
Question 6[3 marks]
Answer or workingMarks
selecting FirstName and LastName, accepting aliases and equivalent projection syntaxM1
selecting from StudentM1
restricting the result to YearGroup = 12 in a complete valid statementA1
Final answer: SELECT FirstName, LastName FROM Student WHERE YearGroup = 12;
Mark scheme for Question 7 [3 marks]
Question 7[3 marks]
Answer or workingMarks
the address bus - carries the memory address the CPU wants to read from or write toB1
the data bus - carries the actual data being transferred between the CPU and memory (or another device)B1
the control bus - carries control signals, such as read/write signals, that coordinate and synchronise the transferB1
Final answer: Address bus: carries the memory address; data bus: carries the data itself; control bus: carries signals that coordinate the transfer
Mark scheme for Question 8 [3 marks]
Question 8[3 marks]
Answer or workingMarks
creating a new node holding 3, with its next pointer set to point to the node holding 9B1
setting the old head node's (9's) previous pointer to point to the new nodeB1
updating the head pointer to point to the new node, whose own previous pointer remains nullB1
Final answer: Create node(3) pointing next to 9; set 9's previous to the new node; update head to point to the new node
Mark scheme for Question 9 [4 marks]
Question 9[4 marks]
Answer or workingMarks
the first input b keeping the machine at S0M1
the second input a moving the machine from S0 to S1M1
the third input b moving the machine from S1 to S2A1
stating the string is accepted, since S2 is an accepting stateA1
Final answer: Accepted - the machine ends in accepting state S2
Mark scheme for Question 10 [2 marks]
Question 10[2 marks]
Answer or workingMarks
showing valid laws for a complete simplification, such as double negation and idempotence, or double negation and absorptionM1
Y = AA1
Final answer: Y = A by double negation and idempotence. Double negation: NOT NOT A = A. Idempotence: A AND A = A. Idempotence again: A OR A = A.
Mark scheme for Question 11 [3 marks]
Question 11[3 marks]
Answer or workingMarks
explaining that without encryption, data sent over HTTP could be intercepted and read by a third party as it travels across the networkB1
explaining HTTPS protects sensitive data, such as a password or payment details, by encrypting it so it cannot be read even if interceptedB1
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.B1
Final 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 for Question 12 [3 marks]
Question 12[3 marks]
Answer or workingMarks
(NOT A) AND (NOT B), or an equivalent De Morgan expression using only AND and NOTA1
the original expression evaluating to 0 at A = 0, B = 1B1
the equivalent expression evaluating to 0 at A = 0, B = 1B1
Final answer: (NOT A) AND (NOT B); both sides are 0 at A = 0, B = 1.
Mark scheme for Question 13 [5 marks]
Question 13[5 marks]
Answer or workingMarks
explaining that P requires existence of a polynomial-time decision algorithm, not necessarily one currently knownB1
explaining that NP requires polynomial-time verification of polynomial-size yes-instance certificatesB1
explaining the solving-versus-checking distinction, for example that every P problem is in NP but NP membership alone does not establish a polynomial-time solverB1
stating that whether P equals NP remains unproved: B1 for identifying the equality question and B1 for its unresolved status; no separate explanation or claim about researchers beliefs is required This row begins a shared allocation of 2 marks for the same requested result or explanation.B1
mark 2 of the same 2-mark allocation above. A complete response meeting that allocation earns every mark in the group; this row adds no separate requirement. Retain the partial-credit guidance stated in the first row of the group.B1
Final answer: P: solvable in polynomial time; NP: a proposed solution can be checked in polynomial time. Every P problem is in NP, but whether P = NP is a famous unsolved question
Mark scheme for Question 14 [4 marks]
Question 14[4 marks]
Answer or workingMarks
dividing data into labelled packets with routing/sequence information.B1
packets being forwarded independently and potentially following different routes.B1
reassembling the original data at the destination.B1
stating one valid advantage over a reserved circuit, such as more efficient link use or greater resilience to a failed path; no additional explanation or second advantage is required.B1
Final answer: Split into packets; route independently; reassemble; share links without reserving a circuit
Mark scheme for Question 15 [5 marks]
Question 15[5 marks]
Answer or workingMarks
explaining that the halting problem is undecidable because no algorithm can always terminate and correctly decide halting for every program/input pair. This complete classification explanation earns all four marks; a self-reference or contradiction proof may support it but is not required. Award up to B3 for correct incomplete explanation. This row begins a shared allocation of 4 marks for the same requested result or explanation.B1
mark 2 of the same 4-mark allocation above. A complete response meeting that allocation earns every mark in the group; this row adds no separate requirement. Retain the partial-credit guidance stated in the first row of the group.B1
mark 3 of the same 4-mark allocation above. A complete response meeting that allocation earns every mark in the group; this row adds no separate requirement. Retain the partial-credit guidance stated in the first row of the group.B1
mark 4 of the same 4-mark allocation above. A complete response meeting that allocation earns every mark in the group; this row adds no separate requirement. Retain the partial-credit guidance stated in the first row of the group.B1
stating one practical consequence, such as no general testing tool being able to decide termination correctly for every program; no second consequence or testing strategy is requiredB1
Final answer: Undecidable because no algorithm can correctly determine halting for every program and input (proved by contradiction); consequently, testing tools cannot in general guarantee whether a program will terminate
Mark scheme for Question 16 [5 marks]
Question 16[5 marks]
Answer or workingMarks
push(5) succeeding, with top becoming 0M1
push(9) succeeding, with top becoming 1M1
push(2) succeeding, with top becoming 2, so isFull() is now trueA1
push(7) failing, since isFull() is true when it is attemptedA1
explaining this is a stack overflow, since the array has reached its fixed capacity and cannot store another value Award all 5 marks for a complete correct answer to the requested task. Accept equivalent valid explanations and notation. Method details not explicitly requested may be inferred from the correct requested results. The prompt requests successes and an explanation of failure. The top values are implied by the stated capacity convention; a separate top trace must not be mandatory.B1
Final answer: push(5), push(9), push(2) succeed. top is then 2, so isFull is true. push(7) fails with stack overflow and must leave the stack unchanged.
Mark scheme for Question 17 [4 marks]
Question 17[4 marks]
Answer or workingMarks
selecting FirstName and LastName from StudentM1
filtering YearGroup to 13M1
filtering AverageGrade to at least 80, including equalityM1
combining both predicates with AND in a complete valid statementA1
Final answer: SELECT FirstName, LastName FROM Student WHERE YearGroup = 13 AND AverageGrade >= 80;
Mark scheme for Question 18 [5 marks]
Question 18[5 marks]
Answer or workingMarks
stating that abd matches because it contains one ab followed by dB1
stating that ababd matches because it contains two ab blocks followed by d: B1 for the decision and B1 for the reason This row begins a shared allocation of 2 marks for the same requested result or explanation.B1
mark 2 of the same 2-mark allocation above. A complete response meeting that allocation earns every mark in the group; this row adds no separate requirement. Retain the partial-credit guidance stated in the first row of the group.B1
stating that ad does not match because it has no complete ab block although at least one is required: B1 for the decision and B1 for the reason. No further structure summary is required. This row begins a shared allocation of 2 marks for the same requested result or explanation.B1
mark 2 of the same 2-mark allocation above. A complete response meeting that allocation earns every mark in the group; this row adds no separate requirement. Retain the partial-credit guidance stated in the first row of the group.B1
Final answer: 'abd' matches, 'ababd' matches, 'ad' does not match
Mark scheme for Question 19 [5 marks]
Question 19[5 marks]
Answer or workingMarks
explaining INNER JOIN excludes students without matching enrolmentsB1
explaining LEFT JOIN retains those students, with NULL course values where unmatchedB1
selecting the requested student names and course fieldM1
using Student as the preserved side of an outer join, accepting an equivalent reversed RIGHT JOINM1
a complete valid relationship condition if a link is supplied or explicitly assumed; no linking columns are printed, so accept a justified generic link or identification of the missing relationship instead of demanding StudentIDA1
Final answer: LEFT JOIN retains every Student row and supplies NULL CourseName for no match; INNER JOIN omits those students. If the linking columns are both StudentID: SELECT s.FirstName, s.LastName, e.CourseName FROM Student s LEFT JOIN Enrolment e ON s.StudentID = e.StudentID;
Mark scheme for Question 20 [6 marks]
Question 20[6 marks]
Answer or workingMarks
reading the first cell (0) in state A, writing 0 (no change) and moving right, remaining in state AM1
reading the second cell (1) in state A, writing 0 and moving rightM1
transitioning to state B at this pointA1
reading the third cell (1) in state B, writing 1 (no change) and moving right, remaining in state BM1
reading the fourth cell (blank) in state B, writing 1 and haltingA1
the final tape contents 0, 0, 1, 1A1
Final answer: Final tape: 0, 0, 1, 1
Mark scheme for Question 21 [6 marks]
Question 21[6 marks]
Answer or workingMarks
explaining that SQL states the desired customer condition and leaves execution to the databaseB1
explaining that the Python loop specifies the reading, summing and testing stepsB1
a scenario-linked recommendation, generally SQL directly on the database; accept a sound alternativeB1
a sound developed justification linking the recommendation to the large database, such as engine-managed optimisation of filtering and aggregation near the stored data. One sufficiently developed reason earns all three marks; no separate second benefit or per-customer aggregation explanation is required. Award up to B2 for correct incomplete justification. This row begins a shared allocation of 3 marks for the same requested result or explanation.B1
mark 2 of the same 3-mark allocation above. A complete response meeting that allocation earns every mark in the group; this row adds no separate requirement. Retain the partial-credit guidance stated in the first row of the group.B1
mark 3 of the same 3-mark allocation above. A complete response meeting that allocation earns every mark in the group; this row adds no separate requirement. Retain the partial-credit guidance stated in the first row of the group.B1
Final answer: SQL is declarative (states the condition, leaves the how to the database); the Python loop is imperative (states the steps). SQL is generally preferable here since the database can use indexes to search efficiently, and the query is shorter and less error-prone
Mark scheme for Question 22 [6 marks]
Question 22[6 marks]
Answer or workingMarks
converting the file size to bits: 2,000,000 x 8 = 16,000,000 bitsM1
stating the bandwidth in bits per second: 8,000,000 bits per secondM1
dividing to find the transfer time: 16,000,000 / 8,000,000M1
a transfer time of 2 secondsA1
converting the latency to seconds (50 ms = 0.05 s) and adding it to the transfer timeM1
a total time of 2.05 secondsA1
Final answer: Transfer time = 2 seconds; total time including latency = 2 + 0.05 = 2.05 seconds
Mark scheme for Question 23 [6 marks]
Question 23[6 marks]
Answer or workingMarks
static type checking before execution, typically at compile time; types may be inferredB1
dynamic type checking at run timeB1
a scenario-linked recommendation; accept either typing approach with a sound justificationB1
a sound developed justification linking the chosen approach to the project, such as early detection of incompatible changes helping a team maintain shared code over time. One sufficiently developed reason earns all three marks; no second reason or separate trade-off is required. Award up to B2 for correct incomplete justification. This row begins a shared allocation of 3 marks for the same requested result or explanation.B1
mark 2 of the same 3-mark allocation above. A complete response meeting that allocation earns every mark in the group; this row adds no separate requirement. Retain the partial-credit guidance stated in the first row of the group.B1
mark 3 of the same 3-mark allocation above. A complete response meeting that allocation earns every mark in the group; this row adds no separate requirement. Retain the partial-credit guidance stated in the first row of the group.B1
Final answer: Static typing checks types at compile time, dynamic typing at run time; static typing is recommended here since it catches type errors early and documents expected types, which helps many developers maintain the code long-term
Mark scheme for Question 24 [6 marks]
Question 24[6 marks]
Answer or workingMarks
reading the first cell (1) in state A, writing 0 and moving right, remaining in state AM1
reading the second cell (1) in state A, writing 0 and moving right, remaining in state AM1
reading the third cell (0) in state A, writing 1 and moving rightA1
transitioning to state B at this pointA1
reading the fourth cell (blank) in state B, writing 0 and haltingM1
the final tape contents 0, 0, 1, 0A1
Final answer: Final tape: 0, 0, 1, 0
Mark scheme for Question 25 [6 marks]
Question 25[6 marks]
Answer or workingMarks
(2+1) MOD 4 = 3 != front(0)M1
enqueue(5) succeeding.A1
(3+1) MOD 4 = 0 = front(0)M1
enqueue(1) failing.A1
the final queue retaining 7,2,9 in orderA1
5 last and no 1: final queue 7,2,9,5. No additional general explanation of front=rear is required.A1
Final answer: Under the printed isFull rule: first check (2+1) MOD 4 = 3 != 0, so enqueue(5) succeeds at index 3. Next check (3+1) MOD 4 = 0 = front, so enqueue(1) fails. Final queue: 7,2,9,5.

Build a free practice pack.

Pick the topics, add the student's name and print one PDF.