Question 3Asked in UGC NET Computer Science, August 2016 (Paper II & III, Selected Questions)

The Karnaugh map for a Boolean function is given as C'D' C'D CD CD'

The Karnaugh map for a Boolean function is given as C'D' C'D CD CD' A'B' 0 0 0 0 A'B 0 0 1 0 AB 1 1 1 1 AB' 0 1 1 1 The simplified Boolean equation for the above Karnaugh Map is
  1. AAB + CD + AB' + AD
  2. BAB + AC + AD + BCD
  3. CAB + AD + BC + ACD
  4. DAB + AC + BC + BCD
Show answerHide answer

Correct answer: (B) AB + AC + AD + BCD

Explanation

Grouping the 1s of the K-map: row AB gives AB; the cells with A = 1 and D = 1 give AD; the cells with A = 1 and C = 1 give AC; and cell A'BCD is covered by BCD. Therefore f = AB + AC + AD + BCD.

From UGC NET Computer Science PYQ, August 2016 (Paper II & III, Selected Questions)

This is question 3 of UGC NET Computer Science PYQ, August 2016 (Paper II & III, Selected Questions). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.