Line 2: Line 2:
 
==Discrete Mathematics==
 
==Discrete Mathematics==
 
*[http://gateoverflow.in/tag/mathematical-logic Propositional and first order logic.]  
 
*[http://gateoverflow.in/tag/mathematical-logic Propositional and first order logic.]  
*Sets,[http://gateoverflow.in/tag/relations relations],[http://gateoverflow.in/tag/functions functions], [http://gateoverflow.in/tag/partial-order partial orders] and [http://gateoverflow.in/tag/lattice lattices]. [http://gateoverflow.in/tag/groups Groups].  
+
*[http://gateoverflow.in/tag/set Sets], [http://gateoverflow.in/tag/relations relations], [http://gateoverflow.in/tag/functions functions], [http://gateoverflow.in/tag/partial-order partial orders] and [http://gateoverflow.in/tag/lattice lattices]. [http://gateoverflow.in/tag/groups Groups].  
 
* Graphs: connectivity, matching, coloring.  
 
* Graphs: connectivity, matching, coloring.  
* [http://gateoverflow.in/tag/combinatory Combinatorics:][http://gateoverflow.in/tag/counting counting],[http://gateoverflow.in/tag/recurrence recurrence relations], generating functions.
+
* [http://gateoverflow.in/tag/combinatory Combinatorics:] [http://gateoverflow.in/tag/counting counting], [http://gateoverflow.in/tag/recurrence recurrence relations], [http://gateoverflow.in/tag/generating-functions generating functions].
  
 
  '''Boolean Algebra''' moved to Digital Logic.  
 
  '''Boolean Algebra''' moved to Digital Logic.  
  '''[http://gateoverflow.in/tag/permutation Permutations; Combinations]''' removed from Combinatorics but being basic and counting being there this does not really matter.  
+
  '''[http://gateoverflow.in/tag/permutation Permutations]; [http://gateoverflow.in/tag/combinations 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
 
  '''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)
+
  '''spanning trees; Cut vertices & edges; covering;  independent sets; [http://gateoverflow.in/tag/planar-embedding Planarity]; Isomorphism''' removed. But based on other topics this just means Planarity and isomorphism are removed (spanning trees are already in algorithms)
  
 
==Linear Algebra==
 
==Linear Algebra==
Line 36: Line 36:
 
*[http://gateoverflow.in/tag/boolean-expressions Boolean algebra].  
 
*[http://gateoverflow.in/tag/boolean-expressions Boolean algebra].  
 
*[http://gateoverflow.in/tag/circuit-output Combinational and sequential circuits.] [http://gateoverflow.in/tag/canonical-normal-form Minimization].  
 
*[http://gateoverflow.in/tag/circuit-output Combinational and sequential circuits.] [http://gateoverflow.in/tag/canonical-normal-form Minimization].  
*Number representations and computer arithmetic (fixed and floating point).
+
*Number representations and computer arithmetic (fixed and [http://gateoverflow.in/tag/floating-point-representation floating point]).
 
  '''Boolean algebra''' added to here from set theory & algebra
 
  '''Boolean algebra''' added to here from set theory & algebra
  
Line 46: Line 46:
 
* [http://gateoverflow.in/tag/cache-memory Memory hierarchy: cache, main memory and secondary storage;]
 
* [http://gateoverflow.in/tag/cache-memory Memory hierarchy: cache, main memory and secondary storage;]
 
* [http://gateoverflow.in/tag/io-handling I/O interface]. [http://gateoverflow.in/tag/interrupts Interrupt] and [http://gateoverflow.in/tag/dma DMA mode])
 
* [http://gateoverflow.in/tag/io-handling I/O interface]. [http://gateoverflow.in/tag/interrupts Interrupt] and [http://gateoverflow.in/tag/dma DMA mode])
  ''' Memory interface''' part is removed. So, questions on RAM would not be there.  
+
  '''[http://gateoverflow.in/tag/ram Memory interface]''' part is removed. So, questions on RAM would not be there.  
  
 
==Programming and Data Structures==
 
==Programming and Data Structures==
 
*[http://gateoverflow.in/tag/programming-in-c Programming in C.] Recursion.  
 
*[http://gateoverflow.in/tag/programming-in-c Programming in C.] Recursion.  
*[http://gateoverflow.in/tag/arrays Arrays], [http://gateoverflow.in/tag/stack stacks], queues,[http://gateoverflow.in/tag/linked-lists linked lists],[http://gateoverflow.in/tag/trees trees], binary search trees, binary heaps, graphs.
+
*[http://gateoverflow.in/tag/arrays Arrays], [http://gateoverflow.in/tag/stack stacks], [http://gateoverflow.in/tag/queues queues], [http://gateoverflow.in/tag/linked-lists linked lists],[http://gateoverflow.in/tag/trees trees], binary search trees, binary heaps, graphs.
 
  '''Functions, Parameter passing, Scope,[http://gateoverflow.in/tag/variable-binding Binding]; Abstract data types''' removed. So, questions like pass by reference, static-dynamic scopes, etc would not be there.  
 
  '''Functions, Parameter passing, Scope,[http://gateoverflow.in/tag/variable-binding Binding]; Abstract data types''' removed. So, questions like pass by reference, static-dynamic scopes, etc would not be there.  
 
  '''Graphs''' added here.  
 
  '''Graphs''' added here.  
Line 56: Line 56:
 
==Algorithms==
 
==Algorithms==
 
*Searching,[http://gateoverflow.in/tag/sorting sorting],[http://gateoverflow.in/tag/hashing hashing].  
 
*Searching,[http://gateoverflow.in/tag/sorting sorting],[http://gateoverflow.in/tag/hashing hashing].  
*[http://gateoverflow.in/tag/time-complexity Asymptotic worst case time and space complexity.]
+
*[http://gateoverflow.in/tag/time-complexity Asymptotic worst case time] and [http://gateoverflow.in/tag/space-complexity space complexity.]
 
*Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.
 
*Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.
*Graph search,[http://gateoverflow.in/tag/spanning-tree minimum spanning trees], shortest paths.
+
*Graph search,[http://gateoverflow.in/tag/spanning-tree minimum spanning trees], [http://gateoverflow.in/tag/shortest-path shortest paths].
 
  '''Space and time complexity''' restricted to only worst case.  
 
  '''Space and time complexity''' restricted to only worst case.  
 
  '''[http://gateoverflow.in/tag/connected-components Connected components]''' removed
 
  '''[http://gateoverflow.in/tag/connected-components Connected components]''' removed
Line 76: Line 76:
 
*Lexical analysis, [http://gateoverflow.in/tag/parsing parsing],[http://gateoverflow.in/tag/syntax-directed-translation syntax-directed translation].  
 
*Lexical analysis, [http://gateoverflow.in/tag/parsing parsing],[http://gateoverflow.in/tag/syntax-directed-translation syntax-directed translation].  
 
*[http://gateoverflow.in/tag/runtime-environments Runtime environments].  
 
*[http://gateoverflow.in/tag/runtime-environments Runtime environments].  
*Intermediate code generation.
+
*[http://gateoverflow.in/tag/intermediate-code 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. would not be there
+
  '''[http://gateoverflow.in/tag/code-generation 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==
 
==Operating System==

Revision as of 21:51, 1 August 2015

Discrete Mathematics

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

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 added to here from set theory & algebra

Computer Organization and Architecture

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

Programming and Data Structures

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

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

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

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

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

Databases

No change


Computer Networks

IPv6 added
icmp removed
Basics of Wi-Fi added 

Removals

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.

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]

  • 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 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
icmp removed
Basics of Wi-Fi added 

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.