Covers algorithms, data structures, computer networks, databases, and software engineering, ideal for those pursuing careers in IT and software development.

GATE Computer Science and Information Technology

Official 2025 syllabus extracted from https://gate2025.iitr.ac.in/doc/2025/GATE%20_CS_2025_Syllabus.pdf

Engineering Mathematics

Propositional logic

First order logic

Sets

Relations

Functions

Partial orders and lattices

Monoids, Groups

Graphs: connectivity

Graphs: matching

Graphs: colouring

Combinatorics: counting

Recurrence relations

Generating functions

Discrete Mathematics

Matrices

Determinants

System of linear equations

Tip: eigenvalues of Ak are λk; of A-1 are 1/λ; A and AT share eigenvalues.

Eigenvalues and eigenvectors

LU decomposition

Linear Algebra

Limits, continuity and differentiability

Maxima and minima

Mean value theorem

Integration

Calculus

Random variables

Uniform distribution

Normal distribution

Exponential distribution

Poisson distribution

Binomial distribution

Mean, median, mode and standard deviation

Conditional probability

Bayes theorem

Probability and Statistics

Digital Logic

Boolean algebra

Combinational circuits

Sequential circuits

Minimization

Number representations

Computer arithmetic (fixed point)

Computer arithmetic (floating point)

Computer Organization and Architecture

Machine instructions and addressing modes

ALU, data-path and control unit

Instruction pipelining

Pipeline hazards

Memory hierarchy: cache, main memory, secondary storage

I/O interface (interrupt mode)

I/O interface (DMA mode)

Programming and Data Structures

Programming in C

Recursion

Arrays

Stacks

Queues

Linked lists

Trees

Binary search trees

Binary heaps

Graphs

Algorithms

Searching

Sorting

Hashing

Asymptotic worst case time and space complexity

Greedy algorithms

Dynamic programming

Divide-and-conquer

Graph traversals

Minimum spanning trees

Shortest paths

Theory of Computation

Regular expressions

Finite automata

Context-free grammars

Push-down automata

Regular and context-free languages

Pumping lemma

Turing machines

Undecidability

Compiler Design

Lexical analysis

Parsing

Syntax-directed translation

Runtime environments

Intermediate code generation

Local optimisation

Data flow analysis: constant propagation

Data flow analysis: liveness analysis

Data flow analysis: common sub-expression elimination

Operating System

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

Relational algebra

Tuple calculus

Integrity constraints

Normal forms

File organization

Indexing (B and B+ trees)

Transactions

Concurrency control

Computer Networks

OSI Protocol Stack

TCP/IP Protocol Stack

Packet switching

Circuit switching

Virtual circuit switching

Data link layer: framing

Data link layer: error detection

Medium Access Control

Ethernet bridging

Routing: shortest path

Routing: flooding

Routing: distance vector

Routing: link state

Fragmentation and IP addressing

IPv4

CIDR notation

ARP, DHCP, ICMP

Network Address Translation (NAT)

Transport layer: flow control

Transport layer: congestion control

Sockets

Application layer: DNS

Application layer: SMTP

Application layer: HTTP

Application layer: FTP

Application layer: Email

GATE Computer Science and Information Technology Syllabus 2025, 2026 and more: Subjects, Topics, and What to Study