Difference between revisions of "Changes to GATE CSE Syllabus in 2016"

Line 6: Line 6:
 
* Combinatorics: counting, recurrence relations, generating functions.
 
* Combinatorics: counting, recurrence relations, generating functions.
  
−
'''Boolean Algebra''' moved to Digital Logic.  
+
'''Boolean Algebra''' moved to Digital Logic.  
−
'''Permutations; Combinations''' removed from Combinatorics but being basic and counting being there this doesn't really matter.  
+
'''Permutations; Combinations''' removed from Combinatorics but being basic and counting being there this doesn't really matter.  
−
'''asymptotics''' removed, but basics are in asymptotic analysis part of Algorithms
+
'''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; Cut vertices & edges; covering;  independent sets; Planarity; Isomorphism''' removed. But based on other topics this just means Planarity and isomorphism are removed.
  
 
==Linear Algebra==
 
==Linear Algebra==
Line 17: Line 17:
 
*LU decomposition
 
*LU decomposition
  
−
'''LU decomposition''' added here from Numerical methods which was removed as a whole otherwise.  
+
'''LU decomposition''' added here from Numerical methods which was removed as a whole otherwise.  
  
 
==Calculus==
 
==Calculus==
Line 23: Line 23:
 
* Maxima and minima. Mean value theorem.  
 
* Maxima and minima. Mean value theorem.  
 
* Integration.
 
* 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.
+
'''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==
 
==Probability==
Line 30: Line 30:
 
*Mean, median, mode and standard deviation.  
 
*Mean, median, mode and standard deviation.  
 
*Conditional probability and Bayes theorem.
 
*Conditional probability and Bayes theorem.
−
'''Bayes theorem''' newly added but it was implicitly part of conditional probability
+
'''Bayes theorem''' newly added but it was implicitly part of conditional probability
  
 
==Digital Logic==
 
==Digital Logic==
Line 37: Line 37:
 
*Combinational and sequential circuits. Minimization.  
 
*Combinational and sequential circuits. Minimization.  
 
*Number representations and computer arithmetic (fixed and floating point).
 
*Number representations and computer arithmetic (fixed and floating point).
−
'''Boolean algebra''' added to here from set theory & algebra
+
'''Boolean algebra''' added to here from set theory & algebra
  
 
==Computer Organization and Architecture==
 
==Computer Organization and Architecture==
Line 46: Line 46:
 
* Memory hierarchy: cache, main memory and secondary storage;
 
* Memory hierarchy: cache, main memory and secondary storage;
 
* I/O interface (interrupt and DMA mode).
 
* I/O interface (interrupt and DMA mode).
−
''' Memory interface''' part is removed. So, questions on RAM won't be there.  
+
''' Memory interface''' part is removed. So, questions on RAM won't be there.  
  
 
==Programming and Data Structures==
 
==Programming and Data Structures==
 
*Programming in C. Recursion.  
 
*Programming in C. Recursion.  
 
*Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
 
*Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
−
'''Functions, Parameter passing, Scope, Binding; Abstract data types''' removed. So, questions like pass by reference, static-dynamic scopes, etc won't be there.  
+
'''Functions, Parameter passing, Scope, Binding; Abstract data types''' removed. So, questions like pass by reference, static-dynamic scopes, etc won't be there.  
−
'''Graphs''' added here.  
+
'''Graphs''' added here.  
  
 
==Algorithms==
 
==Algorithms==
Line 59: Line 59:
 
*Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.
 
*Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.
 
*Graph search, minimum spanning trees, shortest paths.
 
*Graph search, minimum spanning trees, shortest paths.
−
'''Space and time complexity''' restricted to only worst case.  
+
'''Space and time complexity''' restricted to only worst case.  
−
'''Connected components''' removed
+
'''Connected components''' removed
−
'''Tree and graph traversals''' removed. But these are implied in Data Structure portion.
+
'''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 needn't be studied but reduction is there in Theory of Computation anyway.  
+
'''Basic concepts of complexity classes – P, NP, NP-hard, NP-complete. ''' removed. So, these definitions needn't be studied but reduction is there in Theory of Computation anyway.  
  
  
Line 77: Line 77:
 
