GATE GUIDE

Common Mistakes That Cost Marks in GATE CSE and How to Avoid Them

By MD ANISH AHAMADUpdated 17 Sep 20268 min read

Many of the marks lost in GATE CSE have nothing to do with hard questions. They go to predictable errors: a blind MCQ guess, one extra tick in an MSQ, a unit slip in a NAT answer, or a textbook reflex applied to a question that quietly changed the rule. Each one has a fixed correction. Learn the corrections, practise them in mocks, and you keep marks you have already earned.

In this guide
  1. Key takeaways
  2. Mistakes in how you attempt the paper
  3. NAT answer mistakes
  4. Subject traps that repeat
  5. When a familiar concept comes with a changed rule
  6. A small illustration
  7. How to stop repeating the same mistakes

Key takeaways

Mistakes in how you attempt the paper

Guessing MCQs blind

Only MCQs carry negative marks: −1/3 for a wrong 1-mark answer and −2/3 for a wrong 2-mark answer. Here is the expected value of a guess:

Options eliminated Chance of a correct guess Expected value, 1-mark MCQ Expected value, 2-mark MCQ
None 1/4 0 0
One 1/3 +1/9 +2/9
Two 1/2 +1/3 +2/3

A blind guess gains nothing on average. Guessing after eliminating even one option is worth it. Leaving a NAT blank while guessing a 2-mark MCQ blind has the order backwards. The NAT guess costs nothing, while the blind MCQ guess gains nothing.

Over-selecting in MSQs

An MSQ pays only when you pick exactly the correct set of options, with no partial credit. At least one option is always correct, and all four may be. Judge each option on its own and select only what you can justify. If one option cannot be decided, leave that question for last. The MCQ, MSQ and NAT strategy guide covers each type in depth.

Sinking time into one question

Spending more than five minutes on a single question in the first pass is the most common reason for an unfinished paper. Budget about 1.5 minutes for a 1-mark question and 3 minutes for a 2-mark question. If you have no plan within 60–90 seconds, mark the question and move on. Two 1-mark questions are worth the same as one 2-mark question.

Misreading under pressure

NAT answer mistakes

NAT answers are typed on a virtual keypad with no options to check against, so small slips go uncaught.

The exam pattern and marking scheme article explains how each question type is scored.

Subject traps that repeat

Each trap below comes from GATE's recurring question patterns, with the rule that avoids it.

Subject The trap The correct rule
Mathematics Counting reflexive-and-symmetric relations as 2^(n(n + 1)/2) Reflexivity fixes the diagonal: 2^(n(n − 1)/2)
Mathematics Using a per-hour Poisson rate for a 10-minute window Rescale the rate to the interval asked
Digital Logic Bias 128, or forgetting the implicit 1 in IEEE-754 Bias 127 (single) or 1023 (double); implicit 1 for normalised values
Digital Logic Missing a K-map group that wraps around the edges or corners Check the four corners and the edge columns
COA Using k × n cycles for a pipeline (k + n − 1) cycles, plus stalls
COA Mapping a block with mod (number of lines) Use mod (number of sets)
PDS Reading *p++ as (*p)++ Postfix ++ binds tighter: *(p++)
PDS Treating % of a negative operand as a mathematical modulus The result takes the sign of the dividend
Algorithms Assuming a constant added to every edge preserves shortest paths It does not; it preserves the MST
Algorithms Unique MST implies distinct weights False; only the converse holds
TOC Complement of a CFL is a CFL Not in general; true for DCFLs
TOC Binary numbers divisible by 6 need a 6-state DFA The minimum DFA has 4 states
Compiler Design Putting ε in a FOLLOW set ε never appears; $ is in FOLLOW of the start symbol
Compiler Design LALR has fewer states than SLR Same count as LR(0) and SLR; fewer than CLR
OS Queueing the preempted process before a new arrival at the same instant in round robin The new arrival goes first (GATE convention)
OS Applying Belady's anomaly to LRU Only FIFO-type algorithms; LRU and Optimal are immune
DBMS A > ALL condition over an empty subquery is false It is true for every outer row
DBMS COUNT(col) counts NULLs COUNT(*) counts rows; COUNT(col) skips NULLs
Networks Fragment offset in bytes Offset is in 8-byte units
Networks Reno restarts cwnd from 1 on a triple duplicate ACK Reno sets cwnd = ssthresh = cwnd/2; Tahoe restarts at 1
General Aptitude +20 % then −20 % leaves the value unchanged The net change is −4 %

