Year 11 Paper 6: Revision Mix
Covers the CPU and the fetch-execute cycle, binary and hexadecimal number systems, logic gates and boolean logic, operating systems and utility software, algorithm design and trace tables, ethics, law and environmental impact, searching and sorting algorithms, and representing text, images, sound and compression.
Year 11 follows a typical teaching order. No exam board defines what belongs to Year 11, 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 [2 marks]
Representing Text, Images, Sound and Compression
A student is learning the basic units used to measure data.
State what is meant by a bit, and what is meant by a byte.
Question 2 [2 marks]
CPU and the Fetch-Execute Cycle
A computer system uses three buses to connect the CPU to memory: the address bus, the data bus and the control bus.
State the purpose of the address bus and the purpose of the data bus.
Question 3 [3 marks]
Algorithm Design and Trace Tables
The following pseudocode is run:
for i = 1 to 4
print i * 2
next i
State each value of i and its corresponding output, in order. The for loop includes both endpoint values.
Question 4 [3 marks]
Boolean Logic and Logic Gates
An AND gate has two inputs, A and B.
State the output of the AND gate for each of these input combinations: A=0,B=0 ; A=0,B=1 ; A=1,B=1.
Question 5 [3 marks]
Searching and Sorting Algorithms
A bubble sort compares each pair of adjacent items in a list, one pass at a time.
For an ascending bubble sort, describe what happens when two adjacent items are compared, covering both an out-of-order pair and a pair already in order.
Question 6 [3 marks]
Number Systems: Binary and Hexadecimal
Convert the 8-bit binary number 01011010 into denary.
Question 7 [3 marks]
Operating Systems and Utility Software
A user sends three documents to be printed one after another on a shared office printer, while continuing to work on other tasks on their computer.
Explain how print spooling allows this to happen.
Question 8 [4 marks]
Ethics, Law and Environmental Impact
The UK GDPR sets out principles for how personal data must be handled.
State four principles that organisations must follow when processing personal data under the UK GDPR.
Question 9 [2 marks]
Number Systems: Binary and Hexadecimal
Subtract the 8-bit binary number 00011010 from the 8-bit binary number 01000101, giving your answer as an 8-bit binary number.
Question 10 [2 marks]
Boolean Logic and Logic Gates
A logic circuit has two inputs, A and B, and its truth table is: A=0,B=0 gives output 0 ; A=0,B=1 gives output 1 ; A=1,B=0 gives output 1 ; A=1,B=1 gives output 0.
State the name of the single logic gate that matches this truth table, and write the Boolean expression for its output using A and B.
Question 11 [3 marks]
Ethics, Law and Environmental Impact
A student named Aisha copies several images from a website and uses them in a school project without permission or acknowledgement.
Identify which piece of legislation this relates to, and explain the ethical issue involved.
Question 12 [3 marks]
Boolean Logic and Logic Gates
The Boolean expression NOT (NOT A AND NOT B) is to be simplified.
Simplify this expression using a Boolean identity, and name the identity used.
Question 13 [4 marks]
Ethics, Law and Environmental Impact
A large company runs thousands of servers in a data centre to provide its cloud services.
Discuss the environmental impact of running a large data centre, and state one way the impact could be reduced.
Question 14 [4 marks]
Searching and Sorting Algorithms
The list [8, 3, 6, 1] is sorted into ascending order using a bubble sort.
Use ascending, left-to-right passes comparing adjacent pairs; each pass starts at the first item. State the complete list after each pass until it first becomes sorted. Also state which item reaches its final position during pass 1 and how it gets there. Do not include a final no-swap confirmation pass.
Question 15 [4 marks]
Ethics, Law and Environmental Impact
Self-driving (autonomous) cars use software to make decisions in situations that could involve unavoidable harm, for example choosing between two possible collisions.
Discuss the ethical issue this raises around who is responsible if the software makes the wrong decision.
Question 16 [4 marks]
Operating Systems and Utility Software
A computer with only 4 GB of RAM is running several applications at the same time.
Explain how the operating system's memory management allows this to happen.
Question 17 [4 marks]
Boolean Logic and Logic Gates
A fire alarm sounds when a smoke sensor detects smoke (S) and the alarm is switched on (P), or when a manual call point is pressed (M), regardless of the other inputs.
Write a Boolean expression for alarm using S, P and M, and state whether the alarm sounds when S=0, P=1 and M=1.
Question 18 [4 marks]
Ethics, Law and Environmental Impact
A large batch of old computers is manufactured, used for several years, and then thrown away.
Discuss one environmental issue caused by the manufacture of computers, and one environmental issue caused by their disposal.
Question 19 [4 marks]
Number Systems: Binary and Hexadecimal
A single parity bit is added to each 7-bit binary code sent between two computers, set so that the total number of 1 bits, including the parity bit, is always even.
The 7-bit code 1011001 is sent. State the value the parity bit should be set to, and explain how the receiving computer could use the parity bit to detect a single-bit transmission error.
Question 20 [5 marks]
Searching and Sorting Algorithms
A merge sort and a bubble sort are both used to sort the same list of 1000 already-sorted (ascending) items.
Discuss whether a bubble sort would perform noticeably better on this already-sorted list than on a randomly ordered list of the same size, and whether the same is true for merge sort.
Discuss both fixed-pass and no-swap early-exit bubble sort. For merge sort assume the standard divide-to-singletons implementation, and note how adaptive variants could change the result.
Question 21 [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 22 [6 marks]
Algorithm Design and Trace Tables
A programmer has written an algorithm that asks the user to enter their age and only accepts values between 0 and 120.
Assume integer ages and inclusive limits 0 and 120. Discuss normal, boundary and erroneous tests with examples and expected accept/reject outcomes. Include both endpoints and the immediately adjacent invalid values, and explain the fault each type can reveal.
Use test inputs 35, 0, 120, -1, 121 and -5 and state each expected outcome.
Question 23 [6 marks]
Boolean Logic and Logic Gates
A circuit outputs 1 only when at least two of its three inputs, X, Y and Z, are 1 (a 'majority' circuit).
Complete a truth table for this circuit for all eight combinations of X, Y and Z, giving the output for each.
Question 24 [6 marks]
Searching and Sorting Algorithms
A programmer must search a list of 50 customer names that changes constantly, with new names being added and removed throughout the day, and the list is never kept in sorted order.
Discuss whether a linear search or a binary search would be more suitable for this list, and explain your reasoning.
Question 25 [6 marks]
Algorithm Design and Trace Tables
Design pseudocode to count ten integer scores in these bands: below 40; 40 to 69 inclusive; 70 or above. Use scores[0] through scores[9] and output all three counts.
Check your counts for scores = [0, 39, 40, 69, 70, 100, 38, 41, 68, 71].
Question 26 [6 marks]
Searching and Sorting Algorithms
A programmer must choose a sorting algorithm to sort a list of 2 million transaction records that must be sorted from scratch once per night, with enough spare memory available to hold a full second copy of the list during sorting.
Discuss why a merge sort would be a more suitable choice than a bubble sort for this task.
Model solutions
| Question 1[2 marks] | |
|---|---|
| Answer or working | Marks |
| a bit is a single binary digit, either 0 or 1 | B1 |
| a byte is a group of 8 bits | B1 |
| Final answer: Bit: a single binary digit (0 or 1). Byte: a group of 8 bits | |
| Question 2[2 marks] | |
|---|---|
| Answer or working | Marks |
| the address bus carries the address of the memory location that is to be read from or written to | B1 |
| the data bus carries the actual data or instruction being transferred between the CPU and memory | B1 |
| Final answer: Address bus: carries the address of the memory location being accessed. Data bus: carries the data or instruction being transferred | |
| Question 3[3 marks] | |
|---|---|
| Answer or working | Marks |
| First output is 2 | B1 |
| Middle outputs are 4 then 6 | B1 |
| Final output is 8 and the loop stops | B1 |
| Final answer: The output, on separate lines, is 2,4,6,8. The inclusive loop uses i=1,2,3,4, multiplying each by 2. | |
| Question 4[3 marks] | |
|---|---|
| Answer or working | Marks |
| A=0, B=0 gives output 0 | B1 |
| A=0, B=1 gives output 0 | B1 |
| A=1, B=1 gives output 1 | B1 |
| Final answer: A=0,B=0: 0. A=0,B=1: 0. A=1,B=1: 1 | |
| Question 5[3 marks] | |
|---|---|
| Answer or working | Marks |
| Compare the relative order of adjacent values | B1 |
| Swap if the left value is greater in ascending order | B1 |
| Leave an already ordered or equal pair unchanged | B1 |
| Final answer: For ascending order, compare adjacent values. If the left value is greater than the right value, swap them; otherwise leave them in place. Move to the next adjacent pair in the pass. | |
| Question 6[3 marks] | |
|---|---|
| Answer or working | Marks |
| identifying the place values of each 1 bit: 64, 16, 8 and 2 | M1 |
| correctly adding these place values together | M1 |
| 90 | A1 |
| Question 7[3 marks] | |
|---|---|
| Answer or working | Marks |
| print spooling stores each document to be printed in a queue on the hard disk, or in memory, rather than sending it straight to the printer | B1 |
| the operating system sends each document from the queue to the printer one at a time, in the order they were queued, at the speed the printer can manage | B1 |
| this frees the user to continue working on other tasks while the documents wait in the queue to be printed | B1 |
| Final answer: Spooling queues the documents on disk and feeds them to the printer one at a time, so the user can keep working on other tasks while they wait to print | |
| Question 8[4 marks] | |
|---|---|
| Answer or working | Marks |
| one distinct UK GDPR principle from lawfulness/fairness/transparency, purpose limitation, data minimisation, accuracy, storage limitation, integrity/confidentiality, accountability | B1 |
| a second different principle from that set | B1 |
| a third different principle from that set | B1 |
| a fourth different principle from that set; do not count components of one grouped principle twice | B1 |
| Final answer: Any four distinct principles: lawfulness, fairness and transparency (one grouped principle); purpose limitation; data minimisation; accuracy; storage limitation; integrity and confidentiality; accountability. | |
| Question 9[2 marks] | |
|---|---|
| Answer or working | Marks |
| Valid subtraction method: binary borrowing, adding the two's complement, or 69-26=43 followed by conversion. | M1 |
| 00101011; accept a correct answer without working for both marks. | A1 |
| Final answer: 00101011 | |
| Question 10[2 marks] | |
|---|---|
| Answer or working | Marks |
| Names XOR (exclusive OR). | B1 |
| Gives A XOR B, or (A AND NOT B) OR (NOT A AND B), or another equivalent Boolean expression. | B1 |
| Final answer: XOR gate; output = A XOR B | |
| Question 11[3 marks] | |
|---|---|
| Answer or working | Marks |
| identify Copyright, Designs and Patents Act 1988 | B1 |
| creators/rightsholders control copying/reuse subject to licences and exceptions | B1 |
| uncredited copying can deny recognition or misrepresent authorship, raising fairness/honesty concerns | B1 |
| Final answer: This relates to the Copyright, Designs and Patents Act 1988. Uncredited copying can be unfair to creators or misrepresent authorship. Whether it infringes copyright depends on rights, licence and any applicable exception; school use is not automatically unlawful. | |
| Question 12[3 marks] | |
|---|---|
| Answer or working | Marks |
| Uses De Morgan to obtain NOT (NOT A) OR NOT (NOT B), or an equivalent valid simplification route. | M1 |
| Obtains A OR B, accepting equivalent notation; award the method mark for a correct simplified answer. | A1 |
| Names De Morgan's law or theorem. | B1 |
| Final answer: A OR B (De Morgan's law) | |
| Question 13[4 marks] | |
|---|---|
| Answer or working | Marks |
| continuously running servers consume substantial electricity | B1 |
| electricity generation can produce greenhouse-gas emissions, depending on the energy source | B1 |
| cooling adds to energy demand | B1 |
| one mitigation, such as lower-carbon electricity or more efficient cooling/hardware | B1 |
| Final answer: Servers and cooling use electricity whose generation may emit greenhouse gases. More efficient cooling reduces electricity demand; lower-carbon electricity is another valid mitigation with a linked explanation. | |
| Question 14[4 marks] | |
|---|---|
| Answer or working | Marks |
| First full pass gives [3,6,1,8] | B1 |
| Second full pass gives [3,1,6,8] | B1 |
| Third full pass gives [1,3,6,8] | B1 |
| Pass 1 moves 8 to the final position by three adjacent swaps | B1 |
| Final answer: With left-to-right ascending passes: [3,6,1,8], [3,1,6,8], [1,3,6,8]. Pass 1 swaps 8 with 3, 6 and 1; pass 2 swaps 6 with 1; pass 3 swaps 3 with 1. | |
| Question 15[4 marks] | |
|---|---|
| Answer or working | Marks |
| unavoidable-harm choices require contested ethical priorities about whose safety to protect | B1 |
| responsibility may involve developers, manufacturers or operators depending on fault and applicable rules, rather than the algorithm itself | B1 |
| opaque automated decisions can make investigation and assignment of responsibility difficult | B1 |
| clear safety standards, records, oversight and liability rules help make those human organisations accountable | B1 |
| Final answer: Unavoidable-harm choices involve contested ethical priorities. Responsibility may lie with developers, manufacturers or operators depending on fault and law; opaque decisions complicate investigation. Clear standards, records and accountable oversight are needed. | |
| Question 16[4 marks] | |
|---|---|
| Answer or working | Marks |
| the operating system allocates a separate area of memory to each running application | B1 |
| it keeps each application's memory separate, so one application cannot interfere with another's data | B1 |
| it uses virtual memory, treating space on secondary storage as extra memory when RAM is full | B1 |
| it moves data between RAM and this secondary storage space as needed, so more applications appear to run than would fit in RAM alone | B1 |
| Final answer: The operating system allocates and protects memory for each application, and uses virtual memory to extend RAM using secondary storage | |
| Question 17[4 marks] | |
|---|---|
| Answer or working | Marks |
| Combines S and P with AND. | M1 |
| Uses alarm = (S AND P) OR M, accepting logically equivalent forms. | M1 |
| Correct substitution: (0 AND 1) OR 1, or observes that M=1 forces the OR output. | M1 |
| Output 1, so the alarm sounds; award both evaluation marks for a correct conclusion. | A1 |
| Final answer: alarm = (S AND P) OR M; with S=0, P=1, M=1 the alarm sounds (output 1), because M=1 alone is enough | |
| Question 18[4 marks] | |
|---|---|
| Answer or working | Marks |
| manufacture requires mined materials and/or energy | B1 |
| linked harm, such as extraction damaging habitats or fossil-fuel energy causing emissions | B1 |
| improper disposal can release hazardous substances from e-waste | B1 |
| linked consequence, such as soil/water contamination harming organisms; accept a different correctly developed disposal issue | B1 |
| Final answer: Manufacturing consumes finite mined materials and energy, causing extraction damage/emissions. Disposal can release toxic materials into soil/water or increase landfill and loses reusable scarce resources. Recycling/reuse and proper treatment reduce these impacts. | |
| Question 19[4 marks] | |
|---|---|
| Answer or working | Marks |
| Counts four 1 bits in 1011001. | M1 |
| Parity bit 0; the correct parity answer earns the counting mark. | A1 |
| Receiver counts the 1 bits in the whole received code including the parity bit. | B1 |
| A single flipped bit changes even parity to odd, so an odd total signals an error; does not locate or correct it. | B1 |
| Final answer: Parity bit = 0 (the code already has four 1 bits, an even number); the receiver recounts the 1 bits including the parity bit, and an odd total reveals a single-bit error | |
| Question 20[5 marks] | |
|---|---|
| Answer or working | Marks |
| Early-exit bubble detects a pass with no swaps | B1 |
| Sorted input needs 999 adjacent comparisons and no swaps | B1 |
| Random input generally requires many passes and up to quadratic work | B1 |
| Fixed-pass bubble does not gain the same reduction in comparisons | B1 |
| Standard merge retains O(n log n) division and merge work despite sorted input | B1 |
| Final answer: An early-exit bubble sort compares all 999 adjacent pairs once, makes no swaps and terminates, giving O(n) work on this sorted input. On random input it usually needs many passes and can take O(n^2). A fixed-pass bubble sort still makes its prescribed comparisons, though it avoids swaps. Standard merge sort still divides and merges O(log n) levels with O(n) work per level, so remains O(n log n); adapted merge implementations may exploit existing runs. | |
| Question 21[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 22[6 marks] | |
|---|---|
| Answer or working | Marks |
| Normal example 35 should be accepted | B1 |
| Normal tests check typical valid behaviour | B1 |
| Boundary examples 0 and 120 should be accepted | B1 |
| Boundary tests detect endpoint mistakes with -1 and 121 rejected | B1 |
| Erroneous example -5 should be rejected | B1 |
| Erroneous tests check invalid data cannot pass the validation | B1 |
| Final answer: Normal data such as 35 should be accepted, checking a typical valid value. Boundary data 0 and 120 should be accepted, testing the inclusive endpoints. Values -1 and 121 should be rejected, checking the immediately excluded sides. Erroneous data such as -5 (or nonnumeric text if text input is supported) should be rejected, checking that invalid data cannot pass validation. Expected outcomes make the tests useful for detecting off-by-one or incorrect Boolean conditions. | |
| Question 23[6 marks] | |
|---|---|
| Answer or working | Marks |
| Outputs 0 for both 000 and 001. | B1 |
| Outputs 0 for both 010 and 100. | B1 |
| Output 1 for 011. | B1 |
| Output 1 for 101. | B1 |
| Output 1 for 110. | B1 |
| Output 1 for 111; no additional explanation is required. | B1 |
| Final answer: Output is 1 for: 0,1,1 / 1,0,1 / 1,1,0 / 1,1,1. Output is 0 for the other four combinations, where fewer than two inputs are 1 | |
| Question 24[6 marks] | |
|---|---|
| Answer or working | Marks |
| a binary search requires the list to be sorted before it can be used | B1 |
| keeping the list sorted after every addition or removal would require the list to be re-sorted (or carefully re-inserted into place) very frequently | B1 |
| this extra sorting work could outweigh any speed advantage binary search would otherwise give, especially since the list is only 50 items long | B1 |
| a linear search does not require the list to be sorted, so it can be used directly on the list as it changes | B1 |
| a list of only 50 items, a linear search is fast enough in practice, since even checking every item is a small amount of work | B1 |
| valid conclusion recommending linear search for this list, justified by the cost of keeping an unsorted, frequently changing list sorted for binary search | B1 |
| Final answer: Linear search is more suitable here: binary search would need the list kept sorted, which is not worth the ongoing effort for a list that changes constantly and is only 50 items long | |
| Question 25[6 marks] | |
|---|---|
| Answer or working | Marks |
| Initialise all three counts to zero | B1 |
| Visit all ten scores exactly once | B1 |
| Increment low only for scores below 40 | B1 |
| Increment mid only for 40 through 69 | B1 |
| Increment high only for 70 or above | B1 |
| Output all three final counts after the loop | B1 |
| Final answer: Pseudocode (zero-based list): low = 0 mid = 0 high = 0 for i = 0 to 9 if scores[i] < 40 then low = low + 1 elseif scores[i] < 70 then mid = mid + 1 else high = high + 1 endif next i print low, mid, high The branches are exclusive; 40 and 69 belong to mid and 70 to high. For the printed scores the band counts are 3 below 40, 4 in 40..69 and 3 at least 70. The band partition assumes integer scores; the original does not specify the behaviour for a fractional score between 69 and 70. | |
| Question 26[6 marks] | |
|---|---|
| Answer or working | Marks |
| a bubble sort compares and swaps adjacent items repeatedly, and the number of comparisons it needs grows very quickly as the list gets much longer | B1 |
| a list as large as 2 million records, a bubble sort would take an impractically long time to complete each night | B1 |
| a merge sort instead divides the list repeatedly and merges the sorted parts back together, which scales far better to a very large list like this | B1 |
| a merge sort does need extra memory to hold the list's sub-lists while merging, roughly equivalent to a second copy of the list | B1 |
| since the system has enough spare memory available for a full second copy, this extra memory requirement is not a practical problem here | B1 |
| valid conclusion that merge sort is the more suitable choice, since it scales far better to 2 million records and the extra memory it needs is available | B1 |
| Final answer: Merge sort is far more suitable: it scales much better than bubble sort to 2 million records, and the extra memory it needs to hold a second copy while merging is available here | |