■ GATE CS/IT — Repeated Question Models
(2009–2025)
1. Programming & Data Structures (PDS) - Time complexity of code snippets (loops,
recurrences). - Linked list operations (insertion/deletion complexity). - Stack & Queue problems
(infix → postfix, balanced parentheses). - Tree traversals (inorder/preorder/postorder). - Binary
search tree properties, number of rotations, AVL balance. - Hashing (collision handling, load factor).
2. Algorithms - Sorting algorithms: time complexity (Quick, Merge, Heap). - Recurrence relations
(Master Theorem applications). - Graph algorithms: shortest path (Dijkstra/Bellman-Ford), MST
(Kruskal/Prim). - Dynamic programming: knapsack, matrix chain multiplication, LCS. - Greedy
algorithms: activity selection, Huffman coding. - Amortized analysis / worst-case vs average case.
3. Operating Systems (OS) - CPU Scheduling: FCFS, SJF, RR, Priority → avg. waiting/turnaround
times. - Deadlocks: safe/unsafe state, Banker’s algorithm. - Page Replacement: FIFO, LRU,
Optimal. - Segmentation & Paging: virtual address → physical address mapping. - Semaphores &
Synchronization: producer-consumer, readers-writers. - Threads & Concurrency basics. 4.
Computer Organization & Architecture (COA) - Number representation: 2’s complement, IEEE
floating point. - Instruction set formats, addressing modes. - Pipelining: stalls, hazards, speedup. -
Cache memory: hit/miss ratio, effective access time. - Memory hierarchy: average memory access
calculation. - Performance measures: CPI, MIPS, speedup law (Amdahl’s). 5. Databases (DBMS) -
SQL queries: outputs, joins, nested queries. - Functional dependencies & Normalization (1NF–3NF,
BCNF). - Transactions: conflict-serializability, precedence graph. - Concurrency control: lock
protocols, schedules. - Indexing: B+ trees search cost. - Relational algebra equivalence. 6.
Computer Networks (CN) - Subnetting & IP addressing (CIDR, VLSM). - Throughput, latency,
propagation + transmission delay. - CRC/error detection methods. - Sliding window protocols
(Go-Back-N, Selective Repeat). - TCP vs UDP properties, congestion control. - Routing algorithms
(distance vector, link state). - Application layer basics (DNS, HTTP, SMTP). 7. Discrete
Mathematics - Propositional logic & predicate logic: validity, satisfiability. - Set theory & relations
(equivalence, partial orders). - Combinatorics: permutations, combinations, binomial. - Graph
theory: properties (planar, bipartite), shortest path. - Trees: spanning trees, chromatic number,
Euler circuits. - Probability: Bayes’ theorem, conditional probability. 8. Theory of Computation
(TOC) - DFA ↔ NFA conversion, ε-NFA. - Regular expressions & languages (equivalence). -
Pumping lemma (regular / context-free). - PDA language acceptance. - Grammar classifications
(CFG, CNF). - Turing machine halting/decidability problems. 9. Compiler Design - Lexical analysis:
tokens, regular expressions. - Parsing: FIRST/FOLLOW, LL(1) vs LR(1). - Parse tree / derivation for
a given string. - Intermediate code generation (3-address code). - Runtime environment: activation
records, symbol tables. 10. Digital Logic - Boolean algebra simplification, K-maps. - Logic gates
and circuit equivalence. - Flip-flops (SR, JK, D, T) truth table & state change. - Sequential circuits,
counters, registers. - Number systems & conversions. 11. Engineering Mathematics - Linear
algebra: rank, determinant, eigenvalues. - Probability & statistics: expectation, variance,
distributions. - Calculus: maxima/minima, Taylor expansion. - Discrete maths overlap (recurrence,
combinatorics). - Numerical methods (rare but appear). 12. General Aptitude (GA) - Arithmetic
(ratios, averages, percentages). - Time-speed-distance, pipes & cisterns, work problems. -
Permutation-combination, probability. - Geometry, coordinate geometry basics. - Logical reasoning
& verbal analogies. ■ Final Insights - These question models repeat nearly every year — not the
same question, but same concept + pattern. - Solving 15–16 years of PYQs gives exposure to all of
these models. - In the actual exam, ~60–70% of questions will feel “familiar” if you’ve done PYQs —
just new numbers/wording.
