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

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 Hierarchy11233442486
Lexical Analysis & Parsing Architectures , LR , LALR)5541621865
Regular Expressions & Finite Automata4323614953
Regular and Context-Free Languages & Pumping Lemma7244641174
Memory Management and Virtual Memory2123346574
Number Representations & Fixed/Floating Point Math5222433435
Binary Search Trees & Binary Heaps3226213652
Functions, Parameter Passing, Scope Rules, Recursion815465446
Data Link Layer822821326
Fragmentation and IP Addressing , NAT)124333744
Instruction Pipelining, Performance, Hazard Management222421645
Asymptotic Analysis641513313
Graph Theory221372424
Pointers, Multi-Dimensional Arrays, Structures333133342
Minimum Spanning Trees222422252
Recommended book · affiliate linkIntroduction to Algorithms (CLRS)The standard reference behind most GATE algorithm questions.

Full ranking

Sorted by years asked, then marks · each pip is a year

  1. 1Memory HierarchyComputer Organization and Architecture (COA)
  2. 2Lexical Analysis & Parsing Architectures , LR , LALR)Compiler Design
  3. 3Regular Expressions & Finite AutomataTheory of Computation (TOC)
  4. 4Regular and Context-Free Languages & Pumping LemmaTheory of Computation (TOC)
  5. 5Memory Management and Virtual MemoryOperating Systems (OS)
  6. 6Number Representations & Fixed/Floating Point MathDigital Logic
  7. 7Binary Search Trees & Binary HeapsData Structures
  8. 8Functions, Parameter Passing, Scope Rules, RecursionProgramming in C
  9. 9Data Link LayerComputer Networks (CN)
  10. 10Fragmentation and IP Addressing , NAT)Computer Networks (CN)
  11. 11Instruction Pipelining, Performance, Hazard ManagementComputer Organization and Architecture (COA)
  12. 12Asymptotic AnalysisAlgorithms
  13. 13Graph TheoryDiscrete Mathematics
  14. 14Pointers, Multi-Dimensional Arrays, StructuresProgramming in C
  15. 15Minimum Spanning TreesAlgorithms
  16. 16Transport LayerComputer Networks (CN)
  17. 17Matrices, Determinants, & Linear Equation SystemsLinear Algebra
  18. 18Relational Models, Relational Algebra, Tuple CalculusDatabase Management Systems (DBMS)
  19. 19CPU and I/O SchedulingOperating Systems (OS)
  20. 20Eigenvalues and EigenvectorsLinear Algebra
  21. 21File Systems Operations & Disk Scheduling OptimizationOperating Systems (OS)
  22. 22Concurrency & SynchronizationOperating Systems (OS)
  23. 23Propositional and First-Order Quantifier LogicDiscrete Mathematics
  24. 24Boolean Algebra, Minimization, K-MapsDigital Logic
  25. 25Machine Instructions & Addressing ModesComputer Organization and Architecture (COA)
  26. 26Searching, Sorting, Hashing MechanismsAlgorithms
  27. 27Transactions, Concurrency Control, Conflict SerializabilityDatabase Management Systems (DBMS)
  28. 28Operational Puzzles and Systemic ReasoningAnalytical Aptitude
  29. 29Turing Machines & UndecidabilityTheory of Computation (TOC)
  30. 30Numerical Relations & Arithmetic LogicAnalytical Aptitude
  31. 31Syntax-Directed Translation & Runtime EnvironmentsCompiler Design
  32. 32Combinational LogicDigital Logic
  33. 33SQL QueriesDatabase Management Systems (DBMS)
  34. 34CombinatoricsDiscrete Mathematics
  35. 35Normalization SchemesDatabase Management Systems (DBMS)
  36. 36Sets, Relations, Functions, Partial Orders, LatticesDiscrete Mathematics
  37. 37File Organization & IndexingDatabase Management Systems (DBMS)
  38. 38Algebraic StructuresDiscrete Mathematics
  39. 39Abstract Data Types , Stacks, QueuesData Structures
  40. 40I/O InterfacesComputer Organization and Architecture (COA)

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.