University of Washington Bothell Hardware & Computer Organization Questions

User Generated

qbhmv888

Computer Science

University of Washington

Description


Q1. (6 points) A full-adder is a combinational circuit that forms the arithmetic sum of three input bits. It consists of three inputs, x, y, z, and two outputs, C and S. Two of the input, that is, x and y, represent the two significant bits to be added. The third input, z, represents the carry from the previous lower significant position. The output S denotes the sum of two bits and C denotes carry. Answer the following sub-questions.

1) Construct a truth table for the Full-Adder

2) Based on the truth table, construct a K-map for the output S and derive a Boolean equation using K-map. Make the equation as simple as possible.

3) Based on the truth table, construct a K-map for the output C and derive a Boolean equation using K-map. Make the equation as simple as possible.

4) By algebraic manipulation, show that S can be expressed as the exclusive-OR of the three input variables. That is, show that,

S = x XOR y XOR z.      

You can prove by deriving from S = x XOR y XOR z to the answer you got in the question 2)

5) By algebraic manipulation, show that C can be expressed as the following term.

            C = xy + (x XOR y)z.

You can prove by deriving from  C = xy + (x XOR y)z to the answer you got in the question 3)

6) Based on 4) and 5), draw a circuit for the full-adder in Logisim simulator, attach the image file and submit the circuit file!

Q2. (4 points) A sequential circuit has one D flip-flop and one JK flip-flop, two inputs x and y, and one output z. A is the output of D flip-flop, and B is the output of JK-flip-flop; A and B together form the "output state" of the circuit. The flip-flop input equations and the circuit output are as follows. Here DA is the D input of the D-flip flop of A, and JB, KB is the J and K input of the JK-flip flop of B.

DA = ~xy + yB

JB = ~yB + xy

KB = xB + ~yA

z = x+~xy

1) Draw the logic diagram of the circuit and test it with Logisim.

Please attach the circuit image and the generated table!

Please also submit the circuit file!
2) Construct a state diagram of this circuit.

Q3. (10 points) Design a system with the following state changes: This is a sequential circuit with three flip-flops. The state sequence is changed with a clock as in the order of, 111, 010, 100,110, 001, 011, 101, 000, 111 and repeat. Use JK flip-flops.

1) Draw a state diagram.

2) Construct an excitation table .

3) Draw K-maps and derive Boolean equations using K-maps. Make the equations as simple as possible.

4) Draw the system in Logisim simulator, attach the circuit image and submit the circuit file.

5) Test the system and attach the generated table.

User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

Explanation & Answer

View attached explanation and answer. Let me know if you have any questions.Hello buddy i hope you doing great in your academic study, hope this will help😄

Question 1. (6 points) A full-adder is a combinational circuit that forms the arithmetic sum of three input
bits. It consists of three inputs, x, y, z, and two outputs, C and S. Two of the input, that is, x and y,
represent the two significant bits to be added. The third input, z, represents the carry from the previous
lower significant position. The output S denotes the sum of two bits and C denotes carry. Answer the
following sub-questions.
1) Construct a truth table for the Full-Adder

2) Based on the truth table, construct a K-map for the output S and derive a Boolean equation using Kmap. Make the equation as simple as possible.

3) Based on the truth table, construct a K-map for the output C and derive a Boolean equation using Kmap. Make the equation as simple as possible.

