GATE CS 2017 Set 1 — Question 21

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
NAT+1 / -0MediumK-Map MinimizationBoolean Algebra & Logic GatesDigital LogicUniversal Gates (NAND, NOR)

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

Last updated

Question

Consider the Karnaugh map given below, where X represents "don't care" and blank represents 0.
Karnaugh map with variables ba on columns and dc on rows
Assume for all inputs (a,b,c,d)(a, b, c, d), the respective complements (aˉ,bˉ,cˉ,dˉ)(\bar{a}, \bar{b}, \bar{c}, \bar{d}) are also available. The above logic is implemented using 2-input NOR gates only. The minimum number of gates required is ________ .
Your answer

Enter a number. Decimals, negative values and scientific notation are accepted.

The solution stays hidden until you check.

Continue learning with Success Tracker

A step still unclear? Work through it with support

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.

More questions on Boolean Algebra & Logic Gates