Arjun Suresh (talk | contribs) |
Arjun Suresh (talk | contribs) |
||
Line 21: | Line 21: | ||
==[http://www.gatecse.org/calculus/ Calculus]== | ==[http://www.gatecse.org/calculus/ Calculus]== | ||
− | * [http://gateoverflow.in/tag/limit Limits], continuity and differentiability. | + | * [http://gateoverflow.in/tag/limit Limits], [http://gateoverflow.in/tag/continuity continuity] and [http://gateoverflow.in/tag/differentiability differentiability]. |
− | * Maxima and minima. Mean value theorem. | + | * [http://gateoverflow.in/tag/maxima-minima Maxima and minima]. Mean value theorem. |
− | * Integration. | + | * [http://gateoverflow.in/tag/integration Integration]. |
− | '''Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives''' | + | '''Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives''' removed and '''Integration''' added. So, this would mean we can expect only simple integration questions. |
==[http://www.gatecse.org/probability/ Probability]== | ==[http://www.gatecse.org/probability/ Probability]== | ||
*[http://gateoverflow.in/tag/random-variable Random variables]. | *[http://gateoverflow.in/tag/random-variable Random variables]. | ||
− | *Uniform, normal, exponential,[http://gateoverflow.in/tag/poisson-distribution poisson] and binomial distributions. | + | *Uniform, [http://gateoverflow.in/tag/normal-distribution normal], [http://gateoverflow.in/tag/exponential-distribution exponential], [http://gateoverflow.in/tag/poisson-distribution poisson] and [http://gateoverflow.in/tag/binomial-distribution binomial distributions]. |
*[http://gateoverflow.in/tag/statistics Mean, median, mode and standard deviation]. | *[http://gateoverflow.in/tag/statistics Mean, median, mode and standard deviation]. | ||
*Conditional probability and Bayes theorem. | *Conditional probability and Bayes theorem. |
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)
LU decomposition added here from Numerical methods which was removed as a whole otherwise.
Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives removed and Integration added. So, this would mean we can expect only simple integration questions.
Bayes theorem newly added but it was implicitly part of conditional probability
Boolean algebra added to here from set theory & algebra
Memory interface part is removed. So, questions on RAM would not be there.
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.
Space and time complexity restricted to only worst case. Connected components removed here, but they are in Graph theory anyway 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.
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.
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
I/O systems, Protection and security removed. Rarely questions like size of graphic card required etc have been asked.
No change
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.
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.
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)
LU decomposition added here from Numerical methods which was removed as a whole otherwise.
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.
Bayes theorem newly added but it was implicitly part of conditional probability
Boolean algebra added to here from set theory & algebra
Memory interface part is removed. So, questions on RAM would not be there.
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.
Space and time complexity restricted to only worst case. Connected components removed here, but they are in Graph theory anyway 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.
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.
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
I/O systems, Protection and security removed. Rarely questions like size of graphic card required etc have been asked.
No change
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.
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.