![]() | Digital Teaching Aid (DED Philippinen, 86 p.) |
No. 1 Construct the truth Table
What is the Boolean equation?
Figure
No. 2 Draw the logic circuit whose Boolean equation is
Use the 7404, 7408 and the 7411 with pin numbers
No. 3 Simplify the following Boolean expressions
No. 4 A digital system has a 4 bit input from 0000 to 1111.
Design a logic circuit that produces a high output whenever the equivalent hex input is greater than C.
Truth table
Sum of products equation
Logic circuit
No. 5
A |
B |
C |
D |
Y |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
0 |
0 |
1 |
0 |
0 |
0 |
0 |
1 |
1 |
0 |
0 |
1 |
0 |
0 |
0 |
0 |
1 |
0 |
1 |
1 |
0 |
1 |
1 |
0 |
1 |
0 |
1 |
1 |
1 |
1 |
1 |
0 |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
1 |
1 |
0 |
1 |
0 |
1 |
1 |
0 |
1 |
1 |
1 |
1 |
1 |
0 |
0 |
0 |
1 |
1 |
0 |
1 |
1 |
1 |
1 |
1 |
0 |
1 |
1 |
1 |
1 |
1 |
0 |
a) Draw the Karnaugh map
b) Encircle all octets, quads, and
pairs you can find.
c) What is the simplified Boolean equation?
d) Draw
the logic circuit using NAND
gates.