Data article · 15 official papers
Most repeated GATE CS topics (2017–2026)
We tagged every question of every GATE CS paper by subject and topic. These are the topics that come back year after year — the most predictable marks in the paper.
Topics tracked
91
10 years
Asked every year
7
never skipped
#1 by marks
47 m
Memory Hierarchy
Top 15 share
34%
of all marks
Asked in every one of the 10 years
- Memory Hierarchy · 47m
- Lexical Analysis & Parsing Architectures , LR , LALR) · 43m
- Regular Expressions & Finite Automata · 40m
- Regular and Context-Free Languages & Pumping Lemma · 40m
- Memory Management and Virtual Memory · 37m
- Number Representations & Fixed/Floating Point Math · 33m
- Binary Search Trees & Binary Heaps · 32m
Top 15 topics, year by year
Marks each topic carried in each year — darker is heavier.
| '17 | '18 | '19 | '20 | '21 | '22 | '23 | '24 | '25 | '26 | |
|---|---|---|---|---|---|---|---|---|---|---|
| Memory Hierarchy | 11 | 2 | 3 | 3 | 4 | 4 | 2 | 4 | 8 | 6 |
| Lexical Analysis & Parsing Architectures , LR , LALR) | 5 | 5 | 4 | 1 | 6 | 2 | 1 | 8 | 6 | 5 |
| Regular Expressions & Finite Automata | 4 | 3 | 2 | 3 | 6 | 1 | 4 | 9 | 5 | 3 |
| Regular and Context-Free Languages & Pumping Lemma | 7 | 2 | 4 | 4 | 6 | 4 | 1 | 1 | 7 | 4 |
| Memory Management and Virtual Memory | 2 | 1 | 2 | 3 | 3 | 4 | 6 | 5 | 7 | 4 |
| Number Representations & Fixed/Floating Point Math | 5 | 2 | 2 | 2 | 4 | 3 | 3 | 4 | 3 | 5 |
| Binary Search Trees & Binary Heaps | 3 | 2 | 2 | 6 | 2 | 1 | 3 | 6 | 5 | 2 |
| Functions, Parameter Passing, Scope Rules, Recursion | 8 | 1 | 5 | 4 | 6 | 5 | 4 | 4 | 6 | |
| Data Link Layer | 8 | 2 | 2 | 8 | 2 | 1 | 3 | 2 | 6 | |
| Fragmentation and IP Addressing , NAT) | 1 | 2 | 4 | 3 | 3 | 3 | 7 | 4 | 4 | |
| Instruction Pipelining, Performance, Hazard Management | 2 | 2 | 2 | 4 | 2 | 1 | 6 | 4 | 5 | |
| Asymptotic Analysis | 6 | 4 | 1 | 5 | 1 | 3 | 3 | 1 | 3 | |
| Graph Theory | 2 | 2 | 1 | 3 | 7 | 2 | 4 | 2 | 4 | |
| Pointers, Multi-Dimensional Arrays, Structures | 3 | 3 | 3 | 1 | 3 | 3 | 3 | 4 | 2 | |
| Minimum Spanning Trees | 2 | 2 | 2 | 4 | 2 | 2 | 2 | 5 | 2 |
Full ranking
Sorted by years asked, then marks · each pip is a year
- 1Memory HierarchyComputer Organization and Architecture (COA)47m Rising +45%
- 2Lexical Analysis & Parsing Architectures , LR , LALR)Compiler Design43m Rising +85%
- 3Regular Expressions & Finite AutomataTheory of Computation (TOC)40m Rising +72%
- 4Regular and Context-Free Languages & Pumping LemmaTheory of Computation (TOC)40m Steady
- 5Memory Management and Virtual MemoryOperating Systems (OS)37m Rising +78%
- 6Number Representations & Fixed/Floating Point MathDigital Logic33m Rising +33%
- 7Binary Search Trees & Binary HeapsData Structures32m Rising +60%
- 8Functions, Parameter Passing, Scope Rules, RecursionProgramming in C43m Rising +13%
- 9Data Link LayerComputer Networks (CN)34m Steady
- 10Fragmentation and IP Addressing , NAT)Computer Networks (CN)31m Rising +119%
- 11Instruction Pipelining, Performance, Hazard ManagementComputer Organization and Architecture (COA)28m Rising +169%
- 12Asymptotic AnalysisAlgorithms27m Cooling -18%
- 13Graph TheoryDiscrete Mathematics27m Rising +37%
- 14Pointers, Multi-Dimensional Arrays, StructuresProgramming in C25m Rising +31%
- 15Minimum Spanning TreesAlgorithms23m Rising +50%
- 16Transport LayerComputer Networks (CN)22m Rising +62%
- 17Matrices, Determinants, & Linear Equation SystemsLinear Algebra21m Rising +157%
- 18Relational Models, Relational Algebra, Tuple CalculusDatabase Management Systems (DBMS)21m Rising +44%
- 19CPU and I/O SchedulingOperating Systems (OS)21m Rising +75%
- 20Eigenvalues and EigenvectorsLinear Algebra20m Cooling -42%
- 21File Systems Operations & Disk Scheduling OptimizationOperating Systems (OS)20m Rising +133%
- 22Concurrency & SynchronizationOperating Systems (OS)20m Steady
- 23Propositional and First-Order Quantifier LogicDiscrete Mathematics19m Cooling -17%
- 24Boolean Algebra, Minimization, K-MapsDigital Logic33m Rising +120%
- 25Machine Instructions & Addressing ModesComputer Organization and Architecture (COA)24m Rising +97%
- 26Searching, Sorting, Hashing MechanismsAlgorithms23m Rising +79%
- 27Transactions, Concurrency Control, Conflict SerializabilityDatabase Management Systems (DBMS)23m Rising +50%
- 28Operational Puzzles and Systemic ReasoningAnalytical Aptitude20m Rising +133%
- 29Turing Machines & UndecidabilityTheory of Computation (TOC)19m Cooling -73%
- 30Numerical Relations & Arithmetic LogicAnalytical Aptitude18m Rising +48%
- 31Syntax-Directed Translation & Runtime EnvironmentsCompiler Design18m Rising +48%
- 32Combinational LogicDigital Logic18m Rising +87%
- 33SQL QueriesDatabase Management Systems (DBMS)17m Cooling -28%
- 34CombinatoricsDiscrete Mathematics15m Cooling -15%
- 35Normalization SchemesDatabase Management Systems (DBMS)15m Rising +56%
- 36Sets, Relations, Functions, Partial Orders, LatticesDiscrete Mathematics15m Rising +56%
- 37File Organization & IndexingDatabase Management Systems (DBMS)15m Rising +104%
- 38Algebraic StructuresDiscrete Mathematics15m Rising +56%
- 39Abstract Data Types , Stacks, QueuesData Structures13m Rising +100%
- 40I/O InterfacesComputer Organization and Architecture (COA)9m Rising +87%
How to use this
- Master the green topics first — they appear every year and are the most predictable marks.
- Open each subject page to solve that topic's past questions, then take a timed subject test in the simulator.
- Plan the time with the study-plan generator, which uses the same data.
Computed automatically from our tagged bank of official GATE CS papers; papers with two shifts count both. Updated after every GATE.

