A Level Paper 3: Computer Systems
Covers data representation, computer architecture, networks, boolean logic and logic gates, and databases and SQL.
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
A LAN (Local Area Network) covers a small geographical area, such as a single building. A WAN (Wide Area Network) covers a much larger geographical area, such as a whole country or the world.
Give one example of a LAN and one example of a WAN.
Question 3 [2 marks]
Boolean Algebra and Logic Gates
State the output of the logic expression A AND B for each of the four possible combinations of A and B (each 0 or 1).
Question 4 [3 marks]
Data Representation
A simple text system needs to represent every uppercase letter of the English alphabet (26 letters) plus the 10 digits 0-9, and no other characters.
Calculate the minimum number of bits needed to represent every character in this set uniquely.
Question 5 [3 marks]
Computer Architecture and the CPU
State the purpose of the Control Unit (CU) and the Arithmetic Logic Unit (ALU) within a CPU, and state which of the two directs the fetch-decode-execute cycle.
Question 6 [3 marks]
Databases and SQL
A database table Student has columns StudentID, FirstName, LastName and YearGroup.
Write an SQL statement to update the YearGroup to 13 for the student whose StudentID is 1042.
Question 7 [1 mark]
Computer Architecture and the CPU
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.
Question 8 [3 marks]
Networks and Communication
In the client-server model, a web browser (the client) requests a web page from a web server.
Describe the roles of the client and the server in this exchange, and state one advantage of the client-server model over a peer-to-peer model for a busy website.
Question 9 [2 marks]
Computer Architecture and the CPU
A RISC (Reduced Instruction Set Computer) processor has a small set of simple instructions, each usually completing in one clock cycle. A CISC (Complex Instruction Set Computer) processor has a larger set of instructions, some of which are complex and take multiple clock cycles to complete.
State one advantage RISC has over CISC, and one advantage CISC has over RISC.
Question 10 [3 marks]
Databases and SQL
A single unnormalised table stores order data with columns OrderID, CustomerName and a Products column that holds a comma-separated list of every product ordered, such as 'Pen, Ruler, Eraser'.
Explain why this table does not satisfy First Normal Form (1NF), and describe the change needed to bring it into 1NF.
Question 11 [4 marks]
Networks and Communication
TCP (Transmission Control Protocol) provides reliable, ordered delivery using acknowledgements and retransmission, while a connection remains viable, while UDP (User Datagram Protocol) sends data with no such guarantee, but with less overhead.
State one type of application that would suit TCP and one that would suit UDP, justifying each choice.
Question 12 [4 marks]
Computer Architecture and the CPU
A program consists of 5,000,000 instructions. On a particular processor, each instruction takes an average of 3 clock cycles to complete, and the processor runs at a clock speed of 2.5 GHz (2,500,000,000 cycles per second).
Calculate the total number of clock cycles needed to run the program, and hence the total execution time in seconds.
Question 13 [4 marks]
Data Representation
Two 8-bit unsigned binary numbers, 11001101 and 00111010, are added together using binary addition.
Show the result of the addition, and state whether an overflow has occurred, given that an 8-bit unsigned number can hold values from 0 to 255.
Question 14 [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 15 [2 marks]
Boolean Algebra and Logic Gates
A logic circuit has inputs A, B and C, and its output Z is 1 for exactly these combinations: A = 0, B = 0, C = 1; A = 0, B = 1, C = 1; and A = 1, B = 1, C = 1. Z is 0 for every other combination.
Write the Boolean expression for Z as a sum of products (before simplification), then simplify it to its shortest form.
Question 16 [5 marks]
Data Representation
A two's complement representation using n bits can represent integers from -(2^(n-1)) to (2^(n-1)) - 1.
State the range of values that can be represented using 10-bit two's complement, and explain why the range is not symmetrical (there is one more negative value than there are positive values).
Question 17 [2 marks]
Boolean Algebra and Logic Gates
A logic circuit has inputs A, B and C, and its output Z is 1 for exactly these combinations: A = 1, B = 0, C = 0 and A = 1, B = 0, C = 1, and Z is 0 for every other combination.
Write the Boolean expression for Z as a sum of products (before simplification), then simplify it to its shortest form.
Question 18 [3 marks]
Networks and Communication
A network switch forwards frames using MAC addresses, while a router forwards packets between networks using IP addresses.
Explain the difference in purpose between a MAC address and an IP address, and explain why global uniqueness of an interface identifier alone would not provide the network-location information needed for efficient routing across the internet.
Question 19 [2 marks]
Boolean Algebra and Logic Gates
A logic circuit has inputs A, B and C, and its output Z is 1 for exactly these combinations: A = 0, B = 1, C = 1 and A = 1, B = 1, C = 1, and Z is 0 for every other combination.
Write the Boolean expression for Z as a sum of products (before simplification), then simplify it to its shortest form.
Question 20 [6 marks]
Computer Architecture and the CPU
A program takes 20 seconds to run on a single-core processor. 75% of this time is spent in a section of code that can be perfectly split across multiple cores; the remaining 25% must run on a single core no matter how many cores are available.
Calculate the time taken to run the parallelisable section on 4 cores (assuming perfect division of work), and hence calculate the total running time on 4 cores.
Explain why simply adding more cores does not continue to give a proportional speed-up.
Model solutions
| Question 1[1 mark] | |
|---|---|
| Answer or working | Marks |
| X = 1; correct output alone earns full credit | A1 |
| Final answer: X = 1. | |
| Question 2[2 marks] | |
|---|---|
| Answer or working | Marks |
| a valid LAN example, such as the network inside a single school or office building | B1 |
| a valid WAN example, such as the internet, or a company's network connecting offices in different cities | B1 |
| Final answer: LAN example: a school's internal network; WAN example: the internet | |
| Question 3[2 marks] | |
|---|---|
| Answer or working | Marks |
| the labelled rows 00 -> 0 and 01 -> 0 | B1 |
| the labelled rows 10 -> 0 and 11 -> 1 | B1 |
| Final answer: 00 -> 0; 01 -> 0; 10 -> 0; 11 -> 1. | |
| Question 4[3 marks] | |
|---|---|
| Answer or working | Marks |
| the total number of characters needed: 26 + 10 = 36 | M1 |
| recognising the number of bits, b, must satisfy 2^b >= 36 | M1 |
| 6 bits, since 2^5 = 32 is not enough but 2^6 = 64 is | A1 |
| Final answer: 6 bits (2^5 = 32 is too few, but 2^6 = 64 is enough for 36 characters) | |
| Question 5[3 marks] | |
|---|---|
| Answer or working | Marks |
| the CU coordinating CPU operations, decoding instructions or issuing control signals. | B1 |
| the ALU performing arithmetic and logical operations. | B1 |
| identifying the CU as directing the fetch-decode-execute cycle. | B1 |
| Final answer: CU coordinates and directs fetch-decode-execute; ALU performs arithmetic and logic | |
| Question 6[3 marks] | |
|---|---|
| Answer or working | Marks |
| UPDATE Student | M1 |
| SET YearGroup = 13 | M1 |
| restricting the update with WHERE StudentID = 1042 or an equivalent predicate | A1 |
| Final answer: UPDATE Student SET YearGroup = 13 WHERE StudentID = 1042; | |
| Question 7[1 mark] | |
|---|---|
| Answer or working | Marks |
| 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. | B1 |
| Final answer: Registers are much more expensive per byte than RAM. | |
| Question 8[3 marks] | |
|---|---|
| Answer or working | Marks |
| describing the client's role, such as sending a request for a resource, for example an HTTP request for a page | B1 |
| describing the server's role, such as receiving the request, processing it and returning the requested resource | B1 |
| a valid advantage, such as centralised control and management of data and security, or resources being easier to back up when kept in one place | B1 |
| Final answer: The client requests a resource; the server processes the request and returns it. Client-server gives centralised control of data and security | |
| Question 9[2 marks] | |
|---|---|
| Answer or working | Marks |
| one valid RISC advantage, such as regular simple instructions being easier to pipeline; accept a suitably qualified implementation-dependent advantage. | B1 |
| one valid CISC advantage, such as a complex instruction doing work that needs several simpler instructions, potentially reducing instruction count or code size. | B1 |
| Final answer: RISC can pipeline simple regular instructions efficiently; CISC may express work in fewer instructions | |
| Question 10[3 marks] | |
|---|---|
| Answer or working | Marks |
| explaining that Products contains multiple product values in one field, violating the atomic-value requirement of 1NF | B1 |
| placing each product occurrence in a separate row, in the original relation or an order-product relation | M1 |
| retaining the OrderID and associated customer facts when separating the product rows; no invented quantity or identifier is required | A1 |
| Final answer: Products contains a repeating group, not one atomic product per field. Store one product per order-product row, retaining its OrderID; use a suitable key to identify each such row. | |
| Question 11[4 marks] | |
|---|---|
| Answer or working | Marks |
| a valid TCP application, such as file transfer. | B1 |
| linking that choice to complete, ordered delivery and retransmission. | B1 |
| a valid UDP application, such as interactive voice. | B1 |
| linking that choice to low delay, avoiding retransmission waits or lower overhead, where occasional missing data can be tolerated. | B1 |
| Final answer: TCP for file transfer requiring complete ordered data; UDP for interactive voice prioritising timely delivery | |
| Question 12[4 marks] | |
|---|---|
| Answer or working | Marks |
| calculating instructions * cycles per instruction: 5000000 * 3. | M1 |
| 15000000 cycles. | A1 |
| dividing total cycles by 2500000000 cycles/s. | M1 |
| 0.006 seconds; accept 6 milliseconds. | A1 |
| Final answer: 15000000 cycles; 0.006 s = 6 ms | |
| Question 13[4 marks] | |
|---|---|
| Answer or working | Marks |
| converting each operand to denary (or working directly in binary): 205 and 58 | M1 |
| correctly computing the sum as 263 | M1 |
| binary 100000111; accept 00000111 with carry-out 1 as an equivalent representation of the full sum. | A1 |
| stating that an overflow has therefore occurred | A1 |
| Final answer: 205 + 58 = 263, needing 9 bits; this overflows an 8-bit register, which would incorrectly hold 00000111 (7) | |
| Question 14[5 marks] | |
|---|---|
| Answer or working | Marks |
| explaining INNER JOIN excludes students without matching enrolments | B1 |
| explaining LEFT JOIN retains those students, with NULL course values where unmatched | B1 |
| selecting the requested student names and course field | M1 |
| using Student as the preserved side of an outer join, accepting an equivalent reversed RIGHT JOIN | M1 |
| 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 StudentID | A1 |
| 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; | |
| Question 15[2 marks] | |
|---|---|
| Answer or working | Marks |
| the unsimplified sum of products (NOT A AND NOT B AND C) OR (NOT A AND B AND C) OR (A AND B AND C), accepting reordered terms | M1 |
| C AND (NOT A OR B), or an equivalent minimal expression; no separate derivation is requested | A1 |
| Final answer: Z = ((NOT A) AND (NOT B) AND C) OR ((NOT A) AND B AND C) OR (A AND B AND C) = C AND ((NOT A) OR B). | |
| Question 16[5 marks] | |
|---|---|
| Answer or working | Marks |
| substituting n = 10 to obtain -(2^9) and 2^9 - 1. | M1 |
| -512 to 511 inclusive. | A1 |
| 512 patterns with sign bit 0 and 512 with sign bit 1. | B1 |
| zero occupying one non-negative code, leaving only 511 positive values. | B1 |
| all 512 negative codes representing negative values, reaching -512 without reserving a second zero code. | B1 |
| Final answer: -512 to 511 inclusive | |
| Question 17[2 marks] | |
|---|---|
| Answer or working | Marks |
| the unsimplified sum of products (A AND NOT B AND NOT C) OR (A AND NOT B AND C), accepting reordered terms | M1 |
| the shortest expression A AND NOT B; no separate derivation is requested | A1 |
| Final answer: Z = (A AND (NOT B) AND (NOT C)) OR (A AND (NOT B) AND C) = A AND (NOT B). | |
| Question 18[3 marks] | |
|---|---|
| Answer or working | Marks |
| MAC addressing identifying a network interface for local frame delivery; do not require addresses to be permanently fixed or universally unique. | B1 |
| IP being logical addressing used for delivery across networks. | B1 |
| explaining IP network prefixes support route selection, whereas global uniqueness alone supplies no such location structure. | B1 |
| Final answer: MAC identifies an interface for local frame delivery; IP supplies hierarchical routing information across networks | |
| Question 19[2 marks] | |
|---|---|
| Answer or working | Marks |
| the unsimplified sum of products ((NOT A) AND B AND C) OR (A AND B AND C), accepting reordered terms | M1 |
| the shortest expression B AND C; no separate derivation is requested | A1 |
| Final answer: Z = ((NOT A) AND B AND C) OR (A AND B AND C) = B AND C. | |
| Question 20[6 marks] | |
|---|---|
| Answer or working | Marks |
| identifying the parallelisable time as 0.75 x 20 = 15 seconds | M1 |
| identifying the fixed serial time as 0.25 x 20 = 5 seconds | M1 |
| the parallel section on 4 cores taking 15 / 4 = 3.75 seconds | A1 |
| the total running time = 5 + 3.75 = 8.75 seconds | A1 |
| explaining the serial 25% cannot be sped up regardless of the number of cores, so it places a floor under the total time | B1 |
| explaining more cores only speed up the parallel portion, so as core count grows the fixed serial section increasingly dominates and the overall speed-up falls further behind the number of cores added | B1 |
| Final answer: Parallel section on 4 cores: 3.75 s; total time: 8.75 s. The fixed 25% serial portion cannot be sped up by more cores, so the overall speed-up is far less than 4x | |