Consider the four-variable Boolean function,
with '' as MSB and '' as LSB.
Which of the following expressions is/are the valid form(s) of ?
(Complement is printed as an overbar and is written here with \overline{}.)
- (A)
- (B)
- (C)
- (D)
Consider the four-variable Boolean function,
with '' as MSB and '' as LSB.
Which of the following expressions is/are the valid form(s) of ?
(Complement is printed as an overbar and is written here with \overline{}.)
ANSWER
Options (A) and (D) are both valid, and each is a minimal SOP form of . The only difference between them is how gets covered: (pairing it with ) or (pairing it with ).
Official answer: A, DSource: Official answer key, GATE 2026 EC (IIT Guwahati)
Write each minterm as (with as MSB): . So at . Complement is written here with .
K-map grouping of the 1s, the four corners: gives . This is a quad, so the term is .
K-map grouping of the 1s, the centre quad: gives , so the term is .
Only is still uncovered. It can pair with (common literals ), giving , or with (common literals ), giving . Both pairs contain only 1s, so there are two equally minimal SOP forms:
Check (A): , , . The union is exactly the nine given minterms and nothing else, so (A) is valid.
Check (D): . Together with the two quads the union is again exactly , so (D) is valid.
Check (B) and (C): both contain , which is , and . So both expressions output 1 where is 0. In addition, (B) misses and (its covers only ), and (C) has no term covering . Neither is valid.
Valid forms: (A) and (D).
KEY IDEA
Draw the K-map. The four corners give and the centre quad gives . After that, is the only 1 left, and it has two adjacent 1s ( and ). That gives two equally minimal covers, or . A function can have more than one minimal SOP. To test any option, list the minterms its terms cover and compare that set with the given one.
WATCH OUT FOR
Stopping at the first minimal cover you find () and marking only (A), without noticing that can also pair with , which makes (D) valid too. Another mistake is to judge (B) and (C) only by whether they cover every 1. Both also include , where .
From the GATE 2026 EC paper. Every question of this paper · Download the full paper · All 22 Boolean logic questions, with notes