Scribd
Upload
435 views

16 Rows: AND Gate: On A Computer You Must Have The Power Switch Enabled and You

1. The document provides examples of AND and OR logic gates in real-world applications and asks the reader to provide additional examples. 2. It asks how many rows a truth table would have for a 4-input logic gate and instructs the reader to construct the truth table for a 4-input OR gate. 3. Additional questions ask the reader to construct truth tables for 2-input NAND, 3-input XOR, and 3-input OR gates, and draw output values for 3-input NAND and NOR gates given input patterns.

Uploaded by

Cameron Hulse
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
435 views

16 Rows: AND Gate: On A Computer You Must Have The Power Switch Enabled and You

1. The document provides examples of AND and OR logic gates in real-world applications and asks the reader to provide additional examples. 2. It asks how many rows a truth table would have for a 4-input logic gate and instructs the reader to construct the truth table for a 4-input OR gate. 3. Additional questions ask the reader to construct truth tables for 2-input NAND, 3-input XOR, and 3-input OR gates, and draw output values for 3-input NAND and NOR gates given input patterns.

Uploaded by

Cameron Hulse
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Problems

Cameron Hulse

1. Identify a real-world example for an AND gate and one for an OR gate other than
those presented in this chapter.
AND gate: On a computer you must have the power switch enabled and you
must press the power on button. Meaning you need two switch one and two on
to power the computer on.

OR gate: When you have a room with 2 light switches for one light, you need
switch one or switch two on to power the light on.
2. How many rows does the truth table for a 4-input logic gate have?
4
2n gates 2 = 16 rows
3. Construct the truth table for a four-input OR gate.

Input 1 Input 2 Input 3 Input 4 Output

0 0 0 0 0

0 0 0 1 1

0 0 1 0 1

0 0 1 1 1

0 1 0 0 1

0 1 0 1 1

0 1 1 0 1

0 1 1 1 1

1 0 0 0 1

1 0 0 1 1

1 0 1 0 1

1 0 1 1 1

1 1 0 0 1

1 1 0 1 1

1 1 1 0 1

1 1 1 1 1

4. Construct the truth table for a two-input NAND gate.


Problems
Cameron Hulse

Input 1 Input 2 Output

0 0 1

0 1 1

1 0 1

1 1 0

5. Construct the truth table for a three-input Exclusive-NOR gate.

Input 1 Input 2 Input 3 Output

0 0 0 1

0 0 1 0

0 1 0 0

0 1 1 1

1 0 0 0

1 0 1 1

1 1 0 1

1 1 1 0

6. Construct the truth table for a three-input OR gate using don’t cares for the inputs
similar to the truth table constructed for the three-input AND gate shown in Figure
4-13.

Input 1 Input 2 Input 3 Output


Problems
Cameron Hulse

0 0 0 0

X X 1 1

X 1 X 1

1 X X 1

7. Draw the output X for the pattern of inputs shown in the figure below for a three
input NAND gate.

A B C X

0 0 0 1

1 0 0 1

0 1 0 1

1 1 0 1

0 0 1 1

1 0 1 1

0 1 1 1

1 1 1 0

8. Repeat problem 7 for a NOR gate.

A B C X

0 0 0 1

1 0 0 0

0 1 0 0
Problems
Cameron Hulse

1 1 0 0

0 0 1 0

1 0 1 0

0 1 1 0

1 1 1 0

9. Show the output waveform of an AND gate with the inputs A, B, and C indicated in
the figure below.

10. Develop the truth table for each of the combinational logic circuits shown below.

a.

A B C X

0 0 0 1

0 0 1 1
Problems
Cameron Hulse

0 1 0 1

0 1 1 1

1 0 0 1

1 0 1 1

1 1 0 1

1 1 1 0

b.

A B C X

0 0 0 1

0 0 1 1

0 1 0 1

0 1 1 1

1 0 0 1

1 0 1 1
Problems
Cameron Hulse

1 1 0 0

1 1 1 1

c.

A B C X

0 0 0 0

0 0 1 0

0 1 0 0

0 1 1 1

1 0 0 0

1 0 1 1

1 1 0 0

1 1 1 0

You might also like