Out-of-Syllabus Topics in Old GATE CSE Papers (2016–2027)

Old GATE CSE papers contain questions on topics that are no longer in the syllabus, and three revisions created them. The 2016 syllabus removed Software Engineering, Web Technologies, Information Systems and Numerical Methods. The 2021 syllabus removed IPv6, Wi-Fi basics and network security. The 2027 syllabus dropped several Computer Networks items and COA disk geometry. Everything else in the 2000–2026 archive still maps to a topic in the 2027 syllabus.

Key takeaways

• 2016: Software Engineering, Web Technologies, Information Systems and Numerical Methods removed. Skip these in papers up to 2015.
• 2021: IPv6, Wi-Fi basics and network security (authentication, cryptography, certificates, firewalls) removed. Skip these in papers up to 2020.
• 2027: OSI stack enumeration, framing, Ethernet bridging, shortest-path and flooding routing, ARP, DHCP, ICMP, UDP, SMTP, FTP and email dropped from Computer Networks; main memory and secondary storage dropped from COA. Treat these as low priority in all older papers, including 2021–2026.
• Nothing was removed from Digital Logic in 2027, and the other seven sections are unchanged.
• Old papers still matter. Several 2000–2005 question ideas have reappeared in near-identical form after 2015.

Why this matters

The GATE CSE archive is large: 37 CS papers and sets across 27 exam years, from 2000 to 2026. The 2027 paper will be the first under the 2027 syllabus. That archive is the best free preparation material you have, but solving an old Software Engineering question or a pre-2021 network-security question spends time on marks that cannot appear.

The fix is not to throw out old papers. It is to know which parts to strike off. Always confirm the current syllabus in the official PDF at gate2027.iitm.ac.in; GATE CSE Guide is independent of IIT Madras and the GATE office.

The three revisions at a glance

2027: Computer Networks and COA

Computer Networks lost more explicit wording than any other section. "Concept of layering: OSI and TCP/IP Protocol Stacks" became "Principles of Layering", so questions that only ask which layer a protocol belongs to are less likely. Framing, bridging, stand-alone shortest-path and flooding routing, ARP, DHCP, ICMP, UDP, SMTP, FTP and email are no longer named. The details are in GATE 2027 Computer Networks syllabus changes.

COA dropped "main memory and secondary storage". Questions on magnetic disk structure and access-time computation are now low priority for COA. Disk scheduling is a separate matter: the Operating System section still lists "CPU and I/O scheduling". See GATE 2027 COA syllabus changes.

Digital Logic was reworded but lost nothing.

One detail is easy to miss. ARP, DHCP, ICMP and email were made explicit in the 2021 revision, so they were named in the syllabus from 2021 to 2026. Recent papers, not just old ones, can contain questions on them. Mark those questions low priority too.

2021: network security, IPv6 and Wi-Fi

The 2021 revision removed IPv6, Wi-Fi basics and network security. Old questions on authentication, cryptography, certificates and firewalls are out of scope, and so are IPv6 questions.

The same revision also added material, which matters when you use older papers:

• "Monoids" was added to Discrete Mathematics.
• "Pipeline hazards", "System calls" and "CPU and I/O scheduling" became explicit.
• Compiler Design gained local optimisation and data-flow analyses: constant propagation, liveness analysis and common subexpression elimination. Data-flow questions from 2021 onward form a new sub-topic, so papers before 2021 will not give you much practice on it.
• General Aptitude was restructured into Verbal, Quantitative, Analytical and Spatial Aptitude.
• The MSQ question type was introduced.

The book analyses 27 years of papers using the official 2027 syllabus as the framework for every classification, so each topic is judged against what can be asked in 2027. See what the full analysis covers.

2016: Software Engineering, Web Technologies, Information Systems, Numerical Methods

Before 2016, the CS paper included Software Engineering and Web Technologies (HTML, XML, client-server computing), Information Systems, and Numerical Methods as part of mathematics. Analysts usually grouped these questions as "Software Engineering and Web Technologies" or "Information Systems and Software Engineering".

Marks for these old-syllabus areas, from third-party analyst compilations (approximate, not official):

2015 was the last year these questions appeared. Numerical Methods and Software Engineering also show up in the 2000–2005 papers. Ignore all of them.

Not removed, but not named

P, NP, NP-completeness and reductions are not named in the 2027 Algorithms section, although they were historically tested under Algorithms. This is not a 2027 change; the Algorithms section is identical to 2026. The book treats these as low priority. Know the definitions, and don't spend days on reductions.

How to filter an old paper

1. Note the year. It tells you which syllabus the paper was set under.
2. Papers up to 2015: strike Software Engineering, Web Technologies, Information Systems and Numerical Methods.
3. Papers up to 2020: also strike IPv6, Wi-Fi and network security.
4. Papers up to 2026: mark the dropped CN protocols, OSI-layer identification and COA disk geometry as low priority.
5. Keep everything else, however old. The concepts of 2000–2013 remain the concepts of 2026.
6. Adjust for format. Questions before 2014 were all MCQs. Try them without looking at the options, as a NAT, and read statement-based MCQs as MSQs where more than one option might be true.

The guide to using previous year papers topic-wise covers the rest of the method.

Old papers, changing formats

What still counts, however old

The stable core has not moved in 27 years: CPU scheduling, page replacement, semaphores and deadlock; cache mapping, addressing modes and pipeline timing; K-maps, counters and number representation; C output, recursion, trees and heaps; sorting, hashing, MST, shortest paths and recurrences; DFA design and regular versus context-free identification; LR and LL parsing; SQL, normalization, B+ trees and serializability; sliding window, CRC, subnetting and TCP; graph theory, groups, counting, eigenvalues and Bayes theorem.

Some old ideas have returned almost unchanged after 2015: the number of tables from an ER diagram, the maximum file size from an inode, and the probe sequence of a hash table. The difference in recent papers is that two concepts are combined in one question more often. To see how marks have shifted between subjects over these years, read GATE CSE subject-wise weightage.