GATE MSQs: How to Avoid Option Traps

A Multiple Select Question can look like a test of how many options you can spot. It is really a test of whether you can judge each statement on its own. Selecting one extra option—or overlooking one correct statement—can turn a nearly complete response into zero, so use a repeatable elimination protocol instead of guessing the answer pattern.

Know the scoring rule before you practise

For GATE 2027, the official paper-pattern page says MSQs have no negative marking and no partial marking. To earn the marks, select every correct option and no incorrect option. In other words, “I got most of them right” does not earn a fraction of the marks.

The official GATE 2027 question-paper pattern is the source to check for the current cycle. GATE 2026’s official master question papers and answer keys state the same all-correct, no-wrong-option rule.

This is why partial-option traps matter: an option that seems “probably true” can spoil an otherwise correct set. No negative marking also does not mean that MSQs award partial credit. Confirm the current year’s instructions before the exam in case a future cycle changes its scheme.

The elimination protocol

Use the same sequence for every MSQ. The goal is not to find one attractive answer quickly; it is to classify every option as supported, disproved or unresolved.

2. Read the stem for scope

3. Underline words such as all, some, only, always, must, can, for every and there exists. Note the domain, assumptions, input constraints and what the question asks you to identify.

5. Turn each option into a separate claim

6. Temporarily ignore the other options. Ask: “What would have to be true for this statement to hold?” This prevents one plausible option from making its neighbours feel correct by association.

8. Try to disprove universal claims

9. If an option says something is true for every input, look for a boundary case or counterexample. One valid counterexample is enough to eliminate a universal claim. For an existential claim, one valid example can establish it.

11. Check the theorem’s conditions

12. Do not apply a familiar result until you verify its assumptions. For example, a conclusion for a connected graph may fail when the question permits disconnected graphs; a statement about positive values may fail at zero or for negative values.

14. Record a reason, not a feeling

15. Beside each letter, write a short proof, counterexample, or question mark. “Seems right” is not evidence. If time allows, substitute a small value or trace a tiny example to test the claim.

17. Audit the selected set

18. Before submitting, read the stem again and confirm that every supported option is selected and every disproved one is left out. Do not assume there are two correct answers, or that the choices follow a pattern from earlier questions.

A compact working table can keep this disciplined:

A quick example: test claims independently

Suppose a practice question defines f(x) = x² for real x, with codomain R, and asks which statements are true:

• A. f is one-to-one.

• B. f is onto R.

• C. f is even.

• D. f(x) ≥ 0 for every real x.

Check each claim rather than trying to guess how many answers the examiner intended. A is false because f(−1) = f(1). B is false because no real input maps to −1. C is true because f(−x) = (−x)² = x² = f(x). D is true because a real square cannot be negative. The correct set is C and D.

Notice what made the elimination reliable: the domain and codomain were explicit, and each choice had its own short justification. If the codomain had been [0, ∞) instead of R, option B would have changed. Always use the question’s exact conditions.

Common option traps and how to catch them

• A familiar theorem with a missing condition: Write down the theorem’s hypotheses before using its conclusion.

• A statement that is true in one example: One example cannot prove “for all.” Try to prove the general statement or find a counterexample.

• A quantifier swap: “Every input has some output” is not the same as “there is one output for every input.” Translate the sentence carefully.

• An unnoticed boundary case: Test the smallest allowed size, zero, negative values, equality, an empty set, or a disconnected structure when the stem permits it.

• A dependent option: A choice may look right only if another choice is assumed true. Evaluate the underlying claims, not the letters as a bundle.

• A misleading answer-count guess: The number of selections is not evidence. Never select or reject an option merely to make the set look balanced.

What to do when one option is unresolved?

Return to the exact words in the stem and identify what is missing from your reasoning. Is there a domain condition you skipped? Can a small counterexample settle it? Is the option claiming necessity, sufficiency, equivalence, or just possibility? Those phrases require different proof obligations.

If you cannot resolve the claim within your time limit, mark the question to revisit and continue. On the second pass, spend time only where a concrete test can change your decision. Before submission, check the selected letters against your written evidence. The no-negative-marking rule may make an attempt worth considering, but it does not make an unsupported option safe: the all-or-nothing MSQ rule still applies.

Turn every miss into a better rule

After a mock or past-paper session, review MSQs by why an option fooled you: missed assumption, weak theorem recall, faulty counterexample, rushed reading, or unsupported extra selection. Write one short correction beside the question, then solve it again later without looking at your earlier answer. This trains the decision process, not just recognition of a memorised key.

For more preparation, browse the GATE category on KnowledgeGate and the GATE Guidance course. You can also read our GATE study plan for working professionals and GATE CS versus ISRO CS syllabus overlap guide. Practise the protocol on official past papers, and follow the current GATE instructions for the exam cycle you are taking.

https://www.linkedin.com/feed/update/urn:li:activity:7511666555429167106