GATE (Graduate Aptitude Test in Engineering) study guides

Arrays, linked lists, stacks, queues, trees, graphs, heaps, and hash tables — consistently 10–12% of GATE CS marks.

Sorting, searching, dynamic programming, greedy methods, graph algorithms, and asymptotic complexity — approximately 10% of GATE CS.

Finite automata, regular expressions, context-free grammars, pushdown automata, Turing machines, and decidability — approximately 10% of GATE CS.

CPU design, instruction sets, pipelining, memory hierarchy, cache, and I/O — approximately 10% of GATE CS.

Process scheduling, memory management, deadlock, file systems, synchronisation — approximately 10% of GATE CS.

OSI and TCP/IP models, routing protocols, TCP/UDP, IP addressing, subnetting, and congestion control — approximately 10% of GATE CS.

Relational algebra, SQL, ER modelling, normalisation, transaction management, and indexing — approximately 10% of GATE CS.

Boolean algebra, logic gates, combinational circuits, flip-flops, sequential circuits, and minimisation — approximately 8% of GATE CS.

Lexical analysis, syntax-directed translation, parsing (LL/LR), intermediate code generation, and code optimisation — approximately 5% of GATE CS.

Verbal reasoning, numerical ability, and analytical reasoning — always 15 marks (10 questions) in every GATE paper regardless of engineering discipline.