Lab 2 worksheet gates-circuits PDF

Preview

Summary

weekly assignment...

Description

Gates, Circuits, Boolean Algebra, and Truth Tables Applets link: Lab manual applets: : http://faculty.mc3.edu/pvetere/Applets/ 

In the questions below you are to use the LOGIC GATE SIMULATOR APPLET when applicable.



The exercises 1 to 4 below are based on LabCH06.pdf from the “Explorations in Computer Science, 3nd Edition” lab manual and textbook Chapter 4 Gates and Circuits

Exercise 1, LabCH06.pdf [8 marks] 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

0

0

1

1

1

0

1

1

1

0

Insert 4 screenshots of the circuit corresponding to each of the 4 input combinations listed above

Page 1

Exercise 2, LabCH06.pdf [6 marks] Draw a circuit with two inputs A, B and one output that corresponds to Not (A xor B). Run the circuit with all possible input values as given in the table below to complete the truth table for the Not XOR gates. Attach a screen shot. Complete the following truth table for the circuit: A

B

Not (A xor B)

0

0

1

0

1

0

1

0

0

1

1

1

Describe in words what this circuit does. The circuit makes it so when the variables are inputted as the same value then they equal to 1 and when they are inputted as different values they are equal to 0.

Exercise 3, LabCH06.pdf [8 marks] Do exercise 3 of LabCH06.pdf from the lab manual.

Page 2

Page 3

Exercise 4, LabCH06.pdf [8 marks] Insert a screenshot of your final “Full Adder” circuit. See the text book chapter 4 the topic of Adders. You will need to use 2 truth tables given in the text book. The Truth Tables are given on page 109 in Ed 6 of the text. Note. Also see the Truth Table Example in the LOGIC GATE SIMULATOR Applet.

Boolean Algebra, Circuits, and Truth Tables 1. [4 marks] Draw a circuit diagram corresponding to the following Boolean expression. Take a screenshot and attach. (A'B + C)D

Page 4

Page 5

2. [8 marks] Draw a circuit diagram corresponding to the following Boolean expression. Take a screenshot and attach. ABC + C'B' Also show the truth table (you can use the applet to check your work).

Page 6

3. [4 marks] Simplify the following expression as much as possible using the properties of Boolean algebra (shown on p. 104 of the textbook): A'B + B'C + CB

A’B + CB + B’C A’B + C(B+B’) A’B + C

4. [4 marks] Simplify the following expression as much as possible using the properties of Boolean algebra (shown on p. 104 of the textbook): A'BC + AB'C + ABC + A'B'C'

A’BC + A’B’C’ + A(B’C + BC) A’BC + A’B’C’ + AC C(A’B + A) + A’B’C’ C(A+A’)(A+B) + A’B’C’ C(1)(A+B) + A’B’C’ C(A+B) + A’B’C’

Page 7

5. [10 marks] Draw the circuit diagram corresponding to the given truth table. Show all the steps of your work below and attach a screenshot of the circuit. A, B, C are input, X is the output. ABC’ + A’BC + A’B’C’

A B C X 1

1

1

0

1

1

0

1

1

0

1

0

1

0

0

0

0

1

1

1

0

1

0

0

0

0

1

0

0

0

0

1

[60 marks] Page 8...