Flashcards on Half adder and full adder
Half Adder vs Full Adder: Digital Logic Explained for Students
Tap to flip · Swipe to navigate
Binary Adders
27 cards
Card 1
Question: What are the two digits used in binary numbers?
Answer: 0 and 1
Card 2
Question: What are the basic rules for binary addition?
Answer: 0 + 0 = 0 (Sum = 0, Carry = 0) 0 + 1 = 1 (Sum = 1, Carry = 0) 1 + 0 = 1 (Sum = 1, Carry = 0) 1 + 1 = 10₂ (Sum = 0, Carry = 1)
Card 3
Question: In binary addition, what does 1 + 1 equal and what do the bits represent?
Answer: 1 + 1 = 10₂. The '0' is the sum bit for the current position, and the '1' is a carry bit for the next higher position.
Card 4
Question: What is a half adder?
Answer: A combinational logic circuit that performs the addition of two single binary digits (bits) and produces a Sum (S) and a Carry-out (C_out).
Card 5
Question: Why is a half adder called 'half'?
Answer: Because it cannot take into account a carry bit from a previous, less significant bit position.
Card 6
Question: What are the inputs and outputs of a half adder?
Answer: Inputs: two bits (A and B). Outputs: Sum (S) and Carry-out (C_out).
Card 7
Question: What is the Boolean expression for the Sum (S) output of a half adder?
Answer: S = A ⊕ B (A XOR B)
Card 8
Question: What is the Boolean expression for the Carry-out (C_out) output of a half adder?
Answer: C_out = A · B (A AND B)
Card 9
Question: Which logic gates can be used to implement a half adder?
Answer: One XOR gate and one AND gate.
Card 10
Question: What is a full adder?
Answer: A combinational logic circuit that adds three single binary digits: two input bits (A and B) and a Carry-in (C_in) bit.