GATE CS 2014 Set 3 — Question 17

MCQ+1 / -0.33EasyK-Map MinimizationBoolean Algebra & Logic GatesDigital Logic

Digital Logic → Boolean Algebra & Logic Gates → K-Map Minimization

Last updated 5 September 2026

Question

F

m(0, 5, 10, 15)

Review answer and solution without JavaScript

Interactive answer checking needs JavaScript. The published solution is available below.

m(0, 5, 10, 15)

$PQ \setminus RS$	00	01	11	10
00	$1$ ( $m_0$ )	$0$	$0$	$X$ ( $d_2$ )
01	$0$	$1$ ( $m_5$ )	$X$ ( $d_7$ )	$0$
11	$0$	$X$ ( $d_{13}$ )	$1$ ( $m_{15}$ )	$0$
10	$X$ ( $d_8$ )	$0$	$0$	$1$ ( $m_{10}$ )

Continue learning with Success Tracker

Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.

AI-powered practice· Unlimited practice on eligible plans

PYQs with solutions: Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
Practice that adapts: Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
AI doubt support: Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.

Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.

This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.