THE IAE ENGINEER’S BRIEF
GATE CS Syllabus-to-Question Map: What 2026 Actually Asked
The official GATE 2027 Computer Science syllabus splits into 70 lines. Reading the GATE 2026 CS1 paper against it, all 55 subject questions and all 85 subject marks fall on just 32 of those lines, leaving 38 untested that year. This page prints every line, the questions tagged to it, and the question numbers, so you can open the paper and check any row.
The official 2027 CS syllabus PDF was split at its own semicolons and full stops into 70 items, after stripping the running page footer. The GATE 2026 CS1 paper hosted on this site was read for questions Q.11 to Q.65, with marks taken from the paper's own block headers. IAE Academy then tagged each question to one syllabus line. The 55 questions account for all 85 subject marks, which is the arithmetic check on the tagging.
Facts checked 23 September 2026
Every line of the official GATE 2027 Computer Science syllabus, and the questions GATE 2026 asked against it
| Syllabus item | The line, verbatim from the official 2027 PDF | Asked in GATE 2026 (CS1) |
|---|---|---|
| S1-01 — Section 1: Engineering Mathematics | Discrete Mathematics: Propositional and first order logic | not asked in 2026 |
| S1-02 — Section 1: Engineering Mathematics | Sets, relations, functions, partial orders and lattices | not asked in 2026 |
| S1-03 — Section 1: Engineering Mathematics | Monoids, Groups | not asked in 2026 |
| S1-04 — Section 1: Engineering Mathematics | Graphs: connectivity, matching, colouring | Q.47 (2m) · Q.55 (2m) · Q.57 (2m) |
| S1-05 — Section 1: Engineering Mathematics | Combinatorics: counting, recurrence relations, generating functions | Q.12 (1m) |
| S1-06 — Section 1: Engineering Mathematics | Linear Algebra: Matrices | Q.20 (1m) |
| S1-07 — Section 1: Engineering Mathematics | determinants | not asked in 2026 |
| S1-08 — Section 1: Engineering Mathematics | system of linear equations | not asked in 2026 |
| S1-09 — Section 1: Engineering Mathematics | eigenvalues and eigenvectors | Q.13 (1m) |
| S1-10 — Section 1: Engineering Mathematics | LU decomposition | not asked in 2026 |
| S1-11 — Section 1: Engineering Mathematics | Calculus: Limits | not asked in 2026 |
| S1-12 — Section 1: Engineering Mathematics | continuity and differentiability | Q.32 (1m) · Q.46 (2m) |
| S1-13 — Section 1: Engineering Mathematics | Maxima and minima | not asked in 2026 |
| S1-14 — Section 1: Engineering Mathematics | Mean value theorem | not asked in 2026 |
| S1-15 — Section 1: Engineering Mathematics | Integration | not asked in 2026 |
| S1-16 — Section 1: Engineering Mathematics | Probability and Statistics: Random variables | Q.11 (1m) · Q.58 (2m) |
| S1-17 — Section 1: Engineering Mathematics | Uniform | not asked in 2026 |
| S1-18 — Section 1: Engineering Mathematics | normal | not asked in 2026 |
| S1-19 — Section 1: Engineering Mathematics | exponential | not asked in 2026 |
| S1-20 — Section 1: Engineering Mathematics | Poisson and binomial distributions | not asked in 2026 |
| S1-21 — Section 1: Engineering Mathematics | Mean, median, mode and standard deviation | not asked in 2026 |
| S1-22 — Section 1: Engineering Mathematics | Conditional probability and Bayes theorem | not asked in 2026 |
| S2-01 — Section 2: Digital Logic | Boolean algebra and minimization – algebraic technique, Karnaugh map, tabular method | Q.21 (1m) · Q.48 (2m) |
| S2-02 — Section 2: Digital Logic | Design of combinational and sequential circuits | Q.37 (2m) |
| S2-03 — Section 2: Digital Logic | Number representation and arithmetic (fixed and floating point) | Q.22 (1m) · Q.36 (2m) |
| S3-01 — Section 3: Computer Organization and Architecture | Instruction set and addressing modes | Q.14 (1m) · Q.15 (1m) |
| S3-02 — Section 3: Computer Organization and Architecture | Design of arithmetic and logic unit (ALU) | not asked in 2026 |
| S3-03 — Section 3: Computer Organization and Architecture | Design of control unit – hardwired and microprogrammed | not asked in 2026 |
| S3-04 — Section 3: Computer Organization and Architecture | Memory interfacing and hierarchy: performance, cache memory mapping | Q.38 (2m) · Q.54 (2m) |
| S3-05 — Section 3: Computer Organization and Architecture | I/O interface (interrupt and DMA) | not asked in 2026 |
| S3-06 — Section 3: Computer Organization and Architecture | Instruction pipelining, pipeline hazards | Q.16 (1m) · Q.60 (2m) |
| S4-01 — Section 4: Programming and Data Structures | Programming in C | Q.27 (1m) · Q.63 (2m) |
| S4-02 — Section 4: Programming and Data Structures | Recursion | Q.34 (1m) · Q.61 (2m) |
| S4-03 — Section 4: Programming and Data Structures | Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs | Q.23 (1m) · Q.33 (1m) · Q.39 (2m) · Q.40 (2m) · Q.62 (2m) |
| S5-01 — Section 5: Algorithms | Searching, sorting, hashing | Q.24 (1m) |
| S5-02 — Section 5: Algorithms | Asymptotic worst case time and space complexity | Q.17 (1m) |
| S5-03 — Section 5: Algorithms | Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer | not asked in 2026 |
| S5-04 — Section 5: Algorithms | Graph traversals, minimum spanning trees, shortest paths | Q.41 (2m) · Q.49 (2m) · Q.50 (2m) |
| S6-01 — Section 6: Theory of Computation | Regular expressions and finite automata | Q.26 (1m) |
| S6-02 — Section 6: Theory of Computation | Context-free grammars and push-down automata | Q.25 (1m) · Q.52 (2m) |
| S6-03 — Section 6: Theory of Computation | Regular and context-free languages, pumping lemma | Q.51 (2m) |
| S6-04 — Section 6: Theory of Computation | Turing machines and undecidability | not asked in 2026 |
| S7-01 — Section 7: Compiler Design | Lexical analysis, parsing, syntax-directed translation | Q.28 (1m) · Q.53 (2m) |
| S7-02 — Section 7: Compiler Design | Runtime environments | not asked in 2026 |
| S7-03 — Section 7: Compiler Design | Intermediate code generation | not asked in 2026 |
| S7-04 — Section 7: Compiler Design | Local optimisation | not asked in 2026 |
| S7-05 — Section 7: Compiler Design | Data flow analyses: constant propagation | Q.42 (2m) |
| S7-06 — Section 7: Compiler Design | liveness analysis | not asked in 2026 |
| S7-07 — Section 7: Compiler Design | common sub expression elimination | not asked in 2026 |
| S8-01 — Section 8: Operating System | System calls | not asked in 2026 |
| S8-02 — Section 8: Operating System | processes | not asked in 2026 |
| S8-03 — Section 8: Operating System | threads | not asked in 2026 |
| S8-04 — Section 8: Operating System | inter‐process communication | not asked in 2026 |
| S8-05 — Section 8: Operating System | concurrency and synchronization | not asked in 2026 |
| S8-06 — Section 8: Operating System | Deadlock | Q.29 (1m) · Q.35 (1m) |
| S8-07 — Section 8: Operating System | CPU and I/O scheduling | Q.64 (2m) |
| S8-08 — Section 8: Operating System | Memory management and virtual memory | not asked in 2026 |
| S8-09 — Section 8: Operating System | File systems | Q.59 (2m) |
| S9-01 — Section 9: Databases | ER‐model | not asked in 2026 |
| S9-02 — Section 9: Databases | Relational model: relational algebra, tuple calculus, SQL | Q.43 (2m) |
| S9-03 — Section 9: Databases | Integrity constraints, normal forms | Q.30 (1m) · Q.31 (1m) · Q.65 (2m) |
| S9-04 — Section 9: Databases | File organization, indexing (e.g., B and B+ trees) | not asked in 2026 |
| S9-05 — Section 9: Databases | Transactions and concurrency control | not asked in 2026 |
| S10-01 — Section 10: Computer Networks | Principles of Layering | not asked in 2026 |
| S10-02 — Section 10: Computer Networks | Basics of switching (circuit, packet and virtual circuit) and performance metrics | not asked in 2026 |
| S10-03 — Section 10: Computer Networks | Data link layer: error detection, Medium Access Control, Ethernet | Q.45 (2m) |
| S10-04 — Section 10: Computer Networks | Distance vector and link state routing | not asked in 2026 |
| S10-05 — Section 10: Computer Networks | IPv4 - Fragmentation, CIDR Notation, Network Address Translation | Q.56 (2m) |
| S10-06 — Section 10: Computer Networks | TCP- flow control and congestion control, socket API | Q.18 (1m) · Q.44 (2m) |
| S10-07 — Section 10: Computer Networks | DNS and HTTP | Q.19 (1m) |
Source: Left and middle columns: the official GATE 2027 Computer Science and Information Technology syllabus PDF, split into 70 items at its own semicolons and full stops, read 23 September 2026. Right column: IAE Academy's reading of the GATE 2026 CS1 question paper hosted on this site (46 pages, md5 d96165bbe9fa), in which questions Q.11 to Q.65 are the subject questions and the paper's own headers fix Q.11–Q.35 at one mark and Q.36–Q.65 at two. THE TAG IS IAE'S JUDGEMENT, NOT THE ORGANISING INSTITUTE'S — the official answer key labels a question only “GA” or “CS”, never by section — so every row is printed with its question number so you can open the paper and disagree with it. The 55 subject questions account for all 85 subject marks. Three graph questions (Q.47 vertex cover, Q.55 two-colourability, Q.57 matchings) are tagged to Section 1's “Graphs: connectivity, matching, colouring” and read equally as Section 5's graph line; that is why Section 1 carries 15 marks here against the 13 the brochure allocates to Engineering Mathematics on printed page 4. No solution, explanation, difficulty rating or 2027 forecast appears anywhere on this page.
| Paper | In this edition | Why |
|---|---|---|
| GATE 2026 (CS1) | Yes — all 55 subject questions tagged | Text layer present; the paper's own mark-block headers give the marks |
| GATE 2026 (CS2) | Not yet | Second session, same year; it is hosted and readable and is the next one to be added |
| GATE 2024, 2025 | Not yet | Hosted and readable; queued behind the 2026 sessions |
| GATE 2023, 2022, 2020, 2018 | Not yet | Hosted and readable, and four of them carry the organising institute's official answer key |
| GATE 2021 | No | The hosted file is an image scan with no text layer, so no question can be read from it by script |
| GATE 2019 | No | The hosted file is an image scan with no text layer, so no question can be read from it by script |
Source: Read 23 September 2026 against the twelve GATE CS files hosted on this site. “Image scan” means the PDF carries no text layer at all: a full-text extraction of those two files returns nothing, so their questions cannot be tagged by script and are absent rather than guessed. This table exists so the absence is visible — the map covers one paper today, not nine.
About this resource
A GATE CS candidate holds two things that do not speak to each other: a two-page syllabus written as a bare noun list, and a folder of question papers. Nothing connects them. The syllabus says “Turing machines and undecidability” and gives no sense of whether that is one question a year or five; the paper asks a question and does not say which line of the syllabus it came from — the official answer key labels a question only “GA” or “CS”, never by section.
This page is that missing join, for one paper and one year to begin with. Each of the 70 syllabus lines is printed verbatim with the GATE 2026 questions tagged to it. Where a line was not tested in 2026 the row says so, because an untested line is information too — 38 of the 70 carried no question at all that year.
The tag is IAE Academy's reading and nothing more. It is not the organising institute's classification, because the institute does not publish one. That is why every row names the question number: open the hosted GATE 2026 paper, read Q.47, and decide for yourself whether it belongs on Section 1's graph line or Section 5's. Three questions sit exactly on that boundary, and the source note says which.
One consequence of those three is worth stating plainly rather than smoothing over. The brochure allocates Engineering Mathematics 13 of the 100 marks on printed page 4. Tagged this way, Section 1 carries 15 marks in the 2026 paper, because Q.47 on vertex cover, Q.55 on two-colourability and Q.57 on matchings all match Section 1's “Graphs: connectivity, matching, colouring” as readily as they match Section 5. Both readings are defensible; the rows are printed so you can take the other one.
What's included
- ✓All 70 lines of the official GATE 2027 CS syllabus, verbatim, with their section
- ✓Every GATE 2026 CS1 subject question, tagged to a line, with its number and marks
- ✓The 38 syllabus lines that carried no question in 2026, printed rather than omitted
- ✓A coverage table naming the papers this edition could not read, and why
- ✓The arithmetic check: 55 questions, 85 marks, reconciled against the paper
How to use this resource
Read down your weakest section and look at the right-hand column. A line with several 2026 questions against it is a line the paper reached for that year; a line reading “not asked in 2026” is not a promise it will stay untested.
Check any tag you doubt. Open the GATE 2026 paper from /resources/gate-cs-previous-year-papers, find the question number, and read it against the syllabus line printed beside it.
Treat this as one year, not a pattern. It is the 2026 paper only, and the coverage table says which others are still to come. Nothing here forecasts 2027.
For what changed in the syllabus itself between 2026 and 2027, read /resources/gate-cs-2027-syllabus-changes — this page uses the 2027 wording throughout.
Frequently asked questions
Which GATE CS topics carry the most marks?+
This page will not tell you that, and no honest page can from one paper. It shows how the 85 subject marks of GATE 2026 CS1 fell across the syllabus — Section 1 took 15, Section 4 took 14 — but one year is a record, not a weightage and not a forecast. The organising institute publishes no per-section weightage for CS at all; the brochure fixes only General Aptitude at 15 and Engineering Mathematics at 13.
Who decided which syllabus line each question belongs to?+
IAE Academy did, and the page says so on every row. The official answer key labels a question only “GA” or “CS” — it never names a section — so any section-level mapping is somebody's reading. Ours is printed with the question number beside it precisely so it can be disputed: open the paper, read the question, and take a different line if you think it fits better.
Why does Section 1 show 15 marks when the brochure says Engineering Mathematics is 13?+
Because of three questions on the boundary. Q.47 (vertex cover), Q.55 (two-colourability) and Q.57 (matchings) are all 2-mark questions that match Section 1's “Graphs: connectivity, matching, colouring” word for word, and also match Section 5's graph line. Tagged to Section 1 they make it 15; tagged to Section 5 they would make it 9. We did not move them to make the number agree with the brochure.
Does this cover every GATE CS paper?+
No — this edition covers GATE 2026 CS1 only, and the coverage table on the page names every other hosted paper and why it is not here yet. Two of the twelve, 2019 and 2021, are image scans with no text layer at all, so no question can be read from them by script; those are absent rather than guessed. The remaining years are readable and queued.
Are the answers on this page?+
No. There are no solutions, no explanations and no worked steps anywhere on this page, by design. It tells you which syllabus line a question came from and where to find the question; the route to the answer is not here. Where the organising institute has published an official key for a paper, that key is in the paper itself — 18 of the 50 papers hosted on this site carry one.
Want guidance beyond free papers?
Our GATE programmes come with mentor support, 1:1 sessions, and a structured curriculum — not just a PDF.