A Level Computer Science Short Paper B
Covers Data Representation, Computer Architecture and the CPU, Networks and Communication and 3 more.
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 [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 3 [3 marks]
Data Representation
Convert the hexadecimal number 2F into denary, and then into an 8-bit binary number.
Question 4 [4 marks]
Programming: Trace, Write and Explain
The following pseudocode is executed:
count = 10, total = 0 ; WHILE count > 5: total = total + count, count = count - 1 ; ENDWHILE ; OUTPUT total
Complete a trace of the values of count and total after each iteration of the loop, and state the value output.
Question 5 [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 6 [2 marks]
Networks and Communication
A school is deciding whether to connect its computer suite to the network using wired Ethernet cables or a wireless (Wi-Fi) connection.
State one advantage of the wired connection and one advantage of the wireless connection for this scenario.
Question 7 [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 8 [3 marks]
Boolean Algebra and Logic Gates
A NAND gate combines AND and NOT: its output is the opposite of what an AND gate would give for the same inputs.
Write the complete truth table for X = A NAND B for all four combinations of A and B, and write an equivalent expression for X using AND and NOT.
Question 9 [4 marks]
Data Representation
A black and white image row is stored as a sequence of 24 pixels: 18 white pixels followed by 6 black pixels. Run-length encoding (RLE) stores this as a sequence of (colour, count) pairs instead of one value per pixel.
State the RLE encoding of this row, and calculate the compression ratio achieved (uncompressed size : compressed size), given that each uncompressed pixel needs 1 bit and each RLE pair needs 9 bits (1 bit for colour, 8 bits for count).
Question 10 [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 11 [4 marks]
Networks and Communication
A website uses HTTPS, which relies on encryption to protect data sent between a browser and the server.
Explain the difference between symmetric and asymmetric encryption, and state why a combination of both is often used when establishing a secure connection.
Question 12 [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 13 [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.
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[3 marks] | |
|---|---|
| Answer or working | Marks |
| the address bus - carries the memory address the CPU wants to read from or write to | B1 |
| 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 transfer | B1 |
| Final answer: Address bus: carries the memory address; data bus: carries the data itself; control bus: carries signals that coordinate the transfer | |
| Question 3[3 marks] | |
|---|---|
| Answer or working | Marks |
| converting each hex digit to decimal: 2 = 2, F = 15 | M1 |
| denary 47 (2 x 16 + 15) | A1 |
| 8-bit binary 00101111 | A1 |
| Final answer: Denary 47, binary 00101111 | |
| Question 4[4 marks] | |
|---|---|
| Answer or working | Marks |
| post-iteration (count,total) pairs (9,10) and (8,19) | M1 |
| post-iteration pairs (7,27) and (6,34) | M1 |
| post-iteration pair (5,40), then loop exit | A1 |
| output 40 | A1 |
| Final answer: (count,total): (9,10), (8,19), (7,27), (6,34), (5,40); output 40. | |
| Question 5[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 6[2 marks] | |
|---|---|
| Answer or working | Marks |
| one valid contextual wired advantage, such as less radio interference and more reliable fixed-desktop connections. | B1 |
| one valid contextual wireless advantage, such as mobility within coverage or avoiding cables to each desk; do not require multiple advantages. | B1 |
| Final answer: Wired can be more reliable in a fixed suite; wireless allows mobility without a cable to every desk | |
| Question 7[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 8[3 marks] | |
|---|---|
| Answer or working | Marks |
| the labelled rows 00 -> 1 and 01 -> 1 | B1 |
| the labelled rows 10 -> 1 and 11 -> 0 | B1 |
| NOT (A AND B), or an equivalent expression using AND and NOT | A1 |
| Final answer: 00 -> 1; 01 -> 1; 10 -> 1; 11 -> 0. X = NOT (A AND B). | |
| Question 9[4 marks] | |
|---|---|
| Answer or working | Marks |
| (white, 18), (black, 6), in that order; accept a clearly labelled equivalent notation. | M1 |
| the original size 24 * 1 = 24 bits. | M1 |
| the encoded size 2 * 9 = 18 bits. | M1 |
| original:compressed = 4:3, or an explicitly labelled equivalent ratio such as compressed/original = 0.75. | A1 |
| Final answer: (white,18), (black,6); original:compressed = 4:3 | |
| Question 10[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 11[4 marks] | |
|---|---|
| Answer or working | Marks |
| symmetric encryption using a shared secret key. | B1 |
| asymmetric cryptography using a related public/private key pair with the private key kept secret. | B1 |
| public-key mechanisms allowing secure establishment of shared session keys, with authentication; accept the simplified public-key transport example without requiring it as the only mechanism. | B1 |
| symmetric encryption being efficient for bulk data transfer. | B1 |
| Final answer: Symmetric uses a shared secret; asymmetric uses a related public/private pair; establish keys securely then use efficient symmetric bulk encryption | |
| Question 12[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 13[6 marks] | |
|---|---|
| Answer or working | Marks |
| converting the file size to bits: 2,000,000 x 8 = 16,000,000 bits | M1 |
| stating the bandwidth in bits per second: 8,000,000 bits per second | M1 |
| dividing to find the transfer time: 16,000,000 / 8,000,000 | M1 |
| a transfer time of 2 seconds | A1 |
| converting the latency to seconds (50 ms = 0.05 s) and adding it to the transfer time | M1 |
| a total time of 2.05 seconds | A1 |
| Final answer: Transfer time = 2 seconds; total time including latency = 2 + 0.05 = 2.05 seconds | |