Please explain how are you being confident of the option (a)?

The Gateway to Computer Science Excellence

+5 votes

Best answer

$a\bar d + \bar a \bar c+b \bar c d = \overset{m_8}{a\bar b \bar c \bar d} + \overset{m_{10}}{a\bar b c \bar d} +\overset{m_{12}}{a b \bar c \bar d} + \overset{m_{14}}{a b c \bar d} $

$\qquad + \overset{m_0}{\bar a \bar b \bar c \bar d} + \overset{m_4}{\bar a b \bar c \bar d}+ \overset{m_1}{\bar a \bar b \bar c d}+ \overset{m_5}{\bar a b \bar c d}$

$\qquad + \overset{m_5}{\bar ab \bar c d}+ \overset{m_{13}}{ab\bar c d}$

When we minimize a K-map, we can assume either $0$ or $1$ for don't cares. But here they have asked for the expression represented by the K-map. So we can consider $X$ as $1$ and not as a don't care. Also the given expression is equivalent to the above K-map but not the minimal one. Minimal expression will be $\bar a \bar c + b\bar c+ a\bar d.$

Hence, Option A.

+10 votes

0

But we can still derive this expression using (c) and (d) as well right? They didn't ask for a minimal don't care set of K-map or something.

Please explain how are you being confident of the option (a)?

Please explain how are you being confident of the option (a)?

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.6k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.5k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,834 questions

57,790 answers

199,486 comments

108,216 users