*Runtime environments.  
 
*Runtime environments.  
 
*Intermediate code generation.
 
*Intermediate code generation.
 +
'''target code generation, Basics of code optimization.''' removed. This is quite a good removal for students. Questions like register allocation, DAG  etc. won't be there
  
 
==Operating System==
 
==Operating System==
Line 84: Line 85:
 
*Memory management and virtual memory.  
 
*Memory management and virtual memory.  
 
*File systems.
 
*File systems.
 +
'''I/O systems, Protection and security''' removed. But I don't remember any question from these portions.
  
 
==Databases==
 
==Databases==
−
*ER‐model. Relational model:  
+
*ER‐model. Relational model: relational algebra, tuple calculus, SQL.  
−
*relational algebra, tuple calculus, SQL.  
 
 
*Integrity constraints,
 
*Integrity constraints,
 
*normal forms.  
 
*normal forms.  
 
*File organization, indexing (e.g., B and B+ trees).  
 
*File organization, indexing (e.g., B and B+ trees).  
 
*Transactions and concurrency control.
 
*Transactions and concurrency control.
 +
No change
 +
  
 
==Computer Networks==
 
==Computer Networks==
Line 103: Line 106:
 
*Basics of Wi-Fi.  
 
*Basics of Wi-Fi.  
 
*Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.  
 
*Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.  
 +
'''IPv6''' added
 +
'''icmp''' removed
 +
'''Basics of Wi-Fi''' added
 +
 +
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.
  
  
 
[[Category:GATE]]
 
[[Category:GATE]]

Revision as of 20:44, 1 August 2015

Discrete Mathematics

  • Propositional and first order logic.
  • Sets, relations, functions, partial orders and lattices. Groups.
  • Graphs: connectivity, matching, coloring.
  • Combinatorics: counting, recurrence relations, generating functions.
Boolean Algebra moved to Digital Logic. 
Permutations; Combinations removed from Combinatorics but being basic and counting being there this doesn't 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.

Linear Algebra

  • Matrices, determinants
  • System of linear equations
  • Eigenvalues and eigenvectors
  • LU decomposition
LU decomposition added here from Numerical methods which was removed as a whole otherwise.

Calculus

  • 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

  • Random variables.
  • Uniform, normal, exponential, poisson and binomial distributions.
  • Mean, median, mode and standard deviation.
  • Conditional probability and Bayes theorem.
Bayes theorem newly added but it was implicitly part of conditional probability

Digital Logic

  • Boolean algebra.
  • Combinational and sequential circuits. Minimization.
  • Number representations and computer arithmetic (fixed and floating point).
Boolean algebra added to here from set theory & algebra

Computer Organization and Architecture

  • Machine instructions and addressing modes.
  • ALU, data‐path and control unit.
  • Instruction pipelining.
  • Memory hierarchy: cache, main memory and secondary storage;
  • I/O interface (interrupt and DMA mode).
 Memory interface part is removed. So, questions on RAM won't be there.

Programming and Data Structures

  • Programming in C. Recursion.
  • Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
Functions, Parameter passing, Scope, Binding; Abstract data types removed. So, questions like pass by reference, static-dynamic scopes, etc won't be there. 
Graphs added here.

Algorithms

  • Searching, sorting, hashing.
  • Asymptotic worst case time and space complexity.
  • Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.
  • Graph search, minimum spanning trees, shortest paths.
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 needn't be studied but reduction is there in Theory of Computation anyway.


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.
pumping lemma newly added. 
Recursively enumerable sets removed but Turing machines are there.

Compiler Design

  • Lexical analysis, parsing, syntax-directed translation.
  • Runtime environments.
  • Intermediate code generation.
target code generation, Basics of code optimization. removed. This is quite a good removal for students. Questions like register allocation, DAG  etc. won't be there

Operating System

  • Processes, threads, inter‐process communication, concurrency and synchronization.
  • Deadlock.
  • CPU scheduling.
  • Memory management and virtual memory.
  • File systems.
I/O systems, Protection and security removed. But I don't remember any question from these portions.

