Scribd
Upload
41 views9 pages

Question Bank DDCO IAT-1

The document discusses various concepts in Boolean algebra and combinational logic circuits including De Morgan's laws, Boolean expressions, truth tables, logic diagrams, simplification using Karnaugh maps, multiple-level logic circuits, encoders, decoders, adders and subtractors.

Uploaded by

babu.vaibhav2121
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
41 views9 pages

Question Bank DDCO IAT-1

The document discusses various concepts in Boolean algebra and combinational logic circuits including De Morgan's laws, Boolean expressions, truth tables, logic diagrams, simplification using Karnaugh maps, multiple-level logic circuits, encoders, decoders, adders and subtractors.

Uploaded by

babu.vaibhav2121
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

1.

Demonstrate the validity of the following identities by means of truth tables:


(a) DeMorgan’s theorem for three variables: (x + y + z)’ = x’y’z’ and (xyz)’ = x’ + y’ + z’

(b) The distributive law: x + yz = ( x + y )( x + z )

(c) The distributive law: x(y + z) = xy + xz

(d) The associative law: x + (y + z) = (x + y) + z


2. Simplify the following Boolean expressions to a minimum number of literals.
Also draw logic diagrams of the circuits that implement the original and simplified
expressions
(a) (x + y) (x + y’)
Solution:
(x + y)(x + y')
= x + yy'
= x(x +y') + y(x + y')
= xx + xy' + xy + yy'
=x

(b) xyz + x’y + xyz’


Solution:
xyz + x'y + xyz'
= xy(z + z') + x'y
= xy + x'y
=y
3. Simplify the following Boolean expressions to a minimum number of literals:
(a) ABC + A’B + ABC’
Solution:
ABC + A'B + ABC'
= AB + A'B
=B

(b)x’yz + xz
Solution:
x'yz + xz
= (x'y + x)z
= z(x + x')(x + y)
= z(x + y)

(c) (x + y)’(x’ + y’)


Solution:
(x + y)'(x' + y')
= x'y'(x' + y')
= x'y'

(d) xy + x(wz + wz’)


Solution:
xy + x(wz + wz')
= x(y +wz + wz')
= x(w + y)

(e) (BC’ + A’D) (AB’ + CD’)


Solution:
(BC' + A'D)(AB' + CD')
= BC'AB' + BC'CD' + A'DAB' + A'DCD'
=0

(f) (a’ + c’) (a + b’ + c’)


Solution:
(a' + c')(a + b' + c')
= a'a + a'b' + a'c' + c'a + c'b' + c'c'
= a'b' + a'c' + ac' + b'c'
= c' + b'(a' + c')
= c' + b'c' + a'b'
= c' + a'b'

4. Reduce the following Boolean expressions to the indicated number of literals:


(a) A’C’ + ABC + AC’ to three literals
Solution:
A'C' + ABC + AC'
= C' + ABC
= (C + C')(C' + AB)
= AB + C'

(b) (A’ + C) (A’ + C’) (A + B + C’D) to four literals


Solution:
(A' + C)(A' + C')(A + B + C'D)
= (A' + CC')(A + B + C'D)
= A'(A + B + C'D)
= AA' + A'B + A'C'D
= A'(B + C'D)

5. For the Boolean function F = xy’z + x’y’z + w’xy + wx’y + wxy


(a) Obtain the truth table of F.

(b) Draw the logic diagram, using the original Boolean expression.

(c) Use Boolean algebra to simplify the function to a minimum number of literals.
F = xy'z + x'y'z + w'xy + wx'y + wxy = y'z + xy + wy = y$z + y(w + x)
(d) Obtain the truth table of the function from the simplified expression and show that it is
the same as the one in part (a).
F = y'z + yw + yx) = Σ(1, 5, 9, 13 , 10, 11, 13, 15, 6, 7, 14, 15) = Σ(1, 5, 6, 7, 9, 10, 11, 13, 14, 15)
(e) Draw the logic diagram from the simplified expression, and compare the total number
of gates with the diagram of part (b).

6. Draw the multiple-level


NOR circuit for the following
expression: CD(B + C)A +
(BC’ + DE’)
7. Draw the multiple-level NAND circuit for the following expression: w(x + y + z) + xyz

8. Model the following Boolean function F , together with the don’t-care conditions d , using no more
than two NOR gates:

F(A, B, C, D) = Ʃ(2, 4, 10, 12, 14)

d(A, B, C, D) = Ʃ(0, 1, 5, 8)

Assume that
both the
normal and
complement
inputs are
available.
9. Draw a logic diagram using only two-input NOR gates to implement the following function:
F/(A, B, C, D) = (A ⊕ B)'(C ⊕ D)

10. Simplify the following Boolean expressions, using four-variable maps:


(a) * A!B!C!D! + AC!D! + B!CD! + A!BCD + BC!D
(c) A!B!C!D + AB!D + A!BC! + ABCD + AB!C
(d) A!B!C!D! + BC!D + A!C!D + A!BCD + ACD!
11. Simplify the following Boolean function F , together with the don’t-care conditions d , and
then express the simplified function in sum-of-minterms form:
(a)F(x, y, z) = Ʃ(0, 1, 4, 5, 6)
d(x, y, z) = Ʃ(2, 3, 7)

(b) F(A,B,C,D) = Ʃ(0, 6,8,13,14)


d(A,B,C,D) = Ʃ(2, 4, 10)

(c) F(A,B,C,D) = Ʃ(4, 12,7,2,10)


d(A,B,C,D) = Ʃ(0, 6, 8)
12. Determine a 3-bit adder combinational circuit using 2 bit adders
13. Design a 3-bit subtractor combinational circuit using 2 bit subtractors
13.Design a half subtractor using 2:4 combinational circuit?
14. Design a full subtractor using 3:8 combinational circuit?
15.Discuss the combinational circuit that decodes 3 input variables?
16.Discuss the combinational circuit that encodes 4 input variables?
17.Explain the implementation of a 2-bit adder and 3-bit adder combinational circuits?
18.Describe a combinational circuit that encodes 8 input variables?
19. Describe a combinational circuit that decodes 2 input variables?

You might also like