1.4.3(a), 1.4.3(d) · Boolean algebra and logic

Boolean expressions, truth tables and gates

The lesson for this topic

Question 11 mark

Reading rows AB = 00, 01, 10, 11 in order, which output column is Q = ¬(A ∧ B)?

Question 21 mark

Reading rows AB = 00, 01, 10, 11 in order, which output column is Q = ¬(A ∨ B)?

Question 31 mark

Reading rows AB = 00, 01, 10, 11 in order, which output column is Q = A ⊻ B?

Question 41 mark

Reading rows AB = 00, 01, 10, 11 in order, which output column is Q = ¬A ∧ B?

Question 51 mark

In the truth table for Q = (A ∨ B) ∧ C, on how many of the 8 rows is Q = 1?

Question 61 mark

In the truth table for Q = A ⊻ (B ∧ C), on how many of the 8 rows is Q = 1?

Question 71 mark

In the truth table for Q = ¬(A ∧ B) ∨ C, on how many of the 8 rows is Q = 1?

Question 81 mark

A machine runs (M) only when the guard is closed (G) and exactly one of two start buttons (S, T) is pressed. Which expression is correct?

Structured question 18 marks

A security light

A light (L) turns on when it is dark (D) and either motion is sensed (M) or the manual switch (S) is on. It never turns on in daylight.

(a) Write2 marks

a Boolean expression for L.

(b) Complete4 marks

the truth table for Q = (A ∧ ¬B) ∨ (B ∧ C).

ABCQ
0000
0010
(c) Describe2 marks

the output of an XOR gate.

0 words
Question 91 mark

A NAND gate has both inputs joined to A. What does it output?

Question 101 mark

How many rows does a truth table need for 4 inputs?

Independent practice for OCR A-level Computer Science (H446), not endorsed by OCR.

Privacy · Terms