and are two 2-bit unsigned binary numbers. If is a Boolean function such that only when , and otherwise, then can be minimized to the form ________
- (A)
- (B)
- (C)
- (D)
and are two 2-bit unsigned binary numbers. If is a Boolean function such that only when , and otherwise, then can be minimized to the form ________
ANSWER
, option (B).
Official answer: BSource: Official answer key, GATE 2022 IN (IIT Kharagpur)
Complement is written with . List the pairs with , in decimal : . These are the 6 minterms of .
Comparator logic, MSB first: if , or if and .
K-map grouping: (, ) is a quad covering . Two minterms are left: and .
Make each leftover's group as large as possible. pairs with to give . pairs with to give . Neither pair can grow: dropping any literal brings in a 0-cell such as , , , or . So both are prime implicants.
One group cannot cover both leftovers. The only literals they share are , and that term is also 1 at , where . Also, is the only prime implicant covering , the only one covering , and the only one covering . All three are essential, so the minimal form is
Check the other options. (A) is 0 at because there, so it misses that minterm. (C) is 0 at and because there. In (D), the term is 1 at , a false 1, and (D) also misses . Only (B) is correct.
KEY IDEA
A comparator reads MSB first. when , or when the MSBs are equal and . On the K-map, the quad covers four of the six 1-cells. The other two, and , each need their own essential prime implicant: and .
WATCH OUT FOR
Two mistakes are common. One is stopping at (A): its terms handle and , but not , which needs . The other is choosing (D): writing instead of in the third term makes at , which is wrong because .
From the GATE 2022 IN paper. Every question of this paper · Download the full paper · All 22 Boolean logic questions, with notes