Year 10 Paper 2: Software and Networks
Covers binary and hexadecimal number systems, logic gates and boolean logic, operating systems and utility software, networks, topologies and protocols, programming constructs, and algorithm design and trace tables.
Year 10 follows a typical teaching order. No exam board defines what belongs to Year 10, and schools sequence the course differently. Check it against your own scheme of work before using it to decide what a class has covered.
Questions
Question 1 [1 mark]
Networks, Topologies and Protocols
A network engineer explains that every device on a network has both a MAC address and, usually, an IP address.
State one difference between a MAC address and an IP address.
Question 2 [2 marks]
Algorithm Design and Trace Tables
The following pseudocode is run, in order:
count = 10
count = count - 3
count = count - 2
State count after each assignment, including its final value.
Question 3 [2 marks]
Operating Systems and Utility Software
A student compares two utility software programs: encryption software and disk cleanup software.
State the purpose of each of these two utility programs.
Question 4 [3 marks]
Networks, Topologies and Protocols
A school connects its computers together within one building. The school also connects to a cloud server based in another country over the internet.
Identify which of these two connections is a LAN and which is a WAN, and give one reason for your choice.
Question 5 [3 marks]
Number Systems: Binary and Hexadecimal
Convert the 8-bit binary number 00101101 into denary.
Question 6 [4 marks]
Programming Constructs
A program needs to check the length of a string entered by the user, for example to check a password is at least 8 characters long.
Name a common built-in string length function and explain what it returns. State its result for "computer". Write the condition to test whether a password has at least 8 characters.
Question 7 [2 marks]
Networks, Topologies and Protocols
An office with 30 computers is comparing a star topology with a bus topology for its network.
State one advantage of a star topology over a bus topology, and one advantage of a bus topology over a star topology, for this office.
Question 8 [3 marks]
Number Systems: Binary and Hexadecimal
A logical shift right by 3 places is applied to the 8-bit binary number 01101000, with zeros filling the empty places on the left.
State the resulting 8-bit binary number, and state the denary value of the number both before and after the shift.
Question 9 [3 marks]
Operating Systems and Utility Software
A computer runs slowly, and its owner is told this might be improved by using utility software.
Describe the purpose of utility software, giving two examples with a brief description of what each one does.
Question 10 [4 marks]
Boolean Logic and Logic Gates
A NAND gate has two inputs, C and D, and its output is the opposite of what an AND gate would give for the same inputs.
Write a Boolean expression for the NAND gate's output using C and D, and state its output when C=1 and D=1.
Question 11 [4 marks]
Networks, Topologies and Protocols
A user sends a large file across the internet to a friend.
Explain the roles that the IP protocol and the TCP protocol play in getting the file to its destination.
Question 12 [4 marks]
Operating Systems and Utility Software
Two operating systems are compared: one uses a graphical user interface (GUI) and the other uses a command line interface (CLI).
Explain one advantage and one disadvantage of a GUI compared with a CLI.
Question 13 [5 marks]
Programming Constructs
A programmer's code reads a number from the user as a string, and needs to convert it into an integer before doing a calculation. Later, the program needs to convert a calculated integer total back into a string so it can be joined with other text and displayed.
Explain why both of these conversions (casting) are needed, referring to what would go wrong without each one.
Question 14 [6 marks]
Algorithm Design and Trace Tables
Two programmers write different algorithms to check whether any two numbers in a list of n numbers add up to a target value. Algorithm A compares every possible pair of numbers in the list, one pair at a time. Algorithm B first sorts the list, then uses a smarter method that only needs to look through the list once more after sorting.
Discuss why Algorithm B is likely to be more efficient than Algorithm A for a very large list, even though it must sort the list first.
Question 15 [4 marks]
Boolean Logic and Logic Gates
A logic circuit implements the expression (A AND B) OR (A AND C).
Simplify this expression using a Boolean identity, name the identity used, and explain what the simplified expression means in terms of A, B and C.
Question 16 [6 marks]
Networks, Topologies and Protocols
A data centre needs an extremely reliable network, where the failure of any single connection must not disconnect any server.
Discuss whether a full mesh topology or a star topology would better meet this requirement, referring to reliability and cost.
Question 17 [4 marks]
Boolean Logic and Logic Gates
A warning light in a factory should switch on when a machine's temperature sensor detects an unsafe temperature (T) or its pressure sensor detects unsafe pressure (P), but only while the machine's power is switched on (M); if the machine's power is off, the light should never switch on, even if T or P would otherwise trigger it.
Write a Boolean expression for light using T, P and M, and state whether the light switches on when T=1, P=0 and M=0.
Model solutions
| Question 1[1 mark] | |
|---|---|
| Answer or working | Marks |
| one accurate paired distinction, for example MAC addresses identify interfaces on the local link whereas IP addresses are logical addresses used to route between networks; alternatively credit a normally hardware-assigned MAC versus a network-assigned/changeable IP, without requiring permanence | B1 |
| Final answer: A MAC address identifies a network interface for local-link delivery; an IP address is a logical address used for routing between networks. MAC addresses can be changed/spoofed. One valid paired difference is sufficient. | |
| Question 2[2 marks] | |
|---|---|
| Answer or working | Marks |
| After subtracting 3 count is 7 | M1 |
| After subtracting 2 count is 5 | A1 |
| Final answer: The final value is 5. count starts at 10, becomes 7 after subtracting 3 and becomes 5 after subtracting 2. | |
| Question 3[2 marks] | |
|---|---|
| Answer or working | Marks |
| encryption converts plaintext to ciphertext requiring the appropriate key to read, protecting confidentiality | B1 |
| disk cleanup removes unnecessary/temporary files to reclaim storage space | B1 |
| Final answer: Encryption software transforms plaintext to ciphertext readable with the appropriate key, protecting confidentiality. Disk cleanup removes unneeded/temporary files to reclaim storage space; it does not generally defragment or guarantee faster CPU execution. | |
| Question 4[3 marks] | |
|---|---|
| Answer or working | Marks |
| the connection within the school building is a LAN (local area network) | B1 |
| the connection to the cloud server in another country is a WAN (wide area network) | B1 |
| reason: a LAN covers a small, single geographic site, whereas a WAN spans a much larger geographic area, often using infrastructure the school does not own | B1 |
| Final answer: Within the building: LAN. To the overseas cloud server: WAN | |
| Question 5[3 marks] | |
|---|---|
| Answer or working | Marks |
| identifying the place values of each 1 bit: 32, 8, 4 and 1 | M1 |
| correctly adding these place values together | M1 |
| 45 | A1 |
| Question 6[4 marks] | |
|---|---|
| Answer or working | Marks |
| Name length or len as the built-in function | B1 |
| Function counts characters in a string | B1 |
| length("computer") returns 8 | B1 |
| Minimum-length condition is length(password) >= 8 | B1 |
| Final answer: A common function name is length (or len in some languages). It returns the number of characters. length("computer") is 8, so a password with that length meets a minimum-length test of length(password) >= 8. | |
| Question 7[2 marks] | |
|---|---|
| Answer or working | Marks |
| one valid stated star-over-bus advantage, such as a workstation-link failure not affecting other workstations, easier fault isolation or fewer shared-backbone collisions; do not require a separate explanation | B1 |
| one valid stated bus-over-star advantage, such as less installation cabling/cost for a suitable layout or no need to buy a central switch; do not require a separate explanation | B1 |
| Final answer: Star: an individual workstation-link failure leaves the other links usable. Bus: shared backbone cabling and no central switch can reduce installation cost. A star central-switch failure remains a network-wide risk. | |
| Question 8[3 marks] | |
|---|---|
| Answer or working | Marks |
| Resulting binary number 00001101. | B1 |
| Denary value before: 104. | B1 |
| Denary value after: 13. | B1 |
| Final answer: 00001101; denary value before: 104, after: 13 (divided by 8) | |
| Question 9[3 marks] | |
|---|---|
| Answer or working | Marks |
| utilities maintain, protect or optimise the computer system | B1 |
| one named utility with its correct purpose, such as HDD defragmentation placing file blocks together to reduce seeking | B1 |
| a second distinct named utility with its correct purpose, such as anti-malware detecting/quarantining malicious code; accept other relevant utilities | B1 |
| Final answer: Utilities maintain/protect/optimise the system. Disk cleanup removes unnecessary files to free space; anti-malware scans for and removes/quarantines malicious code. HDD defragmentation, backup, encryption and compression are valid alternatives with correct purposes. | |
| Question 10[4 marks] | |
|---|---|
| Answer or working | Marks |
| Combines C and D with AND, or uses an equivalent De Morgan form. | M1 |
| Negates the whole conjunction: NOT (C AND D), accepting NOT C OR NOT D. | M1 |
| Evaluates C AND D as 1 for C=D=1, or correctly substitutes into an equivalent expression. | M1 |
| Gives output 0; full evaluation credit for the correct stated output. | A1 |
| Final answer: output = NOT (C AND D); with C=1, D=1 the output is 0 | |
| Question 11[4 marks] | |
|---|---|
| Answer or working | Marks |
| IP supplies source/destination addressing and routing of packets between networks | B1 |
| TCP divides the byte stream into segments and uses sequence information | B1 |
| TCP acknowledgements/retransmission provide reliable delivery when data is missing | B1 |
| TCP uses sequence information to deliver/reassemble the byte stream in order | B1 |
| Final answer: IP addresses and routes packets between networks. TCP segments the byte stream, tracks sequence, uses acknowledgements/retransmission and delivers data in order. | |
| Question 12[4 marks] | |
|---|---|
| Answer or working | Marks |
| one GUI advantage over CLI, such as visible menus/icons avoiding memorised syntax | B1 |
| develops that advantage, such as less training for beginners | B1 |
| one GUI disadvantage over CLI, such as greater RAM/processing demand | B1 |
| develops that disadvantage, such as fewer resources left for applications on limited hardware; accept a slower repetitive-workflow comparison with a linked explanation | B1 |
| Final answer: Visible menus/icons reduce the need to learn commands and can reduce beginner training. A GUI typically needs more memory/processing, leaving fewer resources on limited hardware. Accept another developed advantage/disadvantage pair. | |
| Question 13[5 marks] | |
|---|---|
| Answer or working | Marks |
| Numeric input initially has string type | B1 |
| Casting to integer enables numeric arithmetic | B1 |
| Without casting addition may concatenate or raise a type error | B1 |
| Cast integer total to string for text concatenation | B1 |
| Without a supported implicit conversion mixed-type concatenation may fail | B1 |
| Final answer: Cast numeric input text to an integer so arithmetic uses its numerical value: int("12") + 3 is 15. Without conversion a language may concatenate to form "123" or raise a type error. Cast a calculated total back with str(total) when joining it to text, for example "Total: " + str(15) gives "Total: 15"; a language without implicit conversion may otherwise reject the mixed types. Exact behaviour depends on the language. | |
| Question 14[6 marks] | |
|---|---|
| Answer or working | Marks |
| A has n(n-1)/2 unordered distinct-index pairs | B1 |
| A therefore has quadratic growth O(n^2) | B1 |
| An efficient comparison sort costs O(n log n) | B1 |
| B adds a linear O(n) scan | B1 |
| Combined O(n log n) grows more slowly for large n | B1 |
| Conclusion depends on an efficient sort and enough data to outweigh overhead | B1 |
| Final answer: A examines n(n-1)/2 distinct unordered pairs, so work is O(n^2). If B uses an O(n log n) sort such as merge sort, its additional one-pass scan costs O(n); the sum is O(n log n). Quadratic growth eventually dominates n log n, so B is likely faster on very large lists despite the sorting overhead. The result depends on sorting method and input size: a quadratic sort can remove that advantage, and constants may favour A on small lists. | |
| Question 15[4 marks] | |
|---|---|
| Answer or working | Marks |
| Factors the shared A from the two conjunctions, or demonstrates an equivalent valid simplification. | M1 |
| A AND (B OR C), accepting equivalent notation; a correct final expression earns the method mark. | A1 |
| Names the distributive law. | B1 |
| Explains that A must be 1 and at least one of B or C must also be 1. | B1 |
| Final answer: A AND (B OR C), using the distributive law; the output is 1 only when A is 1 and at least one of B or C is 1, using fewer gates than the original | |
| Question 16[6 marks] | |
|---|---|
| Answer or working | Marks |
| full mesh directly connects every server to every other server | B1 |
| with at least three nodes and working routing, alternate paths preserve connectivity after one link fails | B1 |
| an ordinary star gives each server one link to the centre, so failure of that link isolates that server | B1 |
| the central switch is also a single point of failure in an ordinary star | B1 |
| full mesh needs many links/ports, n(n-1)/2 for n nodes, raising cost and complexity | B1 |
| justified choice favours mesh for the stated single-link resilience despite its cost, or an equivalently redundant design | B1 |
| Final answer: For at least three servers, a routed full mesh survives a single link failure through alternative paths; a basic star can isolate a server when its sole link fails. Mesh costs more links/ports, but reliability is the stated priority. | |
| Question 17[4 marks] | |
|---|---|
| Answer or working | Marks |
| Combines T and P with OR. | M1 |
| Makes M a condition on the whole sensor expression: (T OR P) AND M, or equivalent. | M1 |
| Substitutes (1 OR 0) AND 0, or recognises that M=0 forces the final AND output to 0. | M1 |
| Output 0, so the light stays off; full evaluation credit for the correct conclusion. | A1 |
| Final answer: light = (T OR P) AND M; with T=1, P=0, M=0 the light does not switch on, because M=0 overrides the sensors | |