Difference between revisions of "CSC270 Homework 3 2016"
(→Problem 1) |
(→Problem 1) |
||
| Line 4: | Line 4: | ||
=Problem 1= | =Problem 1= | ||
<br /> | <br /> | ||
| − | Below is a 32-bit binary adder. We have seen it in class. It outputs ''a''+''b'', where ''a'' is represented | + | Below is a 32-bit binary adder. We have seen it in class. It outputs ''a''+''b'', where ''a'' is represented by ''a''<sub>31</sub>...''a''<sub>0</sub>, and ''b'' by ''b''<sub>31</sub>...''b''<sub>0</sub>. |
<br /> | <br /> | ||
[[Image:BinaryAdder.png|700px|center]] | [[Image:BinaryAdder.png|700px|center]] | ||
Revision as of 20:21, 9 February 2016
--D. Thiebaut (talk) 20:13, 9 February 2016 (EST)
Problem 1
Below is a 32-bit binary adder. We have seen it in class. It outputs a+b, where a is represented by a31...a0, and b by b31...b0.
- Question 1
-
- Using this design as inspiration, design a 32-bit subtraction circuit, that will output a-b, if a and b are the two integers whose bits are shown in the diagram.
