Scribd
Upload
23 views2 pages

Chapter 4

Uploaded by

Amir Hakim
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
23 views2 pages

Chapter 4

Uploaded by

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

ITT270 (DIGITAL ELECTRONICS) 1 TUTORIAL/OCT2023

Chapter 4: Combinational Logic Circuits and Boolean Algebra

Answer ALL questions.

QUESTION 1

Based on the truth table shown below:

INPUT OUTPUT
A B C D X
0 0 0 0 1
0 0 0 1 1
0 0 1 0 0
0 0 1 1 1
0 1 0 0 1
0 1 0 1 0
0 1 1 0 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 1

a) Write the Sum-of-Product (SOP) expression for X.


b) Write the Product-of-Sum (POS) expression for X.

QUESTION 2

Simplify the following equations using Boolean algebra:

a) X = A. B. C + A. B. C + A. B. C + A. B + A. C
b) Y = A. B. C. D + A. B. C. D + A. B. D + A. B. D + A. C. D + A. C. D
c) Z = A. B. C. D + A. B. C. D + A. B. C + B. C. D + C. D + D

QUESTION 3

Prove the following equations using Boolean algebra and DeMorgan’s theorem:

a) �A. B� �A. C� + A + B + C = A. C + B. C

b) ((A. B)C + A. C)(B. C) = B + C


c) B�A + C� + A. B. C + C(A + B) = B + A. C

©FMH/UiTM
ITT270 (DIGITAL ELECTRONICS) 2 TUTORIAL/OCT2023

QUESTION 4

Based on the following Boolean expression:

Y = A. C + A. B. D

a) Draw the logic circuit using NAND gates only.


b) Draw the logic circuit using NOR gates only.

QUESTION 5

Based on the following Boolean expression:

X = A(B + C)

a) Draw the logic circuit using NAND gates only.


b) Draw the logic circuit using NOR gates only.

END OF QUESTIONS

©FMH/UiTM

You might also like