You do not have permission to edit this page, for the following reason:

The action you have requested is limited to users in one of the groups: Users, Administrators.


You can view and copy the source of this page.

Return to Changes to GATE CSE Syllabus in 2016.

Heads Up! Some missing links for topics do not mean that they were never asked for GATE. I'll add their links soon after correcting the corresponding tags in GATE Overflow

Discrete Mathematics[edit]

Boolean Algebra moved to Digital Logic. 
Permutations; Combinations removed from Combinatorics but being basic and counting being there this does not really matter. 
asymptotics removed, but basics are in asymptotic analysis part of Algorithms
spanning trees; Cut vertices & edges; covering;  independent sets; Planarity; Isomorphism removed. But based on other topics this just means Planarity and isomorphism are removed (spanning trees are already in algorithms)

Linear Algebra[edit]

LU decomposition added here from Numerical methods which was removed as a whole otherwise. 

Calculus[edit]

  • Limits, continuity and differentiability.
  • Maxima and minima. Mean value theorem.
  • Integration.
Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives is removed and Integration added. So, this would mean we can expect only simple integration questions.

Probability[edit]

Bayes theorem newly added but it was implicitly part of conditional probability

Digital Logic[edit]

Boolean algebra added to here from set theory & algebra

Computer Organization and Architecture[edit]

Memory interface part is removed. So, questions on RAM would not be there. 

Programming and Data Structures[edit]

Functions, Parameter passing, Scope, Binding; Abstract data types removed. So, questions like pass by reference, static-dynamic scopes, etc would not be there. 
Graphs added here.

Algorithms[edit]

Space and time complexity restricted to only worst case. 
Connected components removed
Tree and graph traversals removed. But these are implied in Data Structure portion.
Basic concepts of complexity classes – P, NP, NP-hard, NP-complete.  removed. So, these definitions need not be studied but reduction is there in Theory of Computation anyway.

Theory of Computation[edit]

pumping lemma newly added. So, questions based on pumping length or some examples can be asked. 
Recursively enumerable sets removed but Turing machines are there. So, this should not really matter.

Compiler Design[edit]

target code generation, Basics of code optimization. removed. This is quite a good removal for students. Questions like register allocation, DAG  etc. would not be there

Operating System[edit]

I/O systems, Protection and security removed. Rarely questions like size of graphic card required etc have been asked. 

Databases[edit]

No change

Computer Networks[edit]

IPv6 added
Token Ring removed
icmp removed
Basics of Wi-Fi added
Basic concepts of hubs, switches, gateways, and routers removed
Subnetting is an important part under IP. 

General Aptitude[edit]

Removals[edit]

Except LU decomposition, all portions of Web Technologies, IS & Software Engineering and Numerical Methods are removed. 

Web technologies: HTML, XML, basic concepts of client-server computing.

Information Systems and Software Engineering: information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance

Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson’s rules.




blog comments powered by Disqus