Hardware: past paper questions
Real questions on hardware
The newest 20 of 199 written questions. Open one to see it on the real paper.
- 9618/11 · October/November 2025 · Q3a[2]
Draw a logic circuit for the logic expression: X = NOT ((A NAND B) XOR (NOT A OR NOT C)) A B X C
See it on the paper → - 9618/11 · October/November 2025 · Q3b[2]
Write the logic expression for the following truth table. R S T Q 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 1 1 1 1 0 Q =
See it on the paper → - 9618/11 · October/November 2025 · Q5a(i)[2]
State two tasks that are performed by hardware management.
See it on the paper → - 9618/11 · October/November 2025 · Q5a(ii)[2]
State two tasks that are performed by security management.
See it on the paper → - 9618/11 · October/November 2025 · Q6c[3]
State three differences between Dynamic RAM (DRAM) and Static RAM (SRAM).
See it on the paper → - 9618/12 · October/November 2025 · Q8b(i)[4]
Explain how a touchscreen converts the point of touch to a selection from the menu.
See it on the paper → - 9618/12 · October/November 2025 · Q9a[2]
Consider the following logic circuit: A X B Write the logic expression for the logic circuit. Do not simplify the expression. X = C
See it on the paper → - 9618/12 · October/November 2025 · Q9b[2]
Consider the following logic expression: X = NOT ((A NAND B) XOR (NOT A OR NOT C)) A B C X 1 0 0 0 1 2 0 0 1 0 3 0 1 0 1 4 0 1 1 0 5 1 0 0 1 6 1 0 1 0 7 1 1 0 1 8 1 1 1 1 There are three errors in the truth table. Identify the three errors in the truth table by writing the row numbers with an incorrect output. Error 1...
See it on the paper → - 9618/13 · October/November 2025 · Q3a[2]
Complete the truth table for the following logic expression: X = (A NOR B) NAND (C XOR B) Working space A B C 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 X
See it on the paper → - 9618/13 · October/November 2025 · Q3b[2]
Draw a logic circuit for the logic expression: X = NOT (((A AND B) OR C) AND (C NOR D)) A B D C X
See it on the paper → - 9618/31 · October/November 2025 · Q6a[3]
The diagram shows a logic circuit. P A R B 6 Z S Q C Complete the truth table for the given logic circuit. Show your working. Working space A B C 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 P Q R S Z
See it on the paper → - 9618/31 · October/November 2025 · Q6b(i)[2]
Complete the Karnaugh map (K‑map) for the Boolean expression: A.B.C + A.B.C + A.B.C + A.B.C BC A 01 11 10 0 00 1
See it on the paper → - 9618/31 · October/November 2025 · Q6b(iii)[2]
Write the Boolean expression from your answer to part b(ii) as a simplified sum‑of‑products. Do not carry out any further simplification.
See it on the paper → - 9618/32 · October/November 2025 · Q6a[3]
The diagram shows a logic circuit. A Q S Z P B R C A B C 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 P Q R S Z Working space Complete the truth table for the given logic circuit. Show your working.
See it on the paper → - 9618/32 · October/November 2025 · Q6b(i)[2]
Complete the Karnaugh map (K-map) for the Boolean expression: A.B.C + A.B.C + A.B.C + A.B.C BC A 00 01 11 10 0 1
See it on the paper → - 9618/32 · October/November 2025 · Q6b(ii)[2]
Draw loop(s) around appropriate group(s) in the K-map to produce an optimal sum-of-products.
See it on the paper → - 9618/32 · October/November 2025 · Q6b(iii)[2]
Write the Boolean expression from your answer to part b(ii) as a simplified sum-of-products. Do not carry out any further simplification.
See it on the paper → - 9618/32 · October/November 2025 · Q11[7]
The table shows assembly language instructions for a processor that has one register, the Accumulator (ACC). Instruction Label Opcode Operand LDM #n Load the number n to the ACC LDD <address> LDI <address> ADD <address> SUB <address> STO <address> <label>: Explanation <data> Load the contents of the location at the giv...
See it on the paper → - 9618/11 · May/June 2025 · Q1a[2]
Write the logic expressions for the following logic circuit. P X Q R Y S X =
See it on the paper → - 9618/11 · May/June 2025 · Q1b[2]
Complete the truth table for the following logic circuit. A B X C A B C 0 0 0 0 0 1 0 1 0 0 1 1 1 0 0 1 0 1 1 1 0 1 1 1 Working space X
See it on the paper →
What examiners said
This question was generally not answered well. Answers were expected to demonstrate some technical knowledge of the devices given in the table. Statements such as ‘allows a device to connect wirelessly’ for the purpose of a Wireless Access Point are not clear enough.
— Examiner report, October/November 2023, 9618/11 Q2(b) (Cambridge)
This question was generally answered well. Many candidates were able to correctly carry complete the truth table.
— Examiner report, October/November 2023, 9618/11 Q4(a) (Cambridge)
This question was generally answered well. Many candidates were able to draw an appropriate logic circuit.
— Examiner report, October/November 2023, 9618/11 Q4(b) (Cambridge)
Past papers, syllabus and examiner reports © UCLES (Cambridge University Press & Assessment). Questions are matched to topics from the official syllabus. AssessPro is independent and not endorsed by Cambridge.