Difficulty: Easy
Correct Answer: half adder and full adder
Explanation:
Introduction / Context:Adders are foundational to arithmetic units, counters, checksum generators, and digital signal processing blocks. Understanding the elemental adder cells clarifies how wider adders and ALUs are constructed.
Given Data / Assumptions:
Concept / Approach:A half adder adds two single-bit operands and produces a sum and a carry (no carry-in). A full adder extends this by including a carry-in input, allowing chaining to create multi-bit ripple or look-ahead adders. Parallel adders are assemblies of full adders; they are not a different “basic type.”
Step-by-Step Solution:
Half adder: inputs A, B; outputs Sum = A ⊕ B, Carry = A * B.Full adder: inputs A, B, Cin; outputs Sum = A ⊕ B ⊕ Cin; Cout = majority(A, B, Cin).Chain N full adders to form an N-bit parallel adder (ripple or with carry acceleration).Verification / Alternative check:Standard logic libraries and textbooks specify these two as primitive adder cells; all larger adders decompose to these functions.
Why Other Options Are Wrong:
Common Pitfalls:Confusing architectural composition (“parallel adder”) with primitive cells; conflating numeric representations with hardware blocks.
Final Answer:half adder and full adder
Discussion & Comments