PrepMaticGATE · Branch-wise preparation
GATE CSE preparation: the 2027 syllabus, subject order, books and a plan
On this page
- How the 100 marks are split in GATE CS
- The GATE 2027 CS syllabus, section by section
- Where the marks tend to come from
- The order to study the subjects
- Books commonly used for GATE CS
- A CS-specific plan for about 26 weeks
- Mistakes that cost CS aspirants marks
- Choosing a second paper
- Practising GATE CS with PrepMatic
- Frequently asked questions
- Official sources
The GATE CS (Computer Science and Information Technology) 2027 paper tests ten syllabus sections: Engineering Mathematics (13 marks), nine core subjects from Digital Logic to Computer Networks (72 marks together) and General Aptitude (15 marks). IIT Madras revised every GATE syllabus for 2027, the first revision since 2021, and Programming and Data Structures is in C. Start with C, data structures and algorithms, because they feed into Operating Systems, Compiler Design and much of the rest, then work through the other subjects in the order below.
How the 100 marks are split in GATE CS
| Part | Marks | What it covers |
|---|---|---|
| General Aptitude | 15 | Verbal, quantitative, analytical and spatial aptitude |
| Engineering Mathematics | 13 | Discrete maths, linear algebra, calculus, probability |
| Core CS subjects | 72 | Digital Logic, COA, C and data structures, Algorithms, TOC, Compiler Design, OS, Databases, Networks |
| Total | 100 | 65 questions in 3 hours |
The question types (MCQ, MSQ and NAT) and the negative-marking rules are the same for every paper; see the GATE exam pattern. CS is one of the most crowded GATE papers. In GATE 2026, 2,59,922 candidates registered for it and 2,11,020 appeared, and the General-category qualifying mark was 30.0 out of 100 (official table from IIT Guwahati). That figure is an illustration only. Qualifying marks are computed after every exam, as explained in GATE score and normalisation. CS ran in two sessions in 2026, so it is also a paper where normalisation matters.
The GATE 2027 CS syllabus, section by section
The middle column below condenses the official 2027 CS syllabus from the IIT Madras syllabus page. The last column is a general description of how each subject is usually tested, based on past papers, and not an official statement.
| Section | What the 2027 syllabus lists | Usual question style |
|---|---|---|
| 1. Engineering Mathematics | Discrete maths: propositional and first-order logic; sets, relations, functions, partial orders, lattices; monoids and groups; graph connectivity, matching and colouring; counting, recurrences, generating functions. Linear algebra: determinants, linear systems, eigenvalues, LU decomposition. Calculus. Probability: random variables, uniform, normal, exponential, Poisson and binomial distributions, Bayes' theorem | Short formula-driven problems, often with numerical answers |
| 2. Digital Logic | Boolean algebra and minimisation (algebraic, Karnaugh map, tabular method); combinational and sequential circuit design; fixed and floating-point number representation and arithmetic | Minimising functions, counters, flip-flop design, number conversions |
| 3. Computer Organization and Architecture | Instruction set and addressing modes; ALU design; hardwired and microprogrammed control unit; memory hierarchy and cache mapping; I/O interface (interrupt and DMA); pipelining and hazards | Cache and pipeline numericals, addressing modes |
| 4. Programming and Data Structures | Programming in C; recursion; arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs | Reading C code and predicting output; pointer and recursion tracing; heap and BST operations |
| 5. Algorithms | Searching, sorting, hashing; asymptotic worst-case time and space complexity; greedy, dynamic programming and divide-and-conquer; graph traversals, minimum spanning trees, shortest paths | Recurrences and complexity, dynamic programming, running graph algorithms by hand |
| 6. Theory of Computation | Regular expressions and finite automata; context-free grammars and push-down automata; regular and context-free languages, pumping lemma; Turing machines and undecidability | Language classification, closure and decidability statements, counting states |
| 7. Compiler Design | Lexical analysis, parsing, syntax-directed translation; runtime environments; intermediate code generation; local optimisation; data-flow analyses (constant propagation, liveness analysis, common sub-expression elimination) | Parsing tables and sets, syntax-directed evaluation, liveness by hand |
| 8. Operating System | System calls, processes, threads, inter-process communication, concurrency and synchronisation; deadlock; CPU and I/O scheduling; memory management and virtual memory; file systems | Scheduling and page-replacement numericals, semaphore puzzles |
| 9. Databases | ER model; relational model, relational algebra, tuple calculus, SQL; integrity constraints, normal forms; file organisation and indexing (B and B+ trees); transactions and concurrency control | SQL queries, keys and normal forms, B+ tree sizing, serialisability |
| 10. Computer Networks | Layering; circuit, packet and virtual-circuit switching and performance metrics; error detection, medium access control, Ethernet; distance-vector and link-state routing; IPv4 fragmentation, CIDR, NAT; TCP flow and congestion control, socket API; DNS and HTTP | Subnetting and CIDR, delay and throughput numericals, TCP behaviour |
We have not compared this list topic by topic with earlier years, so don't assume what is new or dropped. Use the official CS syllabus PDF as your checklist, and check any topic in your old notes against it before you spend time on it.
Where the marks tend to come from
GATE publishes no topic weightage, so any table of marks per subject is an unofficial reading of past papers. Qualitatively, in recent papers Programming and Data Structures and Algorithms have been among the larger blocks, with Operating Systems, Databases, Theory of Computation, Computer Organization and Computer Networks in the middle. Digital Logic and Compiler Design are the smaller blocks. They are also among the quickest to finish, which makes them good value for time.
Two cautions. Every section has appeared regularly, so skipping one is a gamble rather than a strategy. And because the syllabus was revised, past-paper patterns are a weaker guide for 2027 than usual. Use them to learn the question style, not to decide what to skip.
The order to study the subjects
- C programming, then data structures. Everything in Algorithms, Operating Systems and Compiler Design assumes you can read code.
- Algorithms. Do it right after data structures while the structures are fresh.
- Engineering Mathematics. Discrete maths, probability and linear algebra can run alongside the first two steps, an hour a day. Counting and recurrences from discrete maths also support Algorithms.
- Digital Logic, then Computer Organization. Pipelining and cache questions need the logic basics.
- Theory of Computation, then Compiler Design. Parsing builds directly on grammars and automata.
- Operating Systems. Long, but the numericals are very learnable.
- Databases. Independent of the rest. SQL needs hands-on practice.
- Computer Networks. Fairly self-contained. Finish it with subnetting and TCP numericals.
Books commonly used for GATE CS
GATE does not recommend any book; its own advice is to use the official syllabus and past papers. These are well-known references. Pick one per subject and finish it rather than sampling five.
| Subject | Commonly used reference |
|---|---|
| Discrete maths | Discrete Mathematics and Its Applications, Kenneth Rosen |
| Linear algebra | Introduction to Linear Algebra, Gilbert Strang |
| Probability | A First Course in Probability, Sheldon Ross |
| Digital Logic | Digital Design, M. Morris Mano and Michael Ciletti |
| Computer Organization | Computer Organization and Design, Patterson and Hennessy, or Hamacher, Vranesic and Zaky |
| C and data structures | The C Programming Language, Kernighan and Ritchie; Data Structures Using C, Tenenbaum, Langsam and Augenstein |
| Algorithms | Introduction to Algorithms (CLRS), Cormen, Leiserson, Rivest and Stein |
| Theory of Computation | Introduction to the Theory of Computation, Michael Sipser |
| Compiler Design | Compilers: Principles, Techniques, and Tools, Aho, Lam, Sethi and Ullman |
| Operating Systems | Operating System Concepts, Silberschatz, Galvin and Gagne |
| Databases | Database System Concepts, Silberschatz, Korth and Sudarshan |
| Computer Networks | Computer Networking: A Top-Down Approach, Kurose and Ross, or Computer Networks, Tanenbaum |
A CS-specific plan for about 26 weeks
This is an illustration for someone who has studied these subjects once in college. Scale the weeks to the time you have, and see the GATE preparation strategy for general 6-month and 12-month plans.
| Weeks | Work |
|---|---|
| 1-16 | First pass in the order above: C and data structures (2), Algorithms (2), Engineering Mathematics (2), Digital Logic (1), Computer Organization (1), Theory of Computation (2), Compiler Design (1), Operating Systems (2), Databases (2), Networks (1). End each subject with a topic-wise set of questions. |
| 17-20 | Second pass on weak subjects, using your error log. Add 15 minutes of General Aptitude every day (see GATE General Aptitude). |
| 21-26 | Full-length mocks under exam conditions on the virtual calculator, with analysis after each. Revise only from the error log. |
Past papers do most of the work in the last two phases. The previous year papers guide covers where to find the official ones and how to use them.
Mistakes that cost CS aspirants marks
- Learning C from theory only. Output-prediction questions reward tracing code by hand. Write and trace small programs on pointers and recursion until it is automatic.
- Treating discrete maths and probability as "just maths". With linear algebra and calculus they are 13 marks, as many as a mid-sized core subject. The Engineering Mathematics guide covers the shared topics.
- Misusing question types. Negative marking applies only to MCQs. MSQ and NAT have none, but MSQ gives no partial credit, so a half-right MSQ scores zero.
- Ignoring General Aptitude. It is 15 marks for a few minutes of daily practice.
Choosing a second paper
You can take one paper or two. CS may be paired with DA, EC, GE, MA, ME, PH, RA or ST. CS with EE is not an allowed pair. CS plus DA is a popular choice because probability, linear algebra, databases and basic algorithms overlap; the GATE Data Science and AI guide shows the DA syllabus so you can judge the extra load. Both papers go in one application. The rules are on the GATE eligibility page, and the full list is on the GATE exam hub.
Practising GATE CS with PrepMatic
PrepMatic's free GATE assessment is a short diagnostic of about 15 multiple-choice questions with no timer. It shows a projected score out of the paper's maximum, your weakest and strongest subjects and an answer review with explanations. The study plan is built from your exam date, daily hours and study days, and you can take topic tests and mocks focused on your weak subjects. Practice questions are AI-generated, not official GATE papers, so use the official past papers alongside it, especially for NAT and MSQ practice.
Frequently asked questions
Has the GATE CS syllabus changed for 2027?
Yes. IIT Madras revised the syllabus of every GATE paper for 2027, the first revision since 2021. Use the 2027 CS PDF on the official site rather than a list from earlier years. This page has not compared the two versions topic by topic.
How many marks does Engineering Mathematics carry in GATE CS?
Engineering Mathematics carries 13 marks out of 100. The core CS subjects carry 72 marks and General Aptitude 15. The maths block covers discrete mathematics, linear algebra, calculus, probability and statistics.
Which programming language is used in GATE CS?
Programming and Data Structures is in C. Code-reading questions are written in C or C-like pseudocode. GATE DA uses Python instead.
Can I take GATE CS and DA together?
Yes. DA is on the allowed list for CS. Both are in one application, and you sit one session of each paper. CS and EE cannot be combined.
Must I take GATE CS to get into an M.Tech in computer science?
Not necessarily. Each admitting institute decides which GATE papers it accepts for a programme, and choosing a paper outside your own discipline is allowed. Check the admission page of every programme you are considering.
Official sources
- GATE 2027 official website (IIT Madras): syllabus, dates and the downloads page with past papers and answer keys.
- GATE 2027 CS syllabus PDF: the official section-wise topic list.
- GATE 2027 Information Brochure: paper pattern, marks distribution and paper combinations.
- GATE 2026 cut-off page (IIT Guwahati): the 2026 figures quoted above.
Confirm the syllabus and exam dates against the latest information on the official site before relying on any detail here.
Turn the GATE syllabus into a plan you can finish
Take a free GATE assessment on PrepMatic. It shows where you stand in your branch, turns the syllabus into a plan around the hours you actually have, and builds mock tests focused on your weak subjects.
Start free assessment →Free forever plan · No credit card · 2-minute setupRelated guides
- GATE exam patternGATE 2027 pattern: 65 questions, 100 marks, 3 hours, MCQ, MSQ and NAT, negative marking, marks split by paper, 30 papers and two-paper combinations.
- GATE engineering mathematicsGATE engineering mathematics for 2027: marks per paper, the maths topics for CS, EC, EE, ME, CE and RA, which topics repeat across branches, and an 8-week plan.
- GATE General AptitudeGATE General Aptitude: 10 questions for 15 marks in every paper, the verbal, quantitative, analytical and spatial topics, worked examples and a daily routine.
- GATE Data Science and AIThe GATE DA 2027 paper: seven syllabus sections for 85 marks, who should pick DA over CS, Python and maths priorities, books, and a six-month order of study.
- How to prepare for GATEHow to prepare for GATE 2027: a plan for the 17 weeks left, plus 6-month and 12-month plans, subject order, revision, mocks and tips for working aspirants.
- GATE previous year papersWhere to download GATE previous year papers (2007 to 2026) and answer keys (2021 to 2026), how to use them topic-wise and full-length, plus mock test analysis.
More in Branch-wise preparation
- GATE ECE preparationGATE EC 2027 preparation: the revised eight-section syllabus, the order to study Networks, Signals, Analog, Digital, Communications and EM, books, and a plan.
- GATE Electrical preparationGATE EE 2027 preparation: the revised ten-section syllabus, which subjects to study first, standard books, a 21-week first pass and the EE plus EC pairing.
- GATE Mechanical preparationGATE ME 2027 preparation: the revised four-section syllabus broken into 18 topic areas, study order, standard books, a 19-week plan and the ME plus XE pairing.
- GATE Civil preparationGATE CE 2027 preparation: the revised eight-section syllabus, structures-first study order, standard books, a 23-week first pass and second-paper options.