Scribd
Upload
96 views3 pages

Homework Chapter2

This document provides examples and problems related to Boolean algebra and logic gates. It begins with basic timing diagram examples for OR and AND gates under different input conditions. It then presents problems for simplifying Boolean expressions using DeMorgan's theorem and transforming logic circuits between NAND and NOR implementations. More advanced problems involve implementing complex Boolean expressions using a limited number of given gate types.

Uploaded by

Tuan Anh
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
96 views3 pages

Homework Chapter2

This document provides examples and problems related to Boolean algebra and logic gates. It begins with basic timing diagram examples for OR and AND gates under different input conditions. It then presents problems for simplifying Boolean expressions using DeMorgan's theorem and transforming logic circuits between NAND and NOR implementations. More advanced problems involve implementing complex Boolean expressions using a limited number of given gate types.

Uploaded by

Tuan Anh
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/ 3

Digital Systems

BOOLEAN ALGEBRA & LOGIC GATES

Basic
1. Draw the timing diagram for the output signal x of the OR gate.

A 2
B 3 1 x
C 4

Figure 1
2. Suppose signal A in Figure 1 is grounded - GND (A = 0). Draw the timing diagram for the
OR signal of the gate.
3. Suppose signal A in Figure 1 is +5V – VCC (A = 1). Draw the timing diagram for the OR
signal of the gate.
4. With 5-inputs OR gate, how many input entries allow for high output (HIGH or 1)?
5. Draw the timing diagram for the output signal x of the AND gate.

A 2
B 3 1 x
C 4

Figure 2
6. Write the Boolean expresion and truth table for the outputs of the circuits below

Figure 3

Homework 2 – BOOLEAN ALGEBRA & LOGIC GATES 1


Digital Systems

7. Draw logic circuits corresponding to the following Boolean expressions:

8. Simplify the following expressions using DeMorgan’s theorem:

9. Simplify the following expressions:

10. Transform the following circuits using only NAND gates

Figure 4
11. Transform the following circuits using only NOR gates

Figure 5

12. Build a 2-input NAND gate using only 2-input NOR gates.

13. Build a 2-input NOR gate using only 2-input NAND gates.

14. Draw the appropriate gate symbols for the following statements:

(a) The output is HIGH (1) when all three inputs are LOW (0).
(b) The output is LOW when any of the four inputs is LOW.
(c) The output is LOW when all 5 inputs are HIGH.
15. The logic circuit in Figure 6 is being used to activate an alarm when its output f goes LOW.
Modify the circuit diagram so that it represents the circuit operation more effectively.

Homework 2 – BOOLEAN ALGEBRA & LOGIC GATES 2


Digital Systems

Figure 6

16. Determine the input conditions necessary to activate LED on.


NOR +5 V
A OR
NOT
R1
B
AND
C LED
NOT
D
NAND
E
NOT

Figure 7

Advance
17. Implement uses only 1 2-input NOR gate and 1 2-input NAND gate.

18. Implement y=ABCD uses only 2-input NAND gates.

Homework 2 – BOOLEAN ALGEBRA & LOGIC GATES 3

You might also like