This table holds 21 traps. The book's last-minute revision sheet lists 85, subject by subject, along with 28 common mistakes, frequently confused concept pairs and edge cases. Its do-not-skip list also pairs each of its 160 concepts with the trap that most often costs the marks. See the full book.

When a familiar concept comes with a changed rule

Since 2021, GATE papers have often set familiar concepts in unfamiliar settings: a DP with an extra constraint, a graph algorithm with a modified rule, a scheduling policy with a twist. The mistake is to answer from memory of the textbook version. A safer routine:

  1. Read the definition twice and restate it in one line.
  2. Map it to the nearest concept you know, but do not assume the standard result applies.
  3. Test the rule on the smallest case: n = 1, n = 2 or the empty input.
  4. For a modified algorithm, run the modified rule on the given instance.
  5. If it is still unclear after 90 seconds, mark it and move on. These are often 2-mark NATs with no penalty for returning later.

Some classic examples: Dijkstra can fail with a negative edge, but on a particular graph it may still be correct, so run it rather than reciting "fails". A syntax-directed translation may redefine operators or use right recursion, so evaluate it with the grammar's associativity, not arithmetic habit. And three-valued logic makes the intuitive answer to an SQL query with NULLs wrong, so evaluate row by row.

A small illustration

Here is a trap built on an off-by-one. Three processes each need at most 4 units of one resource type. How many units make deadlock impossible?

With 9 units, each process can hold 3 and wait for a fourth that never comes, so deadlock is still possible. The rule is n(k − 1) + 1 = 3 × 3 + 1 = 10 units. Stopping at n(k − 1) is exactly the mistake the question is built to catch. Many GATE traps work this way: the formula is familiar, and the marks go to whoever remembers the +1.

How to stop repeating the same mistakes

Accuracy work pays well. Turning three wrong 2-mark MCQs into skips gains two marks, and turning them into correct answers gains eight. The book's ten full mocks include a trap-heavy paper built around the misconceptions GATE re-tests (NULL in SQL, negative edges, Belady, MSQ over-selection, C precedence and IEEE-754 rounding), with full worked solutions. Get the book.

Frequently asked questions

What are the most common mistakes in GATE CSE?

The costliest are guessing MCQs with no option eliminated, ticking one extra option in an MSQ, unit and rounding slips in NAT answers, and spending more than five minutes on one question in the first pass. Subject traps add to these, such as NULL inside NOT IN in SQL, Belady's anomaly applied to LRU, or the wrong window limit for selective repeat.

Is there negative marking for MSQ and NAT questions in GATE CSE?

No. Negative marking applies only to MCQs, at minus one third of a mark for a wrong 1-mark MCQ and minus two thirds for a wrong 2-mark MCQ. MSQ and NAT carry no penalty, but an MSQ gives marks only when you select exactly the correct set of options, with no partial credit.

Should I guess MCQ answers in GATE CSE?

Only when you can eliminate at least one option. A blind guess among four options has an expected value of exactly zero because of negative marking. With one option eliminated the expected gain is positive, and with two eliminated it is worth a third of a mark on a 1-mark question and two thirds on a 2-mark question.

How can I avoid silly mistakes in GATE NAT questions?

Write the unit next to every number, carry full precision and round only the final answer to the stated decimals, and check that you are answering the quantity asked, such as hits rather than faults or bytes rather than bits. Enter the number only, with a minus sign if negative, and no units or commas.

Why do I lose marks in GATE mock tests even when I know the concepts?

Usually because of conventions, traps and pacing rather than missing knowledge. Log every wrong, skipped and slow question by subtopic and by cause, such as a trap, a unit slip or overspent time. After about three mocks the pattern becomes clear, and that log becomes the most useful revision list you have.

Sources

Dates, fees and the syllabus are set by the GATE 2027 organising institute and can change. Always confirm at gate2027.iitm.ac.in.

Keep reading

GATE CSE 2027 book1,016 pages · ₹250 ₹300
Buy now — ₹250