Gate In Place

GATE CS 2027 Syllabus: Every Subject and Topic

The complete GATE CS (Computer Science and Information Technology) syllabus on one page — 13 subjects and 79 topics, with what each topic covers and how many previous year questions we have for it. Sign up free to practise any topic.

Engineering Mathematics

3 topics

Linear Algebra Coming soon

Covers: Matrices and Determinants · Systems of Linear Equations · LU Decomposition · Eigenvalues and Eigenvectors

Calculus Coming soon

Covers: Limits, Continuity and Differentiability · Maxima and Minima · Mean Value Theorem · Integration

Probability and Statistics Coming soon

Covers: Random Variables · Uniform, Normal, Exponential, Poisson and Binomial Distributions · Mean, Median, Mode and Standard Deviation · Conditional Probability and Bayes' Theorem

Discrete Mathematics

5 topics

Mathematical Logic Coming soon

Covers: Propositional Logic · Logical Equivalence · Inference Rule · Predicate Logic · Quantifier

Lattices and Group Theory Coming soon

Covers: Partial Orders and Lattices · Monoids and Groups

Combinatorics Coming soon

Covers: Permutations, Combinations and Binomial Identities · Recurrence Relations · Generating Functions

Graph Theory Coming soon

Covers: Graph Basics and Degree Sequences · Types of Graph Connectivity · Matching, Colouring, Planarity and Graph Numbers

Digital Logic

4 topics

Number System Coming soon

Covers: Number Systems and Conversion · Signed Binary Numbers and Overflow · Binary Codes (BCD, Excess-3, Gray) · Number Representation and Arithmetic (Fixed and Floating Point)

Boolean Algebra Coming soon

Covers: Boolean Algebra · Logic Gates and Functional Completeness · Karnaugh Map and Tabular Method

Combinational Circuit Coming soon

Covers: Arithmetic Circuits (Adders, Subtractors, BCD Adder) · Code Converters and Binary Comparator Circuits · BCD to Excess-3 and Excess-3 to BCD Converter Circuits · Multiplexers and Demultiplexers · Decoders, Encoders and Priority Encoders · Hazards in Combinational Circuits · Programmable Logic (ROM, PLA, PAL)

Sequential Circuit Coming soon

Covers: Latches and Flip-Flops · Registers · Asynchronous and Synchronous Counters · Sequential Circuit Design (FSM, State Diagrams)

Computer Organization & Architecture

9 topics

Machine Instruction Coming soon

Covers: Basics of COA, Registers and Buses · Instruction Set Architecture (RISC, CISC) · Micro-operations and Microprogram

Addressing Modes Coming soon

ALU Data Path and Control Unit Coming soon

Covers: ALU and Data Path · Design of Control Unit (Hardwired and Microprogrammed) · Computer Arithmetic

IO Interface Coming soon

Covers: I/O Organization and Modes of Data Transfer · DMA · Serial Communication Interface

Interrupt Coming soon

Pipeline Processor Coming soon

Covers: Instruction Pipelining · Performance Evaluation of Pipeline · Pipeline Hazards and Dependencies

Cache Memory Coming soon

Covers: Memory Hierarchy Design · Cache Memory Mapping · Cache Replacement Techniques and Updation Policy

Secondary Storage Coming soon

Memory Chip Design Coming soon

C Programming

2 topics

Data Types, Operators, Control Flow and Functions Coming soon

Covers: Data Types and Operators · Control Flow Statements · Functions and Recursion

Storage Classes, Pointers, Arrays and Structures Coming soon

Covers: Storage Classes · Static and Dynamic Scoping · Pointers and Arrays · Dynamic Memory Allocation · Strings · Structures and Unions

Data Structures

6 topics

Arrays Coming soon

Linked Lists Coming soon

Stacks Coming soon

Queues Coming soon

Trees and Binary Search Trees Coming soon

Covers: Binary Trees · Binary Search Trees · AVL Tree · B Tree · B+ Tree · Heap Tree · n-ary Tree

Graphs Coming soon

Algorithms

5 topics

Algorithm Analysis & Asymptotic Notations Coming soon

Covers: Asymptotic Notation, Finding Time Complexity · Solving Recurrence Relations

Divide and Conquer Coming soon

Covers: Divide and Conquer · Binary Search · Max-Min · Matrix Multiplication · Linear Search · Hashing

Sorting Coming soon

Covers: Merge Sort · Quick Sort · Elementary Sorting (Insertion, Selection, Bubble) · Heaps · Radix Sort

Dynamic Programming Coming soon

Covers: Dynamic Programming

Greedy Method and Graph Techniques Coming soon

Covers: Greedy Method · Minimum Spanning Trees · Single-Source Shortest Paths · All-Pairs Shortest Paths · Graph Traversals (BFS and DFS) · Graph Techniques

Theory of Computation

10 topics

Regular Expression Coming soon

Regular Grammar Coming soon

Regular Language Coming soon

Covers: Regular Languages · Pumping Lemma for Regular Languages · Closure Properties of Regular Languages

Finite Automata Coming soon

Covers: Finite Automata (DFA) · NFA and Conversion to DFA · DFA Construction and Counting States · DFA Minimization · Finite Automata with Output (Mealy, Moore)

