65Easy
0/1

A logic circuit is designed to implement the Boolean expression:

Output Z=(P OR Q) NAND (NOT P) \text{Output } Z = (P \text{ OR } Q) \text{ NAND } (\text{NOT } P) Output Z=(P OR Q) NAND (NOT P)

The diagram below shows this circuit where the actual gates have been replaced by generic boxes labeled Gate 1, Gate 2, and Gate 3.

Logic circuit with generic boxes

Draw the standard logic circuit symbol for the logic gate that must be used at Gate 3 to correctly implement the expression.

[1]

Boolean logic Questions

Practise AQA GCSE Computer Science Boolean logic with exam-style questions for GCSE Computer Science. 83 questions, matched to the AQA GCSE Computer Science (8525) specification and written in Paper 1 and Paper 2 style. Every question includes a full worked solution and mark scheme, so you can see where marks are awarded rather than just whether you got the answer right.

PreviousNext

Boolean logic Questions

  1. GCSE
  2. /Computer Science
  3. /Boolean logic