GATE 2026 Computer Science & Information Technology Syllabus (Out) - Download GATE CS Syllabus PDF, Important Topics/Chapters, Section Wise Weightage

Engineering Mathematics

Discrete Mathematics

Propositional and first-order logic; Sets, relations, functions, partial orders, lattices; Monoids, Groups; Graphs: connectivity, matching, coloring; 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.

Digital Logic

Boolean Algebra

Combinational and sequential circuits; Minimization.

Number Representations

Fixed and floating-point arithmetic.

Computer Organization and Architecture

Machine Instructions

Addressing modes, ALU, data-path and control unit.

Instruction Pipelining

Pipeline hazards.

Memory Hierarchy

Cache, main memory, secondary storage.

I/O Interface

Interrupt and DMA mode.

Programming and Data Structures

Programming in C

Basics of C programming.

Data Structures

Recursion, arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.

Algorithms

Algorithm Concepts

Searching, sorting, hashing.

Complexity

Asymptotic worst-case time and space complexity.

Design Techniques

Greedy, dynamic programming, divide-and-conquer.

Graph Algorithms

Graph traversals, minimum spanning trees, shortest paths.

Theory of Computation

Finite Automata

Regular expressions, finite automata.

Context-Free Grammars

Push-down automata, context-free languages, pumping lemma.

Turing Machines

Undecidability.

Compiler Design

Compiler Phases

Lexical analysis, parsing, syntax-directed translation.

Runtime Environments

Intermediate code generation.

Optimizations

Local optimization, data flow analyses: constant propagation, liveness analysis, common sub-expression elimination.

Operating System

Processes

System calls, processes, threads, inter-process communication.

Concurrency and Synchronization

Deadlock, CPU and I/O scheduling.

Memory Management

Virtual memory, file systems.

Databases

ER Model

Entity-relationship model.

Relational Model

Relational algebra, tuple calculus, SQL.

Normalization

Integrity constraints, normal forms.

File Organization and Indexing

B and B+ trees.

Transactions

Concurrency control.

Computer Networks

Layering Concepts

OSI and TCP/IP Protocol Stacks.

Data Link Layer

Framing, error detection, Medium Access Control, Ethernet bridging.

Routing Protocols

Shortest path, flooding, distance vector, link-state routing.

IP Layer

Fragmentation, IP addressing (IPv4, CIDR), support protocols (ARP, DHCP, ICMP), NAT.

Transport Layer

Flow control, congestion control, UDP, TCP, sockets.

Application Layer Protocols

DNS, SMTP, HTTP, FTP, Email.

Engineering Mathematics

Discrete Mathematics

Graphs: connectivity, matching, coloring; Recurrence relations; Propositional logic and truth tables.

Linear Algebra

Eigenvalues and eigenvectors; LU decomposition; Solving systems of linear equations.

Calculus

Maxima and minima; Mean Value Theorem; Definite integrals.

Probability and Statistics

Bayes theorem; Poisson and normal distributions; Mean, median, mode.

Digital Logic

Boolean Algebra

Karnaugh Maps (K-Maps); Design of sequential circuits; Minimization techniques.

Number Representations

Binary arithmetic (addition, subtraction); Floating-point representation.

Computer Organization and Architecture

Machine Instructions

Addressing modes and instruction formats.

Instruction Pipelining

Data and control hazards; Pipelining efficiency.

Memory Hierarchy

Cache mapping techniques (direct, associative); Cache performance analysis.

I/O Interface

DMA functionality; Interrupt handling.

Programming and Data Structures

Programming in C

Pointers; Recursion; Dynamic memory allocation.

Data Structures

Tree traversals; Applications of stacks and queues; Graph representations and BFS/DFS.

Algorithms

Algorithm Concepts

Quick sort, Merge sort; Hashing techniques and collision resolution.

Complexity

Time complexity analysis of loops; Space complexity in recursive algorithms.

Design Techniques

Dynamic programming: Longest Common Subsequence (LCS), Knapsack problem; Divide-and-conquer: Merge sort.

Graph Algorithms

Dijkstra’s shortest path; Prim’s and Kruskal’s for Minimum Spanning Tree.

Theory of Computation

Finite Automata

Designing DFA/NFA; Regular expression equivalence.

Context-Free Grammars

Push-down automata configurations; Applications of the pumping lemma.

Turing Machines

Designing simple Turing Machines; Undecidability problems.

Compiler Design

Compiler Phases

Lexical analysis: Regular expressions and finite automata; Parsing: LL(1) and LR(0) parsing tables.

Optimizations

Constant propagation; Common sub-expression elimination.

Operating System

Processes

Process scheduling algorithms (FCFS, SJF, Round Robin); Inter-process communication.

Concurrency and Synchronization

Deadlock detection and avoidance; Semaphores and critical section problems.

Memory Management

Paging and segmentation; Virtual memory: Page replacement algorithms.

Databases

Relational Model

SQL queries on joins, subqueries; Relational algebra operations.

Normalization

Functional dependencies; 3NF and BCNF conversions.

File Organization and Indexing

B+ tree insertions and deletions.

Transactions

ACID properties; Conflict serializability.

Computer Networks

Layering Concepts

Differences between OSI and TCP/IP; Basics of protocol layering.

Data Link Layer

Error detection (CRC, checksum); MAC protocols: ALOHA, CSMA/CD.

Routing Protocols

Distance vector and link-state algorithms; IP fragmentation.

IP Layer

Subnetting and CIDR notation; ARP, DHCP functionalities.

Transport Layer

TCP congestion control; Flow control mechanisms.

Application Layer Protocols

Working of DNS; HTTP request-response cycle; FTP and SMTP basics.