IAE Academy

GATE 2026 CS2 Q.40: solution and answer

GATE 2026 · CS2Q.40 · 2 marks · MCQ

Consider the following 4-variable Boolean function

Consider as MSB, as LSB. Which one of the following options represents the minimal sum of products form for the above function?

Note: is OR operation, is AND operation, is NOT operation

  1. (A)

  2. (B)

  3. (C)

  4. (D)

See the question in the paper

Answer and solution

ANSWER

The minimal sum of products is , option (B).

Official answer: BSource: Official answer key, GATE 2026 CS2 (IIT Guwahati)

  1. Write each minterm as : .

  2. In all eight minterms , while , and take every combination of values. The function is therefore 1 exactly when : the eight listed minterms are precisely the eight input combinations with .

  3. K-map (rows , columns in Gray order 00, 01, 11, 10):

  4. Rows and are adjacent on the map (the top and bottom edges wrap around), so all eight 1s form one group of 8, which cannot be enlarged because every other cell is 0.

  5. In that group , and each take both values, and only stays fixed, so the group is .

  6. Algebraic check: . The bracket equals 1, so .

  7. Truth-table check of the other options: (A) is 1 for the input where ; (C) gives 0 at minterm 8 () where ; (D) is 0 at minterm 8 where . Only matches on all 16 inputs.

  8. The minimal sum of products is , a single literal, which is option (B).

KEY IDEA

When the minterm list is exactly every combination of some variables with the remaining variable fixed, the function collapses to that single literal. Here the eight minterms are all inputs with , so .

WATCH OUT FOR

Picking (D) because the first four minterms (0 to 3) have , and forgetting that minterms 8 to 11 have . Another slip is missing that the top and bottom K-map rows are adjacent, so the two blocks of four merge into one group of eight.

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

More Boolean logic questions