Lab 3:
C
Don't use plagiarized sources. Get Your Custom Essay on
gates and circuit assignment
Just from $13/Page
hapter 4, Gates and Circuits
[52 marks] In all of the problems, you must show your work to qualify for the mark.
Type your answer in this worksheet after each question. Export the completed worksheet to P
D
F and Submit the PDF version with D2L.
Learning Objectives
A
t the end of this lab, you should be able to:
· draw circuit diagrams for
B
oolean expressions
· write truth tables for Boolean expressions
· write Boolean expressions for logic circuits
· experiment with adders
· simplify Boolean expressions
Lab Readings
Chapter 4 – Gates and Circuits
Lab
6
Logic Circuits, Lab6_Manual and the related Applet are included on D2L
Lab
Q
uestions
1
. [4] Do Exercise 1 from Lab6_Manual
Draw a circuit with two inputs A, B and one output that corresponds to AxorB. Run the circuit with all possible input values as given in the table below to complete the truth table for the XOR gate:
|
|
|
|
|
|
|
A
|
|
|
|
|
|
|
B
|
A xor B
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
0
|
0
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
1
|
0
1
0
1
0
0
1
1
0
Insert 4 screenshots of the circuit corresponding to each of the 4 input combinations listed above
2. [4] Do Exercise 2 from Lab6_Manual
Note: Correct Exercise 2 part 2 as follows:
Add four switches, three AND gates, and an output. Arrange them so two switches feed into one AND gate while the other two switches feed into another AND. Then the two outputs of these AND gates feed into the third AND gate.
a) Attach a screenshot of your circuit below this line.
b) Draw the corresponding Truth Table below this line.
|
A
|
B
|
C
|
D
|
OUTPUT
|
0
0
0
0
0
0
0
0
1
0
0
0
1
0
0
0
1
0
0
0
1
0
0
0
0
0
0
1
1
0
0
1
1
0
0
1
1
0
0
0
0
1
1
1
0
1
0
1
1
0
1
1
0
1
0
1
1
1
0
0
1
1
1
1
1
0
1
0
1
0
1
0
1
0
0
3. [6] Do Exercise 4 from Lab6_Manual
Insert a screenshot of your final “Full Adder” circuit. See the text book chapter 4 page 109. Note that this circuit is to be built with 2 truth tables and Not with gates. The Truth Tables are also given below.
In the text the two truth tables are combined in one diagram.
Note. Also see the Truth Table Example in the LOGIC GATE SIMULATOR Applet and Lab6_Manual .
6
A
B
|
Carry-in
|
Sum
|
|
|
0
|
0
0
0
0
0
1
1
0
1
0
1
0
1
1
0
1
0
0
1
1
0
1
0
1
1
0
0
1
1
1
1
A
B
Carry-in
Carry-out
|
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
1
1
1
1
1
4. [4] Given the following Boolean expression:
X = (A’B + C)
1. Draw the circuit diagram for X (use the applet and insert a screen shot below this line).
1. Write the truth table for X below this line.
A
B
|
|
C
|
|
OUTPUT
|
0
0
1
1
0
1
0
1
1
0
0
0
0
1
1
1
1
0
1
0
1
1
0
1
0
0
0
1
1
1
1
1
5. [4] Given the following Boolean expression:
Y = (AB’ + BC) D
1. Draw the circuit diagram for Y (use the applet and insert a screen shot below this line).
1. Write the truth table for Y below this line.
A
B
C
D
|
OUTPUT
0
0
0
1
0
0
0
1
0
0
0
1
0
0
0
1
0
0
0
0
0
0
1
1
0
0
1
1
0
0
1
1
0
0
0
0
1
1
1
0
1
0
1
1
0
1
1
1
0
0
1
1
1
1
1
1
0
1
0
0
0
1
0
1
0
6. [4] Given the following logic diagram:
1. Write the Boolean expression for Q below this line.
Q = (AB+A+B)
1. Write the truth table for intermediate values and Q below this line.
A
B
|
Q
|
0
0
1
1
0
0
0
1
0
1
1
1
7. [4] Given the following circuit diagram:
1. Write a Boolean expression for Q below this line.
Q= AB+ (B+C)(BC)
1. Write the truth table for intermediate outputs (4 of them) and Q below this line.
A
B
C
Q
0
0
0
0
0
0
1
0
0
1
0
0
1
0
0
0
0
1
1
1
1
0
1
0
1
1
0
1
1
1
1
1
8. [8, 2 each] Using properties of Boolean algebra, simplify the following Boolean expressions so they could be built with the minimum number of gates.
1. X = A + BC + AB + ABC + B
1. Y = AB + B(AC + BC + ABC’ + A)
W = ABC’ + AB’C’ + B’CD + A’C + BC
Z = (A + B’)’ + (ABC’)’ + A(B + A’C)’
9. [6] Given the following Boolean expression:
W = A’B + B’C + CB + ABC’
1. Simplify the expression as much as possible using the properties of Boolean algebra so it could be built with the minimum number of gates.
1. Create the truth table for W and create the truth table for the simplified expression (this will validate your simplified expression).
10. [8] The following table describes two truth tables, one with inputs A, B, C, output X, the other with inputs A, B, C, and output Y. Write the Boolean expressions for X and Y (they are two separate outputs) in terms of A, B , and C, simplify them.
|
A
|
B
|
C
|
X
|
Y
|
0
0
0
0
1
0
0
1
1
0
0
1
0
1
1
0
1
1
0
0
1
0
0
1
1
1
0
1
1
0
1
1
0
1
1
1
1
1
0
1
Submit the completed worksheet with D2L in PDF Format.
