Arjun Suresh (talk | contribs) |
Arjun Suresh (talk | contribs) |
||
Line 4: | Line 4: | ||
*[http://gateoverflow.in/tag/mathematical-logic Propositional and first order logic.] | *[http://gateoverflow.in/tag/mathematical-logic Propositional and first order logic.] | ||
*[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]. | *[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, [http://gateoverflow.in/tag/graph-coloring coloring]. | + | * Graphs: [http://gateoverflow.in/tag/graph-connectivity connectivity], [http://gateoverflow.in/tag/graph-matching matching], [http://gateoverflow.in/tag/graph-coloring coloring]. |
* [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]. | * [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]. | ||
Line 10: | Line 10: | ||
'''[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. | '''[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; [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) | + | '''spanning trees; Cut vertices & edges; covering; independent sets; [http://gateoverflow.in/tag/planar-embedding Planarity]; [http://gateoverflow.in/tag/isomorphism Isomorphism]''' removed. But based on other topics this just means Planarity and isomorphism are removed (spanning trees are already in algorithms) |
==[http://www.gatecse.org/linear-algebra/ Linear Algebra]== | ==[http://www.gatecse.org/linear-algebra/ Linear Algebra]== | ||
Line 61: | Line 61: | ||
*[http://gateoverflow.in/tag/graph-search Graph search], [http://gateoverflow.in/tag/spanning-tree minimum spanning trees], [http://gateoverflow.in/tag/shortest-path shortest paths]. | *[http://gateoverflow.in/tag/graph-search 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 here, but they are in Graph theory anyway |
'''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 97: | Line 97: | ||
==[http://www.gatecse.org/computer-networks/ Computer Networks]== | ==[http://www.gatecse.org/computer-networks/ Computer Networks]== | ||
*[http://gateoverflow.in/tag/network-layering Concept of layering]. [http://gateoverflow.in/tag/lan-technologies LAN technologies (Ethernet)]. | *[http://gateoverflow.in/tag/network-layering Concept of layering]. [http://gateoverflow.in/tag/lan-technologies LAN technologies (Ethernet)]. | ||
− | *[http://gateoverflow.in/tag/sliding-window Flow] and [http://gateoverflow.in/tag/error-detection error control] techniques | + | *[http://gateoverflow.in/tag/sliding-window Flow] and [http://gateoverflow.in/tag/error-detection error control] techniques, |
*[http://gateoverflow.in/tag/network-switching switching]. | *[http://gateoverflow.in/tag/network-switching switching]. | ||
*[http://gateoverflow.in/tag/ip-packet IPv4]/IPv6, | *[http://gateoverflow.in/tag/ip-packet IPv4]/IPv6, | ||
Line 109: | Line 109: | ||
'''[http://gateoverflow.in/tag/icmp icmp]''' removed | '''[http://gateoverflow.in/tag/icmp icmp]''' removed | ||
'''Basics of Wi-Fi''' added | '''Basics of Wi-Fi''' added | ||
− | '''Basic concepts of hubs, switches, gateways, and routers''' removed | + | '''[http://gateoverflow.in/tag/routers-bridge-hubs-switches Basic concepts of hubs, switches, gateways, and routers]''' removed |
'''[http://gateoverflow.in/tag/subnettting Subnetting]''' is an important part under IP. | '''[http://gateoverflow.in/tag/subnettting Subnetting]''' is an important part under IP. | ||
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.
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 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.