GATE Syllabus GATE 2026
Computer Science and Information Technology
Section 1: Engineering Mathematics
Discrete Mathematics:
Propositional and first order logic. Sets, relations, functions, partial orders and 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. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.
GATE Syllabus 2022 CSE
Section 2: Digital Logic
Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and
computer arithmetic (fixed and floating point).
Section 3: Computer Organization and Architecture
Machine instructions and addressing modes. ALU, data-path and control unit. Instruction pipelining,
pipeline hazards. Memory hierarchy: cache, main memory and secondary storage; I/O interface
(interrupt and DMA mode).
Section 4: Programming and Data Structures
Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary
heaps, graphs.
Section 5: Algorithms
Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design
techniques: greedy, dynamic programming and divide-and-conquer. Graph traversals, minimum
spanning trees, shortest paths
Section 6: Theory of Computation
Regular expressions and finite automata. Context-free grammars and push-down automata. Regular
and contex-free languages, pumping lemma. Turing machines and undecidability.
Section 7: Compiler Design
Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code
generation. Local optimisation, Data flow analyses: constant propagation, liveness analysis,
common subexpression elimination
Section 8: Operating System
System calls, processes, threads, inter-process communication, concurrency and synchronization.
Deadlock. CPU and I/O scheduling. Memory management and virtual memory. File systems.
GATE Syllabus 2022 CSE
Section 9: Databases
ER-model. Relational model:
relational algebra, tuple calculus, SQL. Integrity constraints, normal
forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.
Section 10: Computer Networks
Concept of layering:
OSI and TCP/IP Protocol Stacks; Basics of packet, circuit and virtual circuitswitching; Data link layer: framing, error detection, Medium Access Control, Ethernet bridging;
Routing protocols:
shortest path, flooding, distance vector and link state routing; Fragmentation and IP addressing, IPv4, CIDR notation, Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT);
Transport layer:
flow control and congestion control, UDP, TCP, sockets;
Application layer protocols:
DNS, SMTP, HTTP, FTP, Email.
GATE 2026 – Computer Science & Information Technology
Simplified and Student-Friendly Syllabus
Engineering Mathematics
1. Engineering Mathematics
(High scoring and logic-based section)
1.1 Discrete Mathematics
This subject focuses on logical reasoning and mathematical thinking.
Logic
Propositional logic
First-order logic and quantifiers
Set Theory
Sets, relations, and functions
Relations and Orders
Partial orders
Lattices and their properties
Algebraic Structures
Monoids
Groups (basic properties only)
Graph Theory
Graph connectivity
Matching
Graph colouring
Combinatorics
Counting techniques
Recurrence relations
Generating functions (basic concepts)
GATE 2026 – Computer Science & Information Technology
Simplified and Student-Friendly Syllabus
Linear Algebra
This section mainly includes formula-based and numerical problems.
1.Matrices and matrix operations2.Determinants
3.Systems of linear equations
4.Eigenvalues and eigenvectors
5.LU decomposition
GATE 2026 – Computer Science & Information Technology
Simplified and Student-Friendly Syllabus
Calculus
Calculus questions are usually direct and concept-based.
Limits
Continuity
Differentiability
Maxima and minima
Mean Value Theorem
Integration
GATE 2026 – Computer Science & Information Technology
Simplified and Student-Friendly Syllabus
Probability and Statistics
This is one of the most scoring areas in GATE.
Random variables
Probability distributions:
Uniform
Normal
Binomial
Poisson
Exponential
Mean, median, and mode
Standard deviation
Conditional probability
Bayes’ theorem
GATE 2026 – Computer Science & Information Technology
Simplified and Student-Friendly Syllabus
Part-2 Digital Logic
This subject is fully concept-oriented and easy to master with practice.
Boolean algebra
Logic gates
Combinational circuits
Sequential circuits
Circuit minimization using Karnaugh maps
Number systems
Computer arithmetic (fixed-point and floating-point)
GATE 2026 – Computer Science & Information Technology
Simplified and Student-Friendly Syllabus
Part-2 Computer Organization and Architecture
This subject explains how a computer system works internally.
Machine instructions
Addressing modes
Arithmetic Logic Unit (ALU)
Data path and control unit
Instruction pipelining
Pipeline hazards
Memory hierarchy:
Cache memory
Main memory
Secondary storage
Input and Output systems:
Interrupts
Direct Memory Access (DMA)
GATE 2026 – Computer Science & Information Technology
Simplified and Student-Friendly Syllabus
Part-2 Programming and Data Structures
This section tests programming fundamentals and data handling techniques.
Programming in C
Recursion
Arrays
Stacks and queues
Linked lists
Trees
Binary Search Trees (BST)
Binary heaps
Graph data structures
GATE 2026 – Computer Science & Information Technology
Simplified and Student-Friendly Syllabus
Part-2 Algorithms
This subject focuses on problem-solving efficiency.
Searching algorithms
Sorting algorithms
Hashing techniques
Time and space complexity analysis
Algorithm design techniques:
Greedy method
Divide and conquer
Dynamic programming
Graph algorithms:
Graph traversal
Minimum spanning trees
Shortest path algorithms
GATE 2026 – Computer Science & Information Technology
Simplified and Student-Friendly Syllabus
Part-2 Theory of Computation
This section deals with abstract models of computation.
Regular expressions
Finite automata
Context-free grammars
Pushdown automata
Regular and context-free languages
Pumping lemma
Turing machines
Undecidability concepts
GATE 2026 – Computer Science & Information Technology
Simplified and Student-Friendly Syllabus
Part-2 Compiler Design
This subject explains how programming languages are translated.
Lexical analysis
Syntax analysis (parsing)
Syntax-directed translation
Runtime environments
Intermediate code generation
Code optimization techniques
Data flow analysis:
Constant propagation
Liveness analysis
Common subexpression elimination
GATE 2026 – Computer Science & Information Technology
Simplified and Student-Friendly Syllabus
Part-2 Operating Systems
This subject focuses on resource management in computers.
System calls
Processes and threads
Inter-process communication
Concurrency and synchronization
Deadlock
CPU scheduling
I/O scheduling
Memory management
Virtual memory
File systems
GATE 2026 – Computer Science & Information Technology
Simplified and Student-Friendly Syllabus
Part-2 Databases
This subject deals with data storage and management.
Entity-Relationship (ER) model
Relational model
Relational algebra
Tuple relational calculus
SQL
Integrity constraints
Normal forms
File organization
Indexing:
B-tree
B+-tree
Transactions
Concurrency control
GATE 2026 – Computer Science & Information Technology
Simplified and Student-Friendly Syllabus
Part-2 Computer Networks
This subject explains how computer systems communicate.
Network layering concepts
OSI model
TCP/IP model
Switching techniques:
Packet switching
Circuit switching
Virtual circuits
Data Link Layer:
Framing
Error detection
Medium Access Control
Ethernet and bridging
Network Layer:
Routing algorithms
IP addressing
IPv4 and CIDR
ARP, DHCP, ICMP
Network Address Translation (NAT)
Transport Layer:
UDP
TCP
Flow and congestion control
Sockets
Application Layer:
DNS
SMTP
HTTP
FTP
Email protocols
GATE Computer Science
         |