GATE CSE Syllabus 2027: Topic-wise, with PYQs
The GATE CSE syllabus 2027 covers General Aptitude, Engineering Mathematics and the core Computer Science subjects. Every topic below links to its GATE CSE PYQs, so you can see how often it is asked and practise real previous year questions.
- Subjects
- 12
- PYQs
- 1,471
- Papers
- 26
How the GATE CSE paper is structured
The GATE CSE paper has 65 questions for 100 marks. General Aptitude carries 15 marks, and the other 85 marks come from Engineering Mathematics and the core subjects. Questions are one-mark or two-mark, in three types: multiple choice (MCQ), multiple select (MSQ) and numerical answer (NAT). Use the weightage numbers below to decide what to study first, then work through the GATE CSE question papers by year or all 1,471 GATE CSE PYQs.
General Aptitude syllabus
Quantitative Aptitude in GATE CS evaluates foundational mathematical reasoning, arithmetic, algebra, combinatorics, elementary probability, and geometry through concise word problems and functional/graphical models. Verbal Aptitude in GATE… General Aptitude has had 129 GATE CSE PYQs, about 14.8 marks per paper. See all GATE CSE General Aptitude PYQs.
Engineering Mathematics syllabus
In GATE Computer Science, Discrete Mathematics is heavily tested across mathematical logic, set theory, relations & partial orders/lattices, group theory, combinatorics, and graph theory. Probability and Statistics in GATE CS is consistent… Engineering Mathematics has had 261 GATE CSE PYQs, about 14.8 marks per paper. See all GATE CSE Engineering Mathematics PYQs.
- Discrete Mathematics50 PYQs
- Probability and Statistics46 PYQs
- Linear Algebra46 PYQs
- Calculus40 PYQs
- Graph Theory21 PYQs
- Combinatorics19 PYQs
- Propositional and First-Order Logic18 PYQs
- Sets, Relations, Lattices and Groups11 PYQs
- Sets, Relations and Functions5 PYQs
- Recurrence Relations4 PYQs
- Graph Traversals1 PYQ
Digital Logic syllabus
Boolean algebra and minimization in GATE CS tests algebraic identities, canonical form transformations, K-map minimization (SOP/POS with and without don't-cares), functional completeness, and the structural properties of logic operators li… Digital Logic has had 101 GATE CSE PYQs, about 5.5 marks per paper. See all GATE CSE Digital Logic PYQs.
Computer Organization and Architecture syllabus
Memory hierarchy and cache mapping is one of the highest-yield, most quantitative topics in GATE Computer Science, regularly tested through 2-mark NAT and MSQ questions. Instruction pipelining and pipeline hazards are tested extensively wi… Computer Organization and Architecture has had 109 GATE CSE PYQs, about 7.1 marks per paper. See all GATE CSE Computer Organization and Architecture PYQs.
Programming and Data Structures syllabus
In GATE CS, Programming in C is tested extensively through rigorous code tracing, pointer mechanics, and fundamental semantics rather than high-level syntax trivia. GATE tests Recursion primarily through direct execution tracing of recursi… Programming and Data Structures has had 163 GATE CSE PYQs, about 9.5 marks per paper. See all GATE CSE Programming and Data Structures PYQs.
Algorithms syllabus
Across GATE CS exam papers, asymptotic complexity is evaluated through rigorous mathematical analysis and algorithmic code inspection. Across GATE CS exams, Searching, Sorting, and Hashing are tested with a strong emphasis on exact compari… Algorithms has had 121 GATE CSE PYQs, about 7.8 marks per paper. See all GATE CSE Algorithms PYQs.
- Asymptotic Analysis31 PYQs
- Searching, Sorting and Hashing27 PYQs
- Graph Traversals16 PYQs
- Minimum Spanning Trees13 PYQs
- Graph Traversals, MSTs and Shortest Paths7 PYQs
- Dynamic Programming7 PYQs
- Algorithm Design Techniques6 PYQs
- Shortest Paths4 PYQs
- Sorting3 PYQs
- Algorithms1 PYQ
- Greedy Algorithms1 PYQ
- Minimum Spanning Trees and Shortest Paths1 PYQ
- Divide and Conquer1 PYQ
- Graph Algorithms1 PYQ
- Recursion1 PYQ
- Searching1 PYQ
Theory of Computation syllabus
The topic of Regular Expressions and Finite Automata is one of the highest-weight core areas in GATE CS Theory of Computation. Across GATE CS, 'Turing machines and undecidability' is consistently tested through theoretical properties of co… Theory of Computation has had 118 GATE CSE PYQs, about 6.9 marks per paper. See all GATE CSE Theory of Computation PYQs.
Compiler Design syllabus
GATE heavily tests the Parsing stage of compiler design across both Top-Down (LL(1), recursive descent) and Bottom-Up (LR(0), SLR(1), LALR(1), CLR(1)) paradigms. In GATE CS, Intermediate Code Generation (ICG) is tested through both theoret… Compiler Design has had 88 GATE CSE PYQs, about 5.2 marks per paper. See all GATE CSE Compiler Design PYQs.
Operating Systems syllabus
Memory management and virtual memory is a high-yield, computation-heavy topic in GATE CS, frequently carrying 2-mark NAT and MCQ/MSQ questions. CPU and I/O scheduling in GATE CS is predominantly an algorithmic and numerical topic focusing… Operating Systems has had 119 GATE CSE PYQs, about 7.7 marks per paper. See all GATE CSE Operating Systems PYQs.
Databases syllabus
In GATE, Normal Forms questions test a candidate's ability to identify candidate keys, classify relational schemas into appropriate normal forms (such as 3NF and BCNF), and evaluate decomposition properties (lossless join and dependency pr… Databases has had 116 GATE CSE PYQs, about 6.8 marks per paper. See all GATE CSE Databases PYQs.
Computer Networks syllabus
Medium Access Control (MAC) in GATE CS is predominantly tested through quantitative numerical problems and conceptual protocol comparisons. GATE CS tests TCP across three primary areas: congestion control dynamics (window growth phases, ti… Computer Networks has had 133 GATE CSE PYQs, about 7.6 marks per paper. See all GATE CSE Computer Networks PYQs.
- Data Link Layer27 PYQs
- TCP Flow and Congestion Control23 PYQs
- IPv4, CIDR and NAT14 PYQs
- DNS and HTTP18 PYQs
- Switching and Performance Metrics11 PYQs
- Principles of Layering12 PYQs
- CIDR Notation7 PYQs
- Distance Vector and Link-State Routing9 PYQs
- IPv4 Fragmentation8 PYQs
- Network Security3 PYQs
- Network Address Translation1 PYQ
Software Engineering syllabus
GATE tests Software Engineering at a conceptual level by evaluating a candidate's understanding of Software Development Life Cycle (SDLC) artifacts and phase boundaries. In GATE CS, Control Flow and Cyclomatic Complexity questions evaluate… Software Engineering has had 13 GATE CSE PYQs, about 2 marks per paper. See all GATE CSE Software Engineering PYQs.
Track your own progress on this syllabus with the syllabus tracker.