1 of 8 0-day streak

Trace and simplify logic circuits

This is a fixed question bank. Later sets may repeat these questions

Question 1 of 8

No calculator

Use ideal Boolean gates: values are 0 or 1; OR is inclusive. Each labelled circle is an input or a gate output. The table defines every gate and both ports of a two-input gate. Crossings add no connection and arrows show signal direction. There is no feedback or timing model

For part (a), use P = 1. Part (b) asks about every possible input assignment

Labelled signal-flow schematic; gate operations are listed in the table

(a)1 mark

Trace the gates in table order. Enter 0 or 1 for every blank, including the final output F

Output	Gate	Input signals	Value
F	NAND	P, P	blank F

Output F

(b)1 mark

Which expression equals F for every assignment of the original inputs? A bar means NOT, juxtaposition means AND, and + means inclusive OR. Matching only the inputs in part (a) is insufficient

P

1

\overline{P}

0