Question 5 (1 point) What if we want to detect whether or not overflow occurred as a result of adding two positives? We can modify our simple 4 bit adder from before to capture overflow output. Which of the following diagrams would capture overflow from signed addition of two positives? Which would capture overflow from unsigned addition for two positives? Of the two, does one take longer than the other to detect, or do they take the same amount of time? (See the 4 diagrams below) #1 A3 B3 A2B2 A1 B1 AO BO 7 cn Cout – Full adder Cin Cin Full Cin Full adder cine Full adder cine se Full adder – Cin = 0 #2 A3 B3 A2B2 A1 B1 AO BO Cin Cin Cin Full adder Full adder Full adder Full adder – Cin = 0 #3 A3 B3 A2B2 A1 B1 А во Cin Cin Cin Cout – Full adder Full adder Full adder Full adder – Cin = 0 A3 B3 A2B2 A1 B1 де во Cin Cin Cout – Full adder Full adder Full adder Full adder Cin = 0 A. Signed addition is #2, unsigned is #1, and they have the same gate delay B. Signed addition is #1, unsigned is #4, and signed addition has a longer gate delay C. Signed addition is #3, unsigned is #4, and signed addition has a longer gate delay D. Signed addition is #3, unsigned is #3, and they have the same gate delay E. Signed addition is #3, unsigned is #2, and they have the same gate delay Answer Show transcribed image text Question 5 (1 point) What if we want to detect whether or not overflow occurred as a result of adding two positives? We can modify our simple 4 bit adder from before to capture overflow output. Which of the following diagrams would capture overflow from signed addition of two positives? Which would capture overflow from unsigned addition for two positives? Of the two, does one take longer than the other to detect, or do they take the same amount of time? (See the 4 diagrams below) #1 A3 B3 A2B2 A1 B1 AO BO 7 cn Cout – Full adder Cin Cin Full Cin Full adder cine Full adder cine se Full adder – Cin = 0 #2 A3 B3 A2B2 A1 B1 AO BO Cin Cin Cin Full adder Full adder Full adder Full adder – Cin = 0

#3 A3 B3 A2B2 A1 B1 А во Cin Cin Cin Cout – Full adder Full adder Full adder Full adder – Cin = 0 A3 B3 A2B2 A1 B1 де во Cin Cin Cout – Full adder Full adder Full adder Full adder Cin = 0 A. Signed addition is #2, unsigned is #1, and they have the same gate delay B. Signed addition is #1, unsigned is #4, and signed addition has a longer gate delay C. Signed addition is #3, unsigned is #4, and signed addition has a longer gate delay D. Signed addition is #3, unsigned is #3, and they have the same gate delay E. Signed addition is #3, unsigned is #2, and they have the same gate delay Answer

## Expert Answer

Answer to Question 5 (1 point) What if we want to detect whether or not overflow occurred as a result of adding two positives? We …