GATE CS 2026 : Syllabus

GATE Computer Science Syllabus 2026 is now available on the official IIT Guwahati website gate.iitg.ac.in. If you are preparing for the Graduate Aptitude Test in Engineering (GATE) 2026 , you can easily check the Computer Science Syllabus.

The GATE question paper for Computer Science mainly consists of two sections:

General Aptitude
Engineering Mathematics

👉 GATE CS Syllabus 2026 - Download PDF

GATE Syllabus for Computer Science CS 2026

This syllabus covers all the important subjects and topics that are required to be known for the exam. You can make a great study plan by reading the GATE 2026 CS syllabus carefully and understanding its weightage.

Subjects

Topics of GATE CS Syllabus 2026

GATE CS 2026 Syllabus for General Aptitude (Mandatory)

Verbal Ability Syllabus

English Grammar
Sentence Completion
Verbal Analogies
Word Groups Instructions
Critical Reasoning And Verbal Deduction, etc.

Numerical Ability

Numerical Computation
Numerical Estimation
Numerical Reasoning And Data Interpretation, etc.

GATE CS 2026 Syllabus – Computer Science & IT

Section	Topics Covered
Section 1: Engineering Mathematics	Discrete Mathematics: Propositional and first order logic, Sets, relations, functions, partial orders and lattices, Monoids, Groups, Graphs (connectivity, matching, colouring), Combinatorics (counting, recurrence relations, generating functions). Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition. Calculus: Limits, continuity and differentiability, Maxima and minima, Mean value theorem, Integration. Probability and Statistics: Random variables, Distributions (uniform, normal, exponential, Poisson, binomial), Mean, median, mode, standard deviation, Conditional probability, Bayes theorem.
Section 2: Digital Logic	Boolean algebra, Combinational and sequential circuits, Minimization, Number representations, Computer arithmetic (fixed and floating point).
Section 3: Computer Organization & Architecture	Machine instructions and addressing modes, ALU, datapath and control unit, Instruction pipelining and hazards, Memory hierarchy (cache, main memory, secondary storage), I/O interface (interrupt and DMA).
Section 4: Programming & Data Structures	C programming, Recursion, Arrays, Stacks, Queues, Linked lists, Trees, Binary search trees, Binary heaps, Graphs.
Section 5: Algorithms	Searching, Sorting, Hashing, Asymptotic worst-case complexity (time & space), Algorithm design techniques (greedy, dynamic programming, divide-and-conquer), Graph traversals, Minimum spanning trees, Shortest paths.
Section 6: Theory of Computation	Regular expressions, Finite automata, Context-free grammars, Push-down automata, Regular & context-free languages, Pumping lemma, Turing machines, Undecidability.
Section 7: Compiler Design	Lexical analysis, Parsing, Syntax-directed translation, Runtime environments, Intermediate code generation, Local optimization, Data flow analyses (constant propagation, liveness analysis, common subexpression elimination).
Section 8: Operating System	System calls, Processes, Threads, Inter-process communication, Concurrency & synchronization, Deadlock, CPU & I/O scheduling, Memory management, Virtual memory, File systems.
Section 9: Databases	ER model, Relational model (relational algebra, tuple calculus, SQL), Integrity constraints, Normal forms, File organization, Indexing (B, B+ trees), Transactions, Concurrency control.
Section 10: Computer Networks	Concept of layering (OSI & TCP/IP), Packet/circuit/virtual circuit switching, Data link layer (framing, error detection, MAC, Ethernet bridging), Routing protocols (shortest path, flooding, distance vector, link state), Fragmentation & IP addressing (IPv4, CIDR), IP support protocols (ARP, DHCP, ICMP, NAT), Transport layer (flow & congestion control, UDP, TCP, sockets), Application layer protocols (DNS, SMTP, HTTP, FTP, Email).