H8: Adders & Multipliers

Time Estimate1-2 hours   Grade Impact1%   DueOct 23 @ 12pm  

Revised Edition: This assignment was revised on 2026-09-29. If you completed the original version, you may still submit it for credit.


Exercises

  1. Design a full adder using universal (NAND or NOR) gates. Show how the carry-out is formed from the three input bits and simplify your expressions as much as possible.

  2. Show the process of adding the two 5-bit binary numbers (in two’s complement) 10110 and 01111 using a ripple-carry adder. Show each intermediate carry and sum bit, and give the final result in both binary and decimal.

  3. For signed 4-bit two’s complement addition, determine whether overflow occurs for each case below. Explain your reasoning using carry into and out of the sign bit.
    a. 0101 + 0011
    b. 0111 + 0001
    c. 1100 + 1011

  4. A full adder can be written as $S = A \oplus B \oplus C_{in}$ and $C_{out} = AB + AC_{in} + BC_{in}$. Show that the carry expression can also be written as $C_{out} = AB + C_{in}(A \oplus B)$. Verify the equivalence algebraically.

  5. Multiply the 4-bit two’s complement numbers 1101 and 0011. Check your work by converting each number to decimal, perform the multiplication, and express the result in binary using enough bits to avoid overflow.