Graduate Aptitude Test in Engineering — Computer Science
IIT Madras (organising institute for GATE 2027) · Online (CBT) · Annual (February)
CBT Simulator
Recommended · FreePractice mock tests, PYQs, and topicwise questions in the official exam interface. Regular CBT simulation increases success rates by up to 40%!
AI Predictors
AI Powered · FreeExpected college selection and rank reports. Get immediate insights based on expected percentiles or mock scores to plan your admissions!
GATE CS Syllabus
Complete chapter-wise syllabus covering all subjects. Updated as per official exam pattern.
Basic English Grammar, Tenses, Articles and Adjectives, Prepositions, Conjunctions, Verb-Subject Agreement, Vocabulary: Idioms and Words in Context, Reading Comprehension, Sequencing of Ideas, Critical Reasoning and Verbal Deduction
Quantitative AptitudeData Interpretation: Tables, Graphs and Charts, Numerical Computation and Estimation, Ratios, Percentages, Powers and Exponents, Logarithms, Permutations and Combinations, Mensuration, Geometry and Elementary Statistics, Probability
Analytical AptitudeLogic: Deduction and Induction, Analogy, Numerical Relations and Reasoning
Spatial AptitudeTransformation of Shapes: Translation, Rotation, Scaling, Mirroring, Assembling and Grouping, Paper Folding, Cutting and Inking, Patterns in 2 and 3 Dimensions
Propositional and First-Order Logic, Sets, Relations, Functions and Partial Orders, Groups: Lattice Theory and Graph Theory, Combinatorics: Counting, Recurrence Relations, Generating Functions
Linear AlgebraMatrices and Determinants, Systems of Linear Equations, Eigenvalues and Eigenvectors
CalculusLimits, Continuity and Differentiability, Maxima and Minima, Integrals and Series
ProbabilityConditional Probability and Random Variables, Mean, Median, Mode and Standard Deviation, Uniform, Normal, Exponential, Poisson and Binomial Distributions, Bayes Theorem
Boolean Functions, Minimisation: K-Maps and Quine-McCluskey
Combinational CircuitsArithmetic Circuits: Adders, Subtractors, Code Converters, Multiplexers, Decoders, Comparators
Sequential CircuitsLatches and Flip-Flops, Counters and Shift Registers, Finite State Machines
Number RepresentationFixed and Floating Point Representation, Computer Arithmetic: Addition, Multiplication, Error Detection Codes
Instruction Formats, Addressing Modes, Instruction Sequencing, RISC vs CISC
ALU, Datapath and Control UnitInstruction Pipelining, Pipeline Hazards and Stalls, Structural, Data and Control Hazards
Memory HierarchyCache Memory and Mapping Techniques, Main Memory and Secondary Memory, Virtual Memory and Page Replacement
I/O InterfaceInterrupts and DMA, Programmed I/O, Interrupt-Driven I/O
Data Types, Scope and Storage Classes, Functions, Parameter Passing and Recursion, Pointers, Arrays and Structures, Dynamic Memory Allocation
Linear Data StructuresArrays and Linked Lists, Stacks, Queues and Deques, Applications: Expression Evaluation, Infix to Postfix
TreesBinary Trees: Traversals and Properties, Binary Search Trees, Heaps and Priority Queues
Asymptotic Worst-Case Time and Space Complexity, Algorithm Design Techniques, Recursive Algorithms and Recurrence Relations
Searching, Sorting and HashingComparison Sorts: Merge, Quick, Heap, Counting and Radix Sort, Hashing: Chaining and Open Addressing
Graph AlgorithmsBFS, DFS and Applications, Shortest Paths: Dijkstra, Bellman-Ford, Minimum Spanning Tree: Prim, Kruskal, Topological Sort
Algorithm Design ParadigmsGreedy Algorithms, Divide and Conquer, Dynamic Programming
Complexity ClassesPolynomial Time: P, NP, NP-Complete, NP-Hard, Reductions and Cook-Levin Theorem
DFA, NFA and Regular Expressions, Pumping Lemma, Minimisation of DFA
Context-Free Languages and Pushdown AutomataCFGs and Parse Trees, Normal Forms, Pumping Lemma for CFLs
Turing Machines and UndecidabilityRecursive and Recursively Enumerable Languages, Halting Problem, Reductions and Undecidable Problems, Rice's Theorem
Regular Expressions and Lexical Patterns, Finite Automata for Tokenisation
ParsingGrammars and Ambiguity, Top-Down Parsing: Recursive Descent, LL(1), Bottom-Up Parsing: LR(0), SLR, LALR, CLR
Syntax-Directed TranslationSyntax-Directed Definitions and Translation Schemes, Attribute Grammars
Runtime Environments and Intermediate CodeActivation Records and Storage Allocation, Three-Address Code, Static Single Assignment Form
Local OptimisationBasic Blocks and Flow Graphs, Data Flow Analysis, Constant Propagation and Common Subexpression Elimination
Process States and System Calls, Threads and Concurrency, Scheduling Algorithms: FCFS, SJF, Round Robin, Priority
Inter-Process Communication and SynchronisationCritical Section Problem, Semaphores and Monitors, Classical Synchronisation Problems
DeadlockNecessary Conditions, Banker's Algorithm, Detection and Recovery
Memory ManagementPaging and Segmentation, Virtual Memory, Page Replacement: FIFO, LRU, Optimal, Thrashing
File SystemsDirectory Structures, File Allocation Methods, Disk Scheduling: FCFS, SSTF, SCAN, C-SCAN
Entities, Attributes and Relationships, ER Diagrams and Conversion to Tables
Relational ModelRelational Algebra and Tuple Calculus, Integrity Constraints and Keys
SQLDDL, DML and DCL, Joins, Subqueries, Aggregates, Set Operations and Nested Queries
NormalisationFunctional Dependencies, 1NF, 2NF, 3NF and BCNF, Lossless Join and Dependency Preservation
Transactions and ConcurrencyACID Properties, Serialisability, Locking Protocols: 2PL, Recovery: Log-Based Recovery, Checkpoints
OSI and TCP/IP Models, Protocol Layering and Services
Data Link LayerFraming and Error Detection: CRC, Parity, Sliding Window Protocols, Multiple Access: ALOHA, CSMA, Ethernet
Network LayerIPv4 Addressing and Subnetting, IPv6 and Transition, Routing: Distance Vector, Link State, Fragmentation, ICMP
Transport LayerUDP, TCP: Congestion and Flow Control, Handshakes and Sequence Numbers, TCP Congestion Control: AIMD
Application Layer ProtocolsHTTP, DNS, SMTP, FTP, Email Architecture, Network Security Basics: Firewalls, Certificates
Table of Contents
About Graduate Aptitude Test in Engineering — Computer Science (GATE CS) 2027
The Graduate Aptitude Test in Engineering — Computer Science (GATE CS) is one of the most competitive entrance exams, conducted by the IIT Madras (organising institute for GATE 2027). Preparing for the GATE CS requires systematic practice, conceptual clarity, and regular self-evaluation. Our platform offers dynamic mock tests, previous years' resolved papers, and AI-enabled analysis to help you secure a top rank.
Frequently Asked Questions
Which PSUs recruit through GATE CS 2027?
Major PSUs recruiting through GATE CS include ONGC, BHEL, BSNL, DRDO, ISRO, BARC, NIC, and several other central government organisations. Each PSU sets its own GATE score cutoff.
What is a good GATE CS 2027 score for IITs?
For IIT Bombay CS MTech, you typically need a GATE score above 700 (out of 1000) and rank within top 100-200. IIT Delhi and IIT Madras need similar scores. NIT admission requires ranks within top 1,000-3,000.
How long is the GATE 2027 scorecard valid?
The GATE 2027 scorecard is valid for 3 years from the date of announcement of results. This means you can use GATE 2027 scores for admissions and PSU recruitment until 2030.
What subjects are in GATE CS 2027?
GATE CS covers: Discrete Mathematics, Linear Algebra, Calculus, Probability, Digital Logic, Computer Organisation, Programming (C), Data Structures, Algorithms, Theory of Computation, Compiler Design, OS, DBMS, Computer Networks, and General Aptitude.
Is GATE CS useful if I want to work in software companies?
GATE CS is primarily for MTech/PhD admission and PSU recruitment. Top software companies (Google, Amazon, Microsoft) do not require GATE. However, research labs (DRDO, ISRO, TCS Research) value high GATE scores.
What is the GATE CS qualifying cutoff?
General category qualifying marks: 30 (2026), 29.2 (2025) and 27.6 (2024). The cutoff is stable because CS is GATE's largest paper — the μ+σ qualifying formula rarely moves it far. PSU shortlisting and IIT MTech cutoffs are far higher than the qualifying mark.
How should I start preparing for this GATE paper?
Begin with the official syllabus — GATE questions rarely go outside it. Then work subject-wise with previous year questions (10+ years), and finish with 8-10 full-length CBT mocks. Remember: General Aptitude (15 marks) and Engineering Mathematics (13 marks) are common to every candidate — 28 of your 100 marks come before the core subject even starts.
How to Prepare for GATE CS
Algorithms and Data Structures together account for 15-20 marks — master sorting, trees, graphs, and complexity
Operating Systems and DBMS are high-scoring — past year questions repeat patterns; solve 10 years of papers
Engineering Mathematics (Linear Algebra, Calculus, Probability) contributes 15+ marks — do not skip this section
General Aptitude (10 marks) is easy scoring — practice verbal and numerical ability daily for 15 minutes
Aim for 60+ raw marks: that typically converts to a GATE score above 750 and keeps IIT MTech options open
Practise on a virtual calculator — GATE's on-screen calculator slows down DBMS and COA numericals if unpractised