Databases

  • ER‐model. Relational model: relational algebra, tuple calculus, SQL.
  • Integrity constraints,
  • normal forms.
  • File organization, indexing (e.g., B and B+ trees).
  • Transactions and concurrency control.
No change


Computer Networks

  • Concept of layering. LAN technologies (Ethernet).
  • Flow and error control techniques,
  • switching.
  • IPv4/IPv6,
  • routers and routing algorithms (distance vector, link state).
  • TCP/UDP and sockets, congestion control.
  • Application layer protocols (DNS, SMTP, POP, FTP, HTTP).
  • Basics of Wi-Fi.
  • Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls. 
IPv6 added
icmp removed
Basics of Wi-Fi added 

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.

Retrieved from "https://gatecse.in/w/index.php?title=Changes_to_GATE_CSE_Syllabus_in_2016&oldid=5162"

Discrete Mathematics[edit]

  • Propositional and first order logic.
  • Sets, relations, functions, partial orders and lattices. Groups.
  • Graphs: connectivity, matching, coloring.
  • Combinatorics: counting, recurrence relations, generating functions.
Boolean Algebra moved to Digital Logic. 
Permutations; Combinations removed from Combinatorics but being basic and counting being there this doesn't 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.

Linear Algebra[edit]

  • Matrices, determinants
  • System of linear equations
  • Eigenvalues and eigenvectors
  • LU decomposition
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]

  • Random variables.
  • Uniform, normal, exponential, poisson and binomial distributions.
  • Mean, median, mode and standard deviation.
  • Conditional probability and Bayes theorem.
Bayes theorem newly added but it was implicitly part of conditional probability

Digital Logic[edit]

  • Boolean algebra.
  • Combinational and sequential circuits. Minimization.
  • Number representations and computer arithmetic (fixed and floating point).
Boolean algebra added to here from set theory & algebra

Computer Organization and Architecture[edit]

  • Machine instructions and addressing modes.
  • ALU, data‐path and control unit.
  • Instruction pipelining.
  • Memory hierarchy: cache, main memory and secondary storage;
  • I/O interface (interrupt and DMA mode).
 Memory interface part is removed. So, questions on RAM won't be there.

Programming and Data Structures[edit]

  • Programming in C. Recursion.
  • Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
Functions, Parameter passing, Scope, Binding; Abstract data types removed. So, questions like pass by reference, static-dynamic scopes, etc won't be there. 
Graphs added here.

Algorithms[edit]

  • Searching, sorting, hashing.
  • Asymptotic worst case time and space complexity.
  • Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.
  • Graph search, minimum spanning trees, shortest paths.
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 needn't be studied but reduction is there in Theory of Computation anyway.


Theory of Computation[edit]

  • Regular expressions and finite automata.
  • Context-free grammars and push-down automata.
  • Regular and context-free languages, pumping lemma.
  • Turing machines and undecidability.
pumping lemma newly added. 
Recursively enumerable sets removed but Turing machines are there.

Compiler Design[edit]

  • Lexical analysis, parsing, syntax-directed translation.
  • Runtime environments.
  • Intermediate code generation.
target code generation, Basics of code optimization. removed. This is quite a good removal for students. Questions like register allocation, DAG  etc. won't be there

Operating System[edit]

  • Processes, threads, inter‐process communication, concurrency and synchronization.
  • Deadlock.
  • CPU scheduling.
  • Memory management and virtual memory.
  • File systems.
I/O systems, Protection and security removed. But I don't remember any question from these portions.

Databases[edit]

  • ER‐model. Relational model: relational algebra, tuple calculus, SQL.
  • Integrity constraints,
  • normal forms.
  • File organization, indexing (e.g., B and B+ trees).
  • Transactions and concurrency control.
No change


Computer Networks[edit]

  • Concept of layering. LAN technologies (Ethernet).
  • Flow and error control techniques,
  • switching.
  • IPv4/IPv6,
  • routers and routing algorithms (distance vector, link state).
  • TCP/UDP and sockets, congestion control.
  • Application layer protocols (DNS, SMTP, POP, FTP, HTTP).
  • Basics of Wi-Fi.
  • Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls. 
IPv6 added
icmp removed
Basics of Wi-Fi added 

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.