GATE Computer Science Syllabus 2026 – Complete Detailed Syllabus (CSE)

If you are preparing for GATE CSE (Computer Science Engineering), the first and most important step is understanding the syllabus of GATE for Computer Science in detail. The computer science GATE syllabus covers subjects like Algorithms, Operating Systems, Databases, Computer Networks, Programming, Compiler Design, and Engineering Mathematics.

Here is the complete GATE Computer Science syllabus with every topic covered, along with important areas for preparation.

📌 GATE CSE Exam Pattern

Total Marks: 100
Duration: 3 Hours
Sections:
General Aptitude (GA) – 15 Marks
Engineering Mathematics – 15 Marks
Core Computer Science Subjects – 70 Marks
Question Types: MCQ, MSQ, NAT

📝 GATE Computer Science Syllabus – Subject-Wise

1. General Aptitude (GA)

(Common to all GATE papers)

Verbal Ability:
English grammar
Sentence completion
Critical reasoning and verbal deduction
Word groups and usage
Reading comprehension
Numerical Ability:
Numerical computation and estimation
Numerical reasoning
Data interpretation and sufficiency
Ratios, percentages, averages

2. Engineering Mathematics

This section carries 15 marks and is one of the most scoring parts of the exam.

Discrete Mathematics:
Propositional and first-order logic
Sets, relations, functions
Partial orders, lattices
Groups (Cayley tables, subgroups, homomorphism)
Graphs: connectivity, matching, coloring, spanning trees, cut-vertices, bridges, shortest path
Linear Algebra:
Matrices, determinants
Systems of linear equations
Eigenvalues and eigenvectors
Calculus:
Limits, continuity, differentiability
Mean value theorem, maxima, minima
Integration and its applications
Probability & Statistics:
Random variables
Distributions: uniform, normal, exponential
Mean, median, mode, standard deviation, variance
Conditional probability & Bayes theorem

3. Digital Logic

Boolean algebra, logic gates, truth tables
Minimization (K-map, Quine-McCluskey)
Combinational circuits: adders, multiplexers, encoders, decoders
Sequential circuits: flip-flops, latches, counters, shift registers
Number representation: binary, signed, floating-point
Computer arithmetic: addition, subtraction, multiplication, division

4. Computer Organization and Architecture (COA)

Machine instructions and addressing modes
Data path and control unit (hardwired & microprogrammed control)
Instruction pipelining: hazards, branch handling
Memory hierarchy: cache (mapping techniques, replacement policies), RAM, secondary memory
I/O interface, interrupts, DMA
Arithmetic and logical operations
RISC vs CISC architectures

5. Programming and Data Structures

C programming basics: loops, functions, recursion, pointers, dynamic memory allocation
Data Structures:
Arrays, linked lists, stacks, queues, priority queues, heaps
Trees: binary trees, BST, AVL trees, B-trees, tries
Graphs: adjacency matrix/list, BFS, DFS
Algorithms with DS: searching, sorting (merge, quick, heap, radix), hashing

6. Algorithms

Asymptotic analysis: Big-O, Big-Ω, Θ notations
Recurrence relations & solving techniques
Sorting & searching algorithms: quicksort, mergesort, heapsort, binary search
Graph algorithms:
Shortest path (Dijkstra, Bellman-Ford, Floyd-Warshall)
Minimum spanning tree (Prim’s, Kruskal’s)
Max-flow, network flow algorithms
Dynamic programming: matrix chain multiplication, longest common subsequence, knapsack
Greedy methods: job scheduling, Huffman coding
Divide & conquer: binary search, merge sort
NP-completeness, approximation algorithms

7. Theory of Computation (TOC)

Regular languages and finite automata (DFA, NFA, ε-NFA)
Regular expressions, closure properties, pumping lemma
Context-free grammar (CFG), context-free languages (CFL), pushdown automata (PDA)
Turing machines, recursive & recursively enumerable languages
Undecidability: halting problem, reductions

8. Compiler Design

Lexical analysis: tokens, lexemes, regular expressions
Parsing: top-down (LL), bottom-up (LR, SLR, LALR)
Syntax-directed translation
Intermediate code generation: three-address code, DAG representation
Runtime environments: storage organization, stack allocation
Code optimization: peephole optimization, loop optimization
Code generation: register allocation, instruction selection

9. Operating System (OS)

Processes and threads
CPU scheduling: FCFS, SJF, Priority, Round Robin, Multilevel Queue
Inter-process communication (IPC): semaphores, monitors, message passing
Deadlocks: detection, prevention, avoidance (Banker’s algorithm)
Memory management: paging, segmentation, virtual memory
File systems: organization, allocation methods
Disk scheduling: FCFS, SSTF, SCAN, C-SCAN
I/O management

10. Databases (DBMS)

ER model, relational data model
Relational algebra, tuple relational calculus
SQL queries (DDL, DML, DCL, TCL)
Normalization: 1NF, 2NF, 3NF, BCNF, multivalued dependencies
Indexing: B-trees, hashing
Transactions: ACID properties, concurrency control (2PL, timestamp ordering)
Deadlock handling in DBMS
Recovery: log-based, shadow paging

11. Computer Networks

ISO/OSI model, TCP/IP suite
Data link layer: framing, error detection (CRC, Hamming code), flow control
MAC protocols: ALOHA, CSMA, Ethernet, token ring
Network layer: IP addressing, subnetting, routing (shortest path, distance vector, link state)
Transport layer: TCP, UDP, flow control, congestion control
Application layer: DNS, HTTP, FTP, SMTP, SNMP
Basics of network security: encryption, authentication, firewalls

📊 GATE Computer Science Syllabus – Unit-Wise Weightage

Subject / Unit	Important Areas	Weightage (Approx.)
General Aptitude (GA)	Data interpretation, reasoning, comprehension	15 Marks
Engineering Mathematics	Graph theory, probability, linear algebra	10–13 Marks
Digital Logic	Boolean algebra, sequential circuits	4–6 Marks
COA	Cache, pipelining, addressing modes	6–8 Marks
Programming & Data Structures	Trees, hashing, recursion	6–8 Marks
Algorithms	DP, greedy, graph algorithms	8–10 Marks
Theory of Computation	DFA/NFA, CFG, PDA, decidability	6–8 Marks
Compiler Design	Parsing, intermediate code	4–6 Marks
Operating System	CPU scheduling, deadlocks, paging	8–10 Marks
Databases	SQL queries, normalization, transactions	7–9 Marks
Computer Networks	TCP/UDP, routing, CRC	7–9 Marks

✅ Final Thoughts

The GATE Computer Science syllabus is comprehensive, but with smart planning, it can be tackled effectively. Focus on high-weightage subjects like Algorithms, OS, Databases, and Networks, while regularly revising Engineering Mathematics and solving PYQs.

Mastering the GATE syllabus computer science not only boosts your GATE performance but also prepares you for interviews, higher studies, and technical job roles.