Let’s read about the Gate Syllabus for CS 2027
About GATE
The Graduate Aptitude Test in Engineering (GATE) is a prestigious national-level examination conducted each year by IISc and all IITs, on behalf of the National Coordination Board (NCB), Department of Higher Education, Ministry of Education (MoE), Government of India. Candidates who qualify for GATE can seek admissions with possible financial assistance to Master’s programs, Direct Doctoral programs and Doctoral programs (like the most prestigious institutes across the country, including IISc Bengaluru, IITs, NITs, IIITs, and many others) in relevant branches of Engineering / Technology / Science / Architecture / Humanities in institutions supported by Ministry of Education (MoE) and other Government agencies. The GATE authority (IIT Madras for this year) has released the official notifications regarding the GATE 2027 exam.
Candidates who are willingly interested in pursuing their higher studies from one of the most esteemed institutes in the country or have the ambition to join PSUs and want to dig deep into core sectors, can take the GATE examination in 2027.
GATE score obtained by the candidate will remain valid for a period of THREE years from the date of announcement of results. Several Public Sector Undertakings (PSUs) have also been using GATE score for recruitment.
GATE SYLLABUS for CS
The GATE Syllabus for CS is divided into 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 logical reasoning skills to test understanding, interpreting, accuracy, 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
- Narrative sequencing
Quantitative Aptitude
Focuses on numerical ability, data interpretation, and mathematical concepts such as percentages, ratios, averages, profit and loss, algebra, geometry, statistics, and probability to asses problem-solving skills, time management, and analytical thinking.
Data Interpretation:
- Bar Graph
- Line Graphs
- Pie Chart
- Tabulation
Numerical Computation and Estimation:
- Number Systems
- HCF and LCM of Numbers
- Decimal Fractions
- Simplification
- Square and Cube Roots
- Ratio, Proportion, and Variation
- Percentages
- Profit and Loss
- Partnership
- Chain Rule
- Pipes and Cisterns
- Averages and Mixtures (Alligations)
- Simple and Compound Interest
- Time and Work
- Time, Speed, and Distance
- Problems on Trains
- Powers
- Exponents and Logarithms
- Permutations and Combinations
- Series
- Geometry and Mensuration
- Coordinate Geometry
- Algebra: Functions, Inequalities, Quadratic and Other Equations, Logarithms
- Elementary Statistics and Probability
- Calendar, Clocks
- Stocks and Shares
- Banker’s Discount
- Height and Distances
Analytical Aptitude
Assesses logical reasoning, pattern recognition, and numerical relationships.
- Statements and Conclusions
- Statement and Assumptions
- Syllogisms
- Analogy: Verbal Analogies
- Numerical Series
- Alphanumeric Series
Spatial Aptitude
Tests the ability to visualize and mentally manipulate shapes and patterns in 2D and 3D space,
Transformations of shapes:
- Translation
- Conting figure
- Image Rotation
- Scaling
- Mirroring (Mirror image)
- Assembling Pieces
- Grouping
- Paper Folding
- Cutting
- Patterns in 2-Dimensions
- Patterns in 3-Dimensions
Computer Science and Information Technology (CS/IT) – 85 Marks
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
- Eigen Values and Eigen Vectors
- 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:
- Boolean Algebra
- Combinational Circuits
- Sequential Circuits
- Minimization
- Number Representations and Computer Arithmetic (Fixed and 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, and Secondary Storage
- I/O Interface (Interrupt and DMA Mode)
Programming and Data Structures:
- Programming in C
- Recursion
- Arrays
- Stacks
- Queues
- Linked Lists
- Trees
- Binary Search
- 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 Traversal, Minimum Spanning Trees, Shortest Paths
Theory of Computation:
- Regular Expression and Finite Automata
- Context-Free Grammars and Pushdown Automata
- Regular and Context-Free Languages, Pumping Lemma
- Turing Machines and Undecidability
Compilers:
- 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: Relation Algebra, Tuple Calculus
- SQL
- Integrity Constraints, Normal Forms
- File Organization, Indexing (e.g., B and B+ Trees)
- Transactions and Concurrency Control
Computer Networks:
- Concepts 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 Protocol: 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