GATE CSE — Exam Survival Guide (Computer Science & IT)

Window: India + global CS grads | Format: 65 questions, 100 marks, 3 hours; mix of MCQ, MSQ, NAT; GA 15, Engg Maths ~13, core CS ~72

Must-do topics

GATE CSE = “Can you think like a solid CS undergrad under exam pressure?”

High-weight CS core (average pattern)

Data Structures & Algorithms: complexity, trees, heaps, hashing, DP, graphs, greedy.

Theory of Computation: DFAs/NFAs, regular expressions, CFGs, pumping lemmas, decidability.

Operating Systems: processes/threads, scheduling, deadlocks, memory management, virtual memory.

Computer Networks: OSI/TCP-IP, IP, TCP/UDP, routing, congestion, link-layer behaviour.

DBMS: ER → relational mapping, SQL, normalisation, transactions & locking.

Computer Organisation: number systems, ALU, pipelining, memory hierarchy, cache mapping.

Engineering Mathematics (~13 marks)

Linear algebra, probability, random variables, single/multi-variate calculus basics, numerical methods.

General Aptitude (GA) (15 marks)

English, basic reasoning, data interpretation — free marks if you practice.

Top traps (avoid)

Leaving GA and Maths for “later” and then leaking 20–25 marks on easy stuff.

Grinding rare topics but weak on classic 2-mark conceptual questions (OS, CN, TOC, DSA).

Not practising NAT: losing marks because speed/accuracy on calculations is poor.

Guessing too aggressively on MCQs and bleeding marks on negative marking.

Time split

180 minutes, 65 questions, 100 marks.

Rough pattern:

30 × 1-mark, 35 × 2-mark, mix of MCQ/MSQ/NAT.

Target strategy:

20–25 min for GA + “free” 1-mark CS questions.

Rest on 2-mark conceptual + NAT, leaving 10–15 min at the end for revisits.

Last-48h checklist

No new books. Do:

1 full-length paper (or at least 2×90-min halves) in exact exam conditions.

Rapid sheets:

DSA patterns, OS scheduling & deadlock conditions, CN formulas (throughput, delay), TOC decision trees (regular? context-free? decidable?).

NAT tuning:

Practise at least 20 NAT-type questions per day; check how often silly arithmetic mistakes cost marks.

Quick frames

For each technical question:

What is the core concept being tested? (e.g., mutual exclusion, BFS/DFS, DFA closure, normal form).

Can I reduce it to a known pattern? (e.g., classic deadlock problem, shortest path, page replacement).

Is brute force safe or do I need a smarter trick?

For MSQ:

Treat each option as true/false, not as “best overall set.”

Speed tactics

On MCQs with negative marking:

If you can’t narrow to at least 2 options, strongly consider skipping.

On NAT:

Use rough bounds to sanity-check the final numeric answer.

Keep a “mistake pattern” list from mocks:

Off-by-one in arrays, mis-reading “at most/at least”, missing endian/bit details.

Day-of mini-plan

Morning: 8–10 light questions across GA and CS; don’t touch new topics.

During exam:

Start with easy GA + known favourite subject to build confidence, then go into heavier sections.

Mental line:

“This is a 3-hour pattern recognition game, not a judgement on my career.”