GATE CSE 2027 Syllabus: What Changed from 2026

Yes, the GATE CSE 2027 syllabus has changed, but only in three of its ten sections. Digital Logic, Computer Organization and Architecture (COA) and Computer Networks were reworded, and Computer Networks lost the most: ARP, DHCP, ICMP, UDP, SMTP, FTP and email are no longer named. Engineering Mathematics, Programming and Data Structures, Algorithms, Theory of Computation, Compiler Design, Operating System, Databases and General Aptitude read exactly as they did in 2026.

Key takeaways

• The official source is CS_GATE2027_Syllabus.pdf on gate2027.iitm.ac.in. The official home page says the syllabi for the 2027 papers have been revised.
• Digital Logic: nothing removed. The tabular (Quine–McCluskey) minimization method is now named.
• COA: control unit design (hardwired and microprogrammed), memory interfacing and memory performance are newly explicit. "Main memory and secondary storage" is gone, so disk geometry is low priority.
• Computer Networks: the largest change. The OSI stack list, framing, bridging, shortest-path and flooding routing, ARP, DHCP, ICMP, UDP, SMTP, FTP and email are no longer named. "Performance metrics" and "socket API" are new.
• The exam keeps the 65-question, 100-mark structure used since 2010, in a 3-hour computer-based test.
• Old PYQs stay useful once you filter out removed topics.

Where to find the official syllabus

The CS syllabus is a two-page PDF published by IIT Madras, the GATE 2027 organizing institute, at gate2027.iitm.ac.in. General Aptitude has its own PDF on the same site. GATE CSE Guide is an independent site, not connected to IIT Madras or the GATE office, so treat the official PDF as final and check it again before the exam.

The syllabus revision did not touch the paper's shape. The CS paper has 65 questions for 100 marks, as it has since 2010: General Aptitude 15 marks, Engineering Mathematics about 13, and core CS subjects about 72. The exam pattern and marking scheme article covers question types and negative marking.

Section-by-section status

Computer Networks: the largest change

Removed from explicit mention in 2027:

• OSI and TCP/IP protocol stacks (replaced by "Principles of Layering")
• Framing, and Ethernet bridging (now just "Ethernet")
• Shortest-path and flooding routing (distance vector and link state remain)
• ARP, DHCP and ICMP
• UDP
• SMTP, FTP and email

Newly explicit: performance metrics for switching and networks, and socket API (previously just "sockets").

Everything else stays: circuit, packet and virtual-circuit switching; error detection; medium access control; Ethernet; distance vector and link state routing; IPv4 fragmentation, CIDR notation and NAT; TCP flow control and congestion control; DNS and HTTP.

Three wording changes are worth reading closely. "Principles of Layering" makes questions that only ask which layer a protocol belongs to less likely, while questions on why layering exists and on encapsulation stay fair. "Socket API" points to the order and role of socket calls, not just the idea of a socket. And because the retained topics now carry the full Computer Networks weight, each of them matters more. The Computer Networks syllabus changes article goes clause by clause.

The book expands every one of these syllabus lines to subtopic and concept level and marks which items are new, retained or dropped. See what the full book covers.

COA: four shifts in emphasis

Two things follow. First, control-memory sizing, horizontal versus vertical microinstructions and memory-chip interfacing deserve a deliberate revision session. Second, magnetic disk geometry and access-time questions are no longer explicitly in COA. Disk scheduling itself is not gone: the Operating System section still says "CPU and I/O scheduling". The full breakdown is in GATE 2027 COA syllabus changes.

Digital Logic: reworded, nothing removed

The 2026 line was short: Boolean algebra, combinational and sequential circuits, minimization, and number representations and computer arithmetic (fixed and floating point).

The 2027 line names the three minimization methods: algebraic technique, Karnaugh map and tabular method. It also puts "Design of" in front of combinational and sequential circuits, and shortens the last clause to "Number representation and arithmetic (fixed and floating point)".

No topic left the syllabus. The practical change is that the tabular (Quine–McCluskey) method is now unambiguously examinable. If you have only ever minimized with K-maps, work through a prime implicant table and essential prime implicants at least once.

The seven unchanged sections

These read exactly as in 2026:

• Engineering Mathematics: propositional and first order logic; sets, relations, functions, partial orders and lattices; monoids and groups; graphs (connectivity, matching, colouring); combinatorics (counting, recurrence relations, generating functions); linear algebra including LU decomposition; calculus; probability and statistics.
• Programming and Data Structures: programming in C, recursion, arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps and graphs.
• Algorithms: searching, sorting, hashing; asymptotic worst-case time and space complexity; greedy, dynamic programming and divide-and-conquer; graph traversals, minimum spanning trees and shortest paths. P, NP and NP-completeness are not named here, and this is not new for 2027.
• 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.
• Compiler Design: lexical analysis, parsing, syntax-directed translation, runtime environments, intermediate code generation, local optimisation, and data-flow analyses (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 algebra, tuple calculus, SQL; integrity constraints and normal forms; file organization and indexing (B and B+ trees); transactions and concurrency control.

General Aptitude also stays the same, with its four parts: Verbal, Quantitative, Analytical and Spatial Aptitude.

What the changes mean for previous year papers

Apart from removed topics, every topic in the 2000–2026 question archive maps to a topic still in the 2027 syllabus. That is why twenty-plus years of papers remain valid practice. The filter is short:

The out-of-syllabus topics in old GATE CSE papers article lists these by year.

How to adjust your preparation

1. Download the official PDF and use it as a checklist. Tick each clause as you finish it.
2. Re-plan Computer Networks. Move ARP, DHCP, ICMP, UDP, SMTP, FTP and email notes to a "background" pile. Put that time into performance metrics, the socket API call sequence and TCP.
3. Add two short COA sessions. One on control unit design (hardwired versus microprogrammed, microinstruction formats), one on memory interfacing.
4. Drop disk-geometry drills from COA, but keep disk scheduling in your Operating System plan.
5. Practise one Quine–McCluskey minimization so the tabular method is not new on exam day.
6. Filter PYQs using the table above instead of throwing out old papers.
7. Don't over-react. Seven of ten sections are untouched. To see how marks have been spread across subjects, read GATE CSE subject-wise weightage.