GATE CSE Syllabus 2025
The GATE Syllabus comprises two sections. The first one is the General
Aptitude Section which is of 15 marks, and the other one is the Computer
Science, and Information Technology Section which is of 85 marks. We
have briefly discussed the syllabus of
General Aptitude (GA) – 15 Marks
Basic English Grammar: Tenses,
Articles, Adjectives, Prepositions,
Conjunctions, Verb-noun Agreement, and
Verbal Aptitude Other Parts of Speech Basic Vocabulary:
Words, Idioms, and Phrases in Context
Reading and Comprehension Narrative
Sequencing
Data interpretation: Data Graphs (Bar
Graphs, Pie Charts, and Other Graphs
Representing Data), 2- and 3-dimensional
Plots, Maps, and Tables Numerical
Computation and Estimation: Ratios,
Percentages, Powers,
Quantitative Aptitude
Exponents, Exponents Formula,
and Logarithms, Logarithm
Formula, Permutations and Combinations,
and Series
Mensuration and Geometry, Elementary
Statistics and Probability
Deduction and Induction, Analogy,
Analytical Aptitude
Numerical Relations, and Reasoning
Transformation of shapes: Translation,
Rotation, Scaling, Mirroring, Assembling,
Spatial Aptitude
and Grouping Paper Folding, Cutting, and
Patterns in 2 and 3 Dimensions
Computer Science and Information Technology (CS/IT) – 85
Marks
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
1. Engineering Mathematics 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
Boolean Algebra
Combinational and Sequential Circuits
2. Digital Logic and Design Minimization
Number Representations and Computer
Arithmetic(Fixedand Floating Point)
Machine Instructions and Addressing
Modes.
ALU, Data Path, and Control Unit.
3. Computer Organization
Instruction Pipelining, Pipeline Hazards.
and Architecture
Memory Hierarchy: Cache, Main
Memory, and Secondary Storage
I/O Interface (Interrupt and DMA Mode)
Programming in C
4. Programming and Data
Recursion
Structures
Arrays,Stacks,Queues
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
1. Engineering Mathematics 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
Linked Lists, Trees, Binary Search
Trees, Binary Heaps
Graphs
Searching, Sorting, Hashing.
Asymptotic Worst Case Time and Space
Complexity
Algorithm Design
5. Algorithms
Techniques: Greedy, Dynamic
Programming, and Divide-and-Conquer
Graph Traversals,Minimum Spanning
Trees,Shortest Paths
Regular Expressions and Finite Automata
6. Theory of Computation Context-Free Grammar and Push-Down
Automata
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
1. Engineering Mathematics 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
Regular and Context-Free
Languages,Pumping Lemma
Turing Machines and Undecidability
Lexical Analysis
Parsing, Syntax-Directed Translation
Runtime Environments
Intermediate Code Generation
7. Compiler Design
Local Optimization
Data Flow Analyses:Constant
Propagation,Liveness Analysis,Common
Subexpression Elimination
System Calls,Processes,Threads
Inter-Process
8. Operating System
Communication, Concurrency,
and Synchronization
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
1. Engineering Mathematics 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
Operating System
Deadlock
CPU and I/O Scheduling
Memory Management and Virtual
Memory
File Systems
ER-Model
Relational Model: Relational
Algebra, Tuple Calculus
SQL
9. Databases
Integrity Constraints, Normal Forms
File Organization, Indexing (e.g., B and
B+ Trees)
Transactions and Concurrency Control
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
1. Engineering Mathematics 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
Concept of Layering:OSI and TCP/IP
Protocol Stacks
Basics of the Packet,Circuit, and Virtual
Circuit Switching
Data Link Layer: Framing,Error
Detection,Medium Access
Control, Ethernet Bridging
Routing Protocols: Shortest Path,
10. Computer Networks 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
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
1. Engineering Mathematics 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
Application Layer Protocols: DNS,
SMTP, HTTP, FTP, Email
Subject List Weightage
Programming & Data Structures 10-12%
Algorithm 5-7%
Operating System 7-9%
Database Management 8-10%
System(DBMS)
Computer Networks 6-8%
Discrete Mathematics 6-7%
Theory Of Computation(TOC) 8-9%
Digital Logic 4-5%
Compiler Design 2-4%
Computer Organisation and 9-10%
Architecture(COA)
Engineering Mathematics 6-7%
General Aptitude 15%
Last Minute Notes of each subject. By the way, we prefer to call these as
LMNs ( pronounced as lemons ? )
Algorithms
C/C++
Data Structures
DBMS
Theory of Computation
Digital Electronics
Operating Systems
Computer Organization
Compiler Design
Computer Networks
Engineering Mathematics
Discrete Mathematics
1. Mathematics
1. Matrix Determinant.
2. Eigenvalues.
3. Propositional Logic and Predicate Logic.
4. Conditional Probability.
5. Relations.
2. Digital Logic
1. Combinational Circuits : Multiplexers, De-multiplexers and Decoders.
2. Sequential Circuits : Counters
3. Logic Gates.
4. Number System.
5. Minimization of Boolean Expressions.
3. Computer Organization and Architecture
1. Cache Organization
2. Pipelining.
3. I/O Data Transfer
4. Addressing Modes.
5. Number Representation.
4. Programming and Data Structures
1. Recursive Programs
2. Stacks
3. Queue
4. Trees.
5. Graphs.
5. Algorithms
1. Algorithm Analysis.
2. Sorting Algorithms
3. Heaps.
4. Graph Algorithms.
5. Divide and Conquer & Greedy Algorithms.
6. Theory of Computation
1. DFA
2. Regular Expressions
3. Regular Languages.
4. Closure Properties.
5. Undecidability.
7. Compiler Design
1. LR Parsers
2. LL(1) Parser.
3. Predictive Parser.
4. Minimum no of nodes and edges in DAG.
5. Intermediate code Generation & its purpose.
8. Operating Systems
1. Synchronization Mechanisms, Concurrency in IPC environment.
2. Virtual Memory
3. CPU Scheduling Algorithms.
4. Techniques of Memory Management.
5. Implementation issues of File system design.
9. DBMS (Database Management Systems)
1. Relational Algebra
2. SQL Queries
3. Transactions.
4. Serializability.
5. Normalizations.
10. Computer Networks
1. Sliding Window Protocol.
2. TCP/UDP
3. IPV4/IPV6
4. Ethernet.
5. Encryption and Decryption Algorithms.