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, relations, functions, partial orders and lattices. Groups.  
+
*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:] 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], 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 does not really matter.  
+
  '''[http://gateoverflow.in/tag/permutation 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
 
  '''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; 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==
*Matrices, determinants
+
*[http://gateoverflow.in/tag/matrices Matrices, determinants]
*System of linear equations
+
*[http://gateoverflow.in/tag/system-of-equations System of linear equations]
*Eigenvalues and eigenvectors  
+
*[http://gateoverflow.in/tag/eigen-value Eigenvalues and eigenvectors]
 
*LU decomposition
 
*LU decomposition
  
Line 20: Line 20:
  
 
==Calculus==
 
==Calculus==
* Limits, continuity and differentiability.  
+
* [http://gateoverflow.in/tag/limit Limits], continuity and differentiability.  
 
* Maxima and minima. Mean value theorem.  
 
* Maxima and minima. Mean value theorem.  
 
* Integration.
 
* Integration.
Line 26: Line 26:
  
 
==Probability==
 
==Probability==
* Random variables.  
+
*[http://gateoverflow.in/tag/random-variable Random variables].  
 
*Uniform, normal, exponential, poisson and binomial distributions.  
 
*Uniform, normal, exponential, poisson and binomial distributions.  
 
*Mean, median, mode and standard deviation.  
 
*Mean, median, mode and standard deviation.  
Line 34: Line 34:
 
==Digital Logic==
 
==Digital Logic==
  
*Boolean algebra.  
+
*[http://gateoverflow.in/tag/boolean-expressions Boolean algebra].  
*[http://gateoverflow.in/tag/circuit-output Combinational and sequential circuits.] 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 floating point).
 
  '''Boolean algebra''' added to here from set theory & algebra
 
  '''Boolean algebra''' added to here from set theory & algebra
Line 45: Line 45:
 
*[http://gateoverflow.in/tag/pipeline Instruction pipelining.]  
 
*[http://gateoverflow.in/tag/pipeline Instruction pipelining.]  
 
* [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;]
* I/O interface (interrupt and 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.  
 
  ''' 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.  
*Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
+
*[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.
  '''Functions, Parameter passing, Scope, 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.  
  
 
==Algorithms==
 
==Algorithms==
*Searching,[http://gateoverflow.in/tag/sorting sorting], 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 space complexity.]
 
*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,[http://gateoverflow.in/tag/spanning-tree 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
+
  '''[http://gateoverflow.in/tag/connected-components 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 need not 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 need not be studied but reduction is there in Theory of Computation anyway.  
Line 67: Line 67:
 
==Theory of Computation==
 
==Theory of Computation==
 
*[http://gateoverflow.in/tag/regular-expressions Regular expressions] and finite automata.  
 
*[http://gateoverflow.in/tag/regular-expressions Regular expressions] and finite automata.  
*[http://gateoverflow.in/tag/grammar Context-free grammars] and push-down automata.  
+
*[http://gateoverflow.in/tag/grammar Context-free grammars] and [http://gateoverflow.in/tag/pda push-down automata].  
 
*[http://gateoverflow.in/tag/regular-set Regular] and [http://gateoverflow.in/tag/context-free context-free languages], pumping lemma.  
 
*[http://gateoverflow.in/tag/regular-set Regular] and [http://gateoverflow.in/tag/context-free context-free languages], pumping lemma.  
*Turing machines and undecidability.
+
*[http://gateoverflow.in/tag/turing-machine Turing machines] and [http://gateoverflow.in/tag/decidability undecidability].
 
  '''pumping lemma''' newly added. So, questions based on pumping length or some examples can be asked.  
 
  '''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.
 
  '''Recursively enumerable sets''' removed but Turing machines are there. So, this should not really matter.
  
 
==Compiler Design==
 
==Compiler Design==
*Lexical analysis, [http://gateoverflow.in/tag/parsing parsing], syntax-directed translation.  
+
*Lexical analysis, [http://gateoverflow.in/tag/parsing parsing],[http://gateoverflow.in/tag/syntax-directed-translation syntax-directed translation].  
*Runtime environments.  
+
*[http://gateoverflow.in/tag/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. would not be there
 
  '''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==
*Processes, threads, inter‐process communication, [http://gateoverflow.in/tag/process-synchronization concurrency and synchronization.]
+
*[http://gateoverflow.in/tag/fork Processes], [http://gateoverflow.in/tag/threads threads], [http://gateoverflow.in/tag/semaphore inter‐process communication], [http://gateoverflow.in/tag/process-synchronization concurrency and synchronization.]
*Deadlock.  
+
*[http://gateoverflow.in/tag/resource-allocation Deadlock.]
 
*[http://gateoverflow.in/tag/process-schedule CPU scheduling.]  
 
*[http://gateoverflow.in/tag/process-schedule CPU scheduling.]  
*[http://gateoverflow.in/tag/virtual-memory Memory management and virtual memory.]  
+
*[http://gateoverflow.in/tag/memory-management Memory management] and [http://gateoverflow.in/tag/virtual-memory  virtual memory.]  
*[http://gateoverflow.in/tag/disk File systems.]
+
*[http://gateoverflow.in/tag/disk-scheduling File systems.] [http://gateoverflow.in/tag/disk Disks is also under this]
  '''I/O systems, Protection and security''' removed. But I do not remember any question from these portions.  
+
  '''I/O systems, Protection and security''' removed. Rarely questions like size of graphic card required etc have been asked.  
  
 
==Databases==
 
==Databases==
*ER‐model. Relational model: relational algebra,[http://gateoverflow.in/tag/relational-calculus tuple calculus],[http://gateoverflow.in/tag/sql SQL].  
+
*[http://gateoverflow.in/tag/er-model ER‐model]. Relational model:[http://gateoverflow.in/tag/relational-algebra relational algebra],[http://gateoverflow.in/tag/relational-calculus tuple calculus],[http://gateoverflow.in/tag/sql SQL].  
 
*Integrity constraints,
 
*Integrity constraints,
 
*[http://gateoverflow.in/tag/database-normalization normal forms.]
 
*[http://gateoverflow.in/tag/database-normalization normal forms.]
*File organization, [http://gateoverflow.in/tag/b-tree indexing (e.g., B and B+ trees)].  
+
*[http://gateoverflow.in/tag/indexing File organization], [http://gateoverflow.in/tag/b-tree indexing (e.g., B and B+ trees)].  
*Transactions and concurrency control.
+
*[http://gateoverflow.in/tag/transactions Transactions and concurrency control].
 
  No change
 
  No change
  
Line 98: Line 98:
 
==Computer Networks==
 
==Computer Networks==
 
*Concept of layering. LAN technologies (Ethernet).  
 
*Concept of layering. LAN technologies (Ethernet).  
*Flow and error control techniques,
+
*[http://gateoverflow.in/tag/sliding-window Flow and error control techniques],
 
*switching.  
 
*switching.  
*IPv4/IPv6,  
+
*[http://gateoverflow.in/tag/ip-packet IPv4]/IPv6,  
*routers and routing algorithms (distance vector, link state).  
+
*[http://gateoverflow.in/tag/routing routers and routing algorithms (distance vector, link state)].  
 
*TCP/UDP and sockets, congestion control.  
 
*TCP/UDP and sockets, congestion control.  
 
*Application layer protocols (DNS, SMTP, POP, FTP, HTTP).
 
*Application layer protocols (DNS, SMTP, POP, FTP, HTTP).
 
*Basics of Wi-Fi.  
 
*Basics of Wi-Fi.  
*Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.  
+
*[http://gateoverflow.in/tag/network-security Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls].  
 
  '''IPv6''' added
 
  '''IPv6''' added
 
  '''icmp''' removed
 
  '''icmp''' removed

Revision as of 21:41, 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]

  • 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 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]

  • 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 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]

  • 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. would not be there

Operating System[edit]

I/O systems, Protection and security removed. But I do not remember any question from these portions. 

Databases[edit]

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 

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.