Context Free Language Coming soon

Covers: Pumping Lemma for CFLs · Normalisation of CFG, DCFL, CFL and Closure Properties

Push-down Automata Coming soon

Recursive Language Coming soon

Covers: Recursive and RE Language Identification · Closure Properties of Recursive and RE Languages · LBA and Context-Sensitive Languages

Turing Machine Coming soon

Undecidability Coming soon

Covers: Decidability and Undecidability · Reducibility and Complexity

Compiler Design

6 topics

Lexical Analysis Coming soon

Covers: Phases of a Compiler · Lexical Analysis

Parsing Coming soon

Syntax-directed Translation Coming soon

Covers: Syntax-Directed Definitions (S- and L-attributed) · Syntax-Directed Translation Schemes · Semantic Analysis (SDT)

Code Optimization Coming soon

Covers: Basic Blocks, DAGs and Flow Graphs · Local Optimization · Data Flow Analysis (Liveness Analysis, Constant Propagation, Common Sub-expression Elimination)

Operating System

9 topics

Process Coming soon

Covers: Operating System Basics (Kernel, Modes, Interrupts) · Process Concept and Context Switching · Inter-Process Communication

CPU Scheduling Coming soon

Process Synchronization Coming soon

Covers: Critical Section: Software and Hardware Solutions · Classical IPC Problems · Concurrency and Synchronization

Deadlock Coming soon

Memory Management Coming soon

Covers: Memory Management Techniques (Fixed, Variable Partitioning, Fragmentation) · Paging and TLB · Memory Management and Virtual Memory · Page Replacement Techniques

File Systems Coming soon

Disk Scheduling Coming soon

System Call Coming soon

Thread Coming soon

Databases

9 topics

ER Model Coming soon

Relational Schema Coming soon

Covers: Introduction of RDBMS · Candidate Keys and Super Keys

Relational Algebra Coming soon

Normal Form Coming soon

Covers: Functional Dependencies and Normalization (Membership Set, Equality of FD Sets) · Minimal Cover · Normal Forms · Properties of Decomposition · Decomposition into Higher Normal Forms

Transactions Coming soon

Covers: Recoverable Schedules (Cascadeless, Strict) · Conflict and View Serializability (Serializable Schedules) · Lock-Based and Timestamp Protocols (2PL, Timestamp Ordering) · Recovery (Logs and Checkpoints)

SQL Coming soon

Covers: Structured Query Language (SQL): Basics, Joins and Set Operations · SQL: Nested Queries, Aggregation and Views

Tuple Calculus Coming soon

File Organization and Indexing Coming soon

Covers: File Organization and Blocking · Indexing (Single-Level and Multi-Level) · B Trees and B+ Trees

Computer Networks

7 topics

OSI Layer Coming soon

Covers: OSI and TCP/IP Layering · Packet Basics, Circuit and Virtual Circuit Switching · Performance Metrics (Delays, Throughput)

Physical Layer Coming soon

Data Link Layer Coming soon

Covers: Framing and Error Detection · Medium Access Control · Ethernet Bridging

Network Layer Protocol Coming soon

Covers: IP Addressing · CIDR Notation · Subnetting, Supernetting and Longest Prefix Match · IPv4 Header and Fragmentation · ARP, DHCP and ICMP · Network Address Translation (NAT) · Routing Basics: Shortest Path and Flooding · Distance Vector Routing · Link State Routing

Transport Layer Protocol Coming soon

Covers: UDP · TCP Basics · TCP Flow Control and Congestion Control · Sockets

Application Layer Protocols Coming soon

Covers: DNS · HTTP and the Web · SMTP, FTP and Email

Network Security Coming soon

General Aptitude

4 topics

Verbal Aptitude Coming soon

Covers: Basic English grammar: tenses, articles, adjectives, prepositions, conjunctions, verb-noun agreement, and other parts of speech · Basic vocabulary: words, idioms, and phrases in context · Reading and comprehension, Narrative sequencing

Quantitative Aptitude Coming soon

Covers: 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, exponents and logarithms, permutations and combinations, and series. Mensuration and geometry, Elementary statistics and probability

Analytical Aptitude Coming soon

Covers: Logic: deduction and induction, Analogy, Numerical relations and reasoning

Spatial Aptitude Coming soon

Covers: Transformation of shapes: translation, rotation, scaling, mirroring, assembling, and grouping; paper folding, cutting, and patterns in 2 and 3 dimensions

Practise GATE CS topic by topic

Sign up free to practise every previous year question one topic at a time, and see which parts of each topic you're strong or weak at.

Create your free accountSign in

GATE CS exam pattern & preparation guide →

← All GATE CS previous year papers

Frequently asked questions

Is this the official GATE CS syllabus?

It covers every subject and topic of the official GATE 2027 CS syllabus, grouped the way GATE coaching test series divide it into topics, with what each topic covers listed under it.

Do I need an account to read the GATE CS questions and answers?

Yes. Reading a question, its answer key or its explanation needs a free account. Without one you can see the full syllabus and how many questions each topic has.

Can I practise one topic at a time?

Yes. With a free account you can practise every previous year question for one topic, with no timer, and see which parts of the topic you are strong or weak at.