Multiple choice

Two nibble adder can be implemented by (without initial carry)

  1. 4 full adderscomplementary

  2. 3 full adder and a half adder

  3. 4 half adder

  4. 2 half and 2 full adders
Reveal answer Fill a bubble to check yourself
B Correct answer
Explanation

A nibble is 4 bits. When adding two 4-bit numbers without an initial carry, the least significant bit (LSB) position only needs a half adder since there's no carry-in. The remaining 3 bit positions each require a full adder to handle the carry-out from the previous stage. Therefore, 3 full adders and 1 half adder are needed.

Keep practicing — related questions