GATE 2027 Syllabus For CSE (Computer Science & Engineering)

GATE 2027, or the Graduate Aptitude Test in Engineering, is a national-level examination conducted jointly by IISc and the IITs. IIT Madras is the Organizing Institute for GATE 2027. For GATE 2027, IIT Madras has released the syllabus for the Computer Science and Information Technology (CS) paper, covering General Aptitude, Engineering Mathematics, and core Computer Science topics.

GATE Computer Science and Information Technology Syllabus PDF 2027

IIT Madras has released the official syllabus for the GATE Computer Science and Information Technology (CSE) 2027 exam, giving candidates a clear idea of the topics and concepts they need to prepare.

Download the latest GATE Computer Science and Information Technology Syllabus PDF here "GATE Computer Science and Information Technology Syllabus"

GATE CSE Syllabus 2027

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.

General Aptitude (GA) - 15 Marks

Verbal Aptitude

Covers basic English grammar, vocabulary, reading comprehension, and narrative sequencing to test understanding and effective use of the English language.

Basic English Grammar

• Tenses
• Articles
• Adjectives
• Prepositions
• Conjunctions
• Subject-Verb Agreement
• Parts of Speech

Basic Vocabulary

• Selecting Words
• Idioms and Phrases
• Reading Comprehension

Quantitative Aptitude

Focuses on numerical computation, estimation, data interpretation, mensuration, geometry, statistics, and probability.

Data Interpretation

• Bar Graph
• Line Graphs
• Pie Chart
• Table Chart
• 2-Dimensional and 3-Dimensional Plots
• Maps
• Tables

Numerical Computation and Estimation

• Ratio and Proportion
• Percentages
• Powers
• Exponents and Logarithms
• Permutations and Combinations
• Series
• Mensuration and Geometry
• Elementary Statistics and Probability

Analytical Aptitude

Assesses logical thinking, deduction, induction, analogy, numerical relations, and reasoning.

• Logic: Deduction and Induction
• Analogy
• Numerical Relations and Reasoning

Spatial Aptitude

Tests the ability to visualize and mentally manipulate shapes and patterns in 2D and 3D space.

• Translation
• Rotation
• Scaling
• Mirroring
• Assembling
• Grouping
• Paper Folding
• Cutting
• Patterns in 2 and 3 Dimensions

Computer Science and Information Technology (CS/IT) - 85 Marks

Engineering Mathematics

The syllabus or important topics of Engineering Mathematics for the GATE CSE exam are provided below.

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

Digital Logic and Design

• Boolean Algebra and Minimization (Algebraic Technique, Karnaugh Map, Tabular Method)
• Combinational and Sequential Circuits
• Number Representations and Computer Arithmetic (Fixed and Floating Point)

Computer Organization and Architecture

• Instruction Set and Addressing Modes
• Design of Arithmetic and Logic Unit (ALU)
• Design of Control Unit – Hardwired and Microprogrammed
• I/O Interface (Interrupt and DMA Mode)
• Instruction Pipelining
• Pipeline Hazards

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
• Algorithm Design Techniques: Greedy, Dynamic Programming and Divide-and-Conquer
• Graph Traversals
• Minimum Spanning Trees
• Shortest Paths

Theory of Computation

• Regular Expressions and Finite Automata
• Context-Free Grammar and Push-Down Automata
• Regular and Context-Free Languages
• Pumping Lemma
• Turing Machines and Undecidability

Compiler Design

• Lexical Analysis
• Parsing
• Syntax-Directed Translation
• Runtime Environments
• Intermediate Code Generation
• Local Optimization
• Data Flow Analysis: Constant Propagation, Liveness Analysis, Common Subexpression Elimination

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

Databases

• ER-Model
• Relational Model: Relational Algebra, Tuple Calculus and SQL
• Integrity Constraints
• Normal Forms
• File Organization
• Indexing (B and B+ Trees)
• Transactions and Concurrency Control

Computer Networks

• Concept of Layering: OSI and TCP/IP Protocol Stacks
• Basics of Switching: Circuit Switching, Packet Switching, Virtual Circuit Switching and Performance Metrics
• Data Link Layer: Error Detection, Medium Access Control and Ethernet
• Routing: Distance Vector and Link State Routing
• IPv4: Fragmentation, CIDR Notation and Network Address Translation (NAT)
• Transport Layer: Flow Control, Congestion Control, TCP and Socket API
• Application Layer: DNS and HTTP