Given a single 3:8 active high output decoder. What is the minimum number of 3-input OR gates required to implement a one bit Full adder?
- (A)
2
- (B)
5
- (C)
4
- (D)
3
Given a single 3:8 active high output decoder. What is the minimum number of 3-input OR gates required to implement a one bit Full adder?
2
5
4
3
ANSWER
The minimum number of 3-input OR gates required is 4, option (c).
Official answer: CSource: ISRO's revised and final answer key of 16 February 2024
Connect the full-adder inputs to the select lines of the active-high decoder. Output is then high exactly when the input combination is , so is the minterm .
Sum: , which is the OR of four decoder outputs .
Carry: , which is the OR of four decoder outputs .
A 3-input OR gate has only 3 inputs, so it cannot combine 4 signals alone. Each output therefore needs at least 2 gates.
Two gates are enough for each output: the first gate ORs three of the decoder outputs, and the second gate ORs that result with the fourth decoder output (its third input is unused). So each output needs exactly 2 gates.
The two minterm sets share only . A gate shared by and would have to OR two or more common decoder outputs, and there is only one common output. The decoder is active high, so no complemented outputs are available to help. No OR gate can be shared, so the gate counts add.
Total three-input OR gates, which is option (c).
KEY IDEA
A 3:8 decoder produces every minterm, so the sum and carry of a full adder are each the OR of four minterms. A 3-input OR gate needs two gates to combine four signals, and the two outputs share no gate.
WATCH OUT FOR
Counting only one output, or assuming the two outputs can share an OR gate. They have only in common, so nothing can be shared, and each four-term OR needs two 3-input gates.
From the ISRO EC 2023 paper. Every question of this paper · The full paper (PDF, ISRO) · All 6 ISRO Combinational questions, with notes