AS Paper 2: Networks and Systems
Covers computer architecture, networks and how computers communicate, data representation, boolean logic and logic gates, and searching and sorting algorithms.
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 firewall monitors incoming and outgoing network traffic and decides whether to allow or block it, based on a set of security rules.
State the purpose of a firewall, and give one example of a rule a firewall might apply.
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 [3 marks]
Data Representation
Convert the hexadecimal number 2F into denary, and then into an 8-bit binary number.
Question 5 [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 6 [4 marks]
Searching and Sorting Algorithms
The list [15, 8, 42, 3, 27, 19] is searched using a linear search for the value 3, checking each element in turn starting from index 0.
State the number of comparisons made before the target is found (counting the comparison that finds it), and state the index at which it is found.
Question 7 [2 marks]
Boolean Algebra and Logic Gates
Simplify the Boolean expression Y = (NOT (NOT A)) OR (A AND A), showing each law used.
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 [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 10 [4 marks]
Networks and Communication
A network diagnostic tool called ping sends a small test message to a target device and measures the round-trip time (RTT): the time taken for a reply to come back.
A technician pings a server five times and records round-trip times of 20 ms, 22 ms, 21 ms, 95 ms and 20 ms.
Calculate the mean round-trip time, and explain why the 95 ms result might be worth investigating separately rather than simply being averaged in.
Question 11 [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 12 [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 13 [5 marks]
Searching and Sorting Algorithms
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.
Question 14 [4 marks]
Computer Architecture and the CPU
A processor without pipelining takes 4 clock cycles to fully process one instruction, and cannot start a new instruction until the previous one finishes.
A pipelined version of the same processor splits execution into 4 equal stages, so that once the pipeline is full, one instruction completes every clock cycle.
Calculate the number of clock cycles needed to fully process 10 instructions, without pipelining and with pipelining (assume the first instruction takes 4 cycles to complete, then one further instruction completes each following cycle).
State one hazard that can reduce the benefit of pipelining.
Question 15 [5 marks]
Searching and Sorting Algorithms
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).
Question 16 [5 marks]
Data Representation
An uncompressed bitmap image is 800 pixels wide and 600 pixels high, with a colour depth of 24 bits.
Calculate the uncompressed file size of the image in bytes, then in megabytes, using 1 MB = 1,000,000 bytes, giving your megabyte answer to 2 decimal places.
A lossy compression method reduces this file to 1/20 of its uncompressed size. Calculate the compressed file size in megabytes, and state one general disadvantage of lossy compression compared with lossless compression.
Question 17 [6 marks]
Searching and Sorting Algorithms
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).
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 |
| controlling permitted network traffic according to security rules. | B1 |
| one valid rule, such as blocking incoming packets from a specified source IP address or to a specified port. | B1 |
| Final answer: Apply rules to filter traffic; for example block a source IP | |
| Question 3[2 marks] | |
|---|---|
| Answer or working | Marks |
| X = 0 | A1 |
| OR producing 1 when at least one input is 1, including both | B1 |
| Final answer: X = 0; OR gives 1 when at least one operand is 1 (including both). | |
| Question 4[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 5[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 6[4 marks] | |
|---|---|
| Answer or working | Marks |
| checking index 0 (15), index 1 (8) and index 2 (42) in turn, none matching | M1 |
| finding a match at index 3, value 3 | A1 |
| stating the target is found after 4 comparisons | A1 |
| stating the index found is 3 Award all 4 marks for the complete correct requested answer: 4 comparisons; found 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. | A1 |
| Final answer: 4 comparisons; found at index 3. | |
| Question 7[2 marks] | |
|---|---|
| Answer or working | Marks |
| showing valid laws for a complete simplification, such as double negation and idempotence, or double negation and absorption | M1 |
| Y = A | A1 |
| 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. | |
| 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[3 marks] | |
|---|---|
| Answer or working | Marks |
| (NOT A) AND (NOT B), or an equivalent De Morgan expression using only AND and NOT | A1 |
| the original expression evaluating to 0 at A = 0, B = 1 | B1 |
| the equivalent expression evaluating to 0 at A = 0, B = 1 | B1 |
| Final answer: (NOT A) AND (NOT B); both sides are 0 at A = 0, B = 1. | |
| Question 10[4 marks] | |
|---|---|
| Answer or working | Marks |
| sum = 20 + 22 + 21 + 95 + 20 = 178 ms. | M1 |
| mean = 178 / 5 = 35.6 ms. | A1 |
| identifying 95 ms as unusually high relative to 20 to 22 ms and a possible transient delay. | B1 |
| explaining the high value pulls the mean away from typical results, warranting separate investigation rather than automatic exclusion. | B1 |
| Final answer: 35.6 ms; investigate the 95 ms spike without silently discarding it | |
| Question 11[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 12[4 marks] | |
|---|---|
| Answer or working | Marks |
| 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 | |
| Question 13[5 marks] | |
|---|---|
| Answer or working | Marks |
| identifying equal-grade entries as the relevant group | B1 |
| explaining that stability preserves their original relative order. Accept any equivalent valid explanation, without inventing a submission-order context. | B1 |
| applying that preservation to Alex and Casey | B1 |
| 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. | B1 |
| 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. | B1 |
| Final answer: Stability preserves the original order of equal-grade entries, keeping Alex before Casey. Standard bubble sort is stable. | |
| Question 14[4 marks] | |
|---|---|
| Answer or working | Marks |
| 10 * 4 = 40 cycles without pipelining. | M1 |
| using 4 + (10 - 1) to include pipeline fill and the remaining completions; accept an equivalent timing diagram. | M1 |
| 13 cycles with pipelining. | A1 |
| stating one valid pipeline hazard, such as a data hazard or a control hazard; no explanation is required. | B1 |
| Final answer: 40 cycles without pipelining, 13 cycles with pipelining; a data or control hazard can reduce the benefit | |
| Question 15[5 marks] | |
|---|---|
| Answer or working | Marks |
| identifying the middle element (index 2), value 15, as the pivot | M1 |
| comparing each remaining element, 10, 4, 2, 8, 12, against the pivot value 15 | M1 |
| recognising every one of these elements is smaller than 15 | A1 |
| concluding no elements belong after the pivot, so the pivot moves to the last index, index 5 | A1 |
| 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. | B1 |
| Final answer: Before pivot: [10,4,2,8,12]; pivot 15 at index 5; after pivot: []. | |
| Question 16[5 marks] | |
|---|---|
| Answer or working | Marks |
| 800 * 600 = 480000 pixels. | M1 |
| 480000 * 24 / 8 = 1440000 bytes = 1.44 MB. | A1 |
| dividing the uncompressed size by 20. | M1 |
| 0.072 MB compressed. | A1 |
| stating one valid disadvantage of lossy compression, such as irreversible information loss, inability to restore the exact original, or possible visible quality degradation; no additional explanation is required. | B1 |
| Final answer: 1440000 bytes; 1.44 MB; compressed 0.072 MB; irreversible loss | |
| Question 17[6 marks] | |
|---|---|
| Answer or working | Marks |
| comparing each remaining element with the pivot 6 in turn | M1 |
| identifying the elements smaller than 6, in original order, as 2, 1, 3 | M1 |
| identifying the elements larger than or equal to 6, in original order, as 9, 8 | A1 |
| placing the smaller elements before the pivot and the larger elements after it | M1 |
| the pivot 6 ending at index 3 | A1 |
| 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. | A1 |
| Final answer: Before pivot: [2,1,3]; after pivot: [9,8]. Pivot 6 finishes at index 3. | |