4) By algebraic manipulation, show that S can be expressed as the exclusive-OR of the three input
variables. That is, show that,
S = x XOR y XOR z
You can prove by deriving from S = x XOR y XOR z to the answer you got in the question 2)
𝑆 = 𝑥 𝑋𝑂𝑅 𝑦 𝑋𝑂𝑅 𝑧
𝑆 = 𝑥⨁𝑦⨁𝑧
Let
𝑦⨁𝑧 = 𝑚
𝑆 = 𝑥⨁𝑚
If
𝑥𝑚 + 𝑥𝑚 = 𝑥⨁𝑚 ↔ 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 1
𝑆 = 𝑥𝑚 + 𝑥𝑚
𝑆 = 𝑥[𝑦⨁𝑧] + 𝑥[𝑦⨁𝑧 ]
If
𝑦𝑧 + 𝑦𝑧 = 𝑦⨁𝑧 ↔ 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 2
𝑦𝑧 + 𝑦𝑧 = 𝑦⨁𝑧 ↔ 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 3
𝑆 = 𝑥[𝑦𝑧 + 𝑦𝑧] + 𝑥[𝑦𝑧 + 𝑦𝑧]
𝑆 = 𝑥 𝑦𝑧 + 𝑥𝑦𝑧 + 𝑥𝑦𝑧 + 𝑥𝑦𝑧
5) By algebraic manipulation, show that C can be expressed as the following term.
C = xy + (x XOR y)z.
You can prove by deriving from C = xy + (x XOR y)z to the answer you got in the question 3)
𝐶 = 𝑥𝑦 + (𝑥 𝑋𝑂𝑅 𝑦)𝑧
𝐶 = 𝑥𝑦 + (𝑥𝑦 + 𝑥𝑦)𝑧
𝐶 = 𝑥𝑦 + 𝑥𝑦𝑧 + 𝑥𝑦𝑧
𝐶 = 𝑦(𝑥 + 𝑥𝑧) + 𝑥𝑦𝑧
If
𝑥 + 𝑥 𝑧 = 𝑥 + 𝑧 ↔ 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 4
𝐶 = 𝑦(𝑥 + 𝑧) + 𝑥𝑦𝑧
𝐶 = 𝑥𝑦 + 𝑦𝑧 + 𝑥𝑦𝑧
𝐶 = 𝑥𝑦 + 𝑧(𝑦 + 𝑥𝑦)
𝑦 + 𝑥𝑦̅ = 𝑦 + 𝑥 ↔ 𝑒𝑞𝑢𝑎𝑡𝑖𝑜𝑛 5
𝐶 = 𝑥𝑦 + 𝑧(𝑦 + 𝑥)
𝐶 = 𝑥𝑦 + 𝑦𝑧 + 𝑥𝑧

6) Based on 4) and 5), draw a circuit for the full-adder in Logisim simulator, attach the image file and
submit the circuit file!

Question 3. (4 points) A sequential circuit has one D flip-flop and one JK flip-flop, two inputs x and y, and
one output z. A is the output of D flip-flop, and B is the output of JK-flip-flop; A and B together form the
"output state" of the circuit. The flip-flop input equations and the circuit output are as follows. Here DA
is the D input of the D-flip flop of A, and JB, KB is the J and K input of the JK-flip flop of B.
DA = ~xy + yB
JB = ~yB + xy
KB = xB + ~yA
z = x+~xy
1) Draw the logic diagram of the circuit and test it with Logisim. Please attach the circuit image and the
generated table! Please also submit the circuit file!

Generated table

Generated table

2) Construct a state diagram of this circuit

Black Arrow = 0
Red arrow = 1

00

10

01

11

Q3. (10 points) Design a system with the following state changes: This is a sequential circuit with three
flip-flops. The state sequence is changed with a clock as in the order of, 111, 010, 100,110, 001, 011,
101, 000, 111 and repeat. Use JK flip-flops.
1) Draw a state diagram.
Sequence: (111, 010, 100,110, 001, 011, 101, 000, 111 and repeat)
111

010

000

101

100

011

110

001
2) Construct an excitation table .

3) Draw K-maps and derive Boolean equations using K-maps. Make the equations as simple as possible.
J2
0
1

00
1
x

01
0
x
𝐽2 = 𝑌 + 𝑍̅̅

11
1
x

10
1
x

K2
0
1

00
x
0

01
x
1

11
x
1

10
x
1

11
x
x

10
x
x

11
1
0

10
1
1

11
x
x

10
0
1

11
0
1

10...


Anonymous
Excellent! Definitely coming back for more study materials.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4

Related Tags