IAE Academy

GATE 2025 CS1 Q.42: solution and answer

GATE 2025 · CS1Q.42 · 2 marks · MCQ

Consider the following four variable Boolean function in sum-of-product form

.

where the value of the function is computed by considering as a 4-bit binary number, where denotes the most significant bit and denotes the least significant bit. Note that there are no don't care terms. Which ONE of the following options is the CORRECT minimized Boolean expression for ?

  1. (A)

  2. (B)

  3. (C)

  4. (D)

See the question in the paper

Answer and solution

ANSWER

The correct minimized expression is , which is option (A).

Official answer: ASource: Official answer key, GATE 2025 CS1 (IIT Roorkee)

  1. Write the minterms in binary (): , , , , , , .

  2. Karnaugh map, rows and columns in Gray order (00, 01, 11, 10):

  3. The quad has and in every cell, so it gives the prime implicant .

  4. The quad has and in every cell, so it gives the prime implicant .

  5. Minterm 11 () is not covered yet. Its neighbours differ in one bit: (10), (9), (15), (3). Only 10 is a minterm, so the pair is the only grouping for it. It gives , which is essential.

  6. Minterms 4 and 12 are covered only by the quad , and 2 only by . Both quads are therefore essential as well. Minimal cover: . It covers , which is all 7 minterms and nothing else. This is option A.

  7. Check the other options. B misses minterm 11, because makes both of its terms 0. C's term is true only for and , which are not minterms, and C leaves 4, 12 and 11 uncovered. D contains , which is true for 0 to 7, so it is true at the non-minterms 1, 3, 5, 6, 7, and it misses 11 and 12.

KEY IDEA

Draw the K-map and take the essential prime implicants: the quads and , plus the pair for the one minterm (11) that no quad reaches.

WATCH OUT FOR

Stopping after the two quads and choosing option B, which leaves minterm 11 uncovered. Another slip is accepting a term that is true at a non-minterm, such as in option D.

From the GATE 2025 CS1 paper. Every question of this paper · Download the full paper · All 37 Boolean logic questions, with notes

More Boolean logic questions