GATE CS 2026 Set 1 — Question 48

Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.
MSQ+2 / -0MediumK-Map MinimizationBoolean Algebra & Logic GatesDigital LogicSOP & POS Forms

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

Last updated

Question

Consider a Boolean function FF with the following minterm expression:F(P,Q,R,S)=m(1,2,3,4,5,7,10,12,13,14)F(P, Q, R, S) = \sum m(1, 2, 3, 4, 5, 7, 10, 12, 13, 14)Which of the following options is/are the minimal sum-of-products expression(s) of FF?
Your answer

Select all that apply, then check your answer.

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