A Boolean function is given as . The reduced form of is
- (A)
- (B)
- (C)
- (D)
A Boolean function is given as . The reduced form of is
ANSWER
, which is option (B).
Official answer: BSource: Official answer key, GATE 2025 IN (IIT Roorkee)
Complement is written with throughout. Factor out the common literal first:
Apply De Morgan's theorem to the product :
Apply De Morgan's theorem again, to the sum: . Therefore
Check with minterms (taking as the most significant bit). only when and , are not both 1, so . Hence : minterms 4 to 7 are exactly , and minterm 3 is . So (absorption: ).
Rule out the other options with a single input each. At we have , but (A) and (C) , so both are wrong. At we have , but (D) , so (D) is wrong. The answer is option (B), .
KEY IDEA
Factor first, then complement: , and De Morgan applied twice gives . De Morgan turns a complemented product into a sum of complements, and a complemented sum into a product of complements.
WATCH OUT FOR
Complementing each literal but keeping the AND/OR operators, which gives . The other slip is doing De Morgan only halfway and writing or (option A). Both and have to swap when you complement.
From the GATE 2025 IN paper. Every question of this paper · Download the full paper · All 22 Boolean logic questions, with notes