Consider the logic circuit L :
[Circuit as drawn: inputs A, B and C. The first AND gate takes A, B and C. The second AND gate takes A, C and B passed through a NOT gate. The third AND gate takes A passed through a NOT gate, and B. The outputs of the three AND gates are inputs of one OR gate, whose output is Y.]
(i) Express Y as a Boolean expression.
(ii) Write 8-bit special sequences for A, B and C.
(iii) Find the truth table of L using 8-bit special sequences.
10 marks · directive: Express, write and find
The core of a good answer
Y = ABC + AB′C + A′B, which simplifies to Y = AC + A′B; with special sequences A = 00001111, B = 00110011, C = 01010101 the output sequence is Y = 00110101, i.e. Y = 1 for ABC = 010, 011, 101 and 111.
An outline written by upsc.help, not an official UPSC answer; every fact checked by a separate review. How we work
What the question asks
The part tests reading a gate diagram into a sum of products, and the special sequence method of building a truth table: each input is given an 8-bit string listing its value in the 8 rows of a three-variable table, and gate operations are carried out bit by bit on these strings. The answer should show each AND output as a sequence and the final OR.
Answer outline
Introduction
Read each AND gate's inputs from the circuit, write Y as the OR of the three products, then evaluate with 8-bit sequences whose k-th bits (k = 0 to 7) correspond to ABC = 000, 001, ..., 111. (The diagram is described in words in the question text above.)
Step 1: Boolean expression (part i)
- Gate 1 output: A·B·C
- Gate 2 output: A·B′·C (B through an inverter)
- Gate 3 output: A′·B (A through an inverter)
- Y = ABC + AB′C + A′B
- Simplify: ABC + AB′C = AC(B + B′) = AC, so Y = AC + A′B
Step 2: Special sequences (part ii)
- Rows ordered ABC = 000, 001, 010, 011, 100, 101, 110, 111
- A = 0000 1111
- B = 0011 0011
- C = 0101 0101
- Hence A′ = 1111 0000, B′ = 1100 1100
Step 3: Bitwise evaluation (part iii)
- ABC = 0000 1111 · 0011 0011 · 0101 0101 = 0000 0001
- AB′C = 0000 1111 · 1100 1100 · 0101 0101 = 0000 0100
- A′B = 1111 0000 · 0011 0011 = 0011 0000
- Y = 0000 0001 + 0000 0100 + 0011 0000 = 0011 0101
Step 4: Truth table of L
- A B C : Y
- 0 0 0 : 0
- 0 0 1 : 0
- 0 1 0 : 1
- 0 1 1 : 1
- 1 0 0 : 0
- 1 0 1 : 1
- 1 1 0 : 0
- 1 1 1 : 1
Conclusion
Y = AC + A′B: the circuit behaves as a 2-to-1 multiplexer that outputs C when A = 1 and B when A = 0. The truth table (minterms 2, 3, 5, 7) was rechecked bit by bit in Python.
Examples and data to cite
- Y = Σm(2, 3, 5, 7) in minterm notation.
- The same function needs only two AND gates, one inverter and one OR gate after simplification, a standard illustration of why simplification saves hardware.
Facts to remember
- Special (characteristic) sequences: for n variables use 2ⁿ-bit strings; the first variable is 0 in the first half and 1 in the second, the next alternates in quarters, the last alternates bit by bit.
- AND, OR and NOT act bit by bit on the sequences; the resulting string is the output column of the truth table.
- Complementation law: B + B′ = 1, so XB + XB′ = X.
- An inverter (NOT gate) is drawn as a triangle with a small circle (bubble) at the output.