Arjun Suresh (talk | contribs) |
Arjun Suresh (talk | contribs) (→Compiler Design) |
||
(3 intermediate revisions by the same user not shown) | |||
Line 6: | Line 6: | ||
[http://gate.iitk.ac.in/GATE2015/docs/syllabi/GA.pdf General Aptitude] | [http://gate.iitk.ac.in/GATE2015/docs/syllabi/GA.pdf General Aptitude] | ||
− | ==[http://www.gatecse. | + | ==[http://www.gatecse.in/gate-subjects/ Discrete Mathematics]== |
*[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]. | ||
Line 17: | Line 17: | ||
'''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) | '''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. | + | ==[http://www.gatecse.in/linear-algebra/ Linear Algebra]== |
*[http://gateoverflow.in/tag/matrices Matrices, determinants] | *[http://gateoverflow.in/tag/matrices Matrices, determinants] | ||
*[http://gateoverflow.in/tag/system-of-equations System of linear equations] | *[http://gateoverflow.in/tag/system-of-equations System of linear equations] | ||
Line 25: | Line 25: | ||
'''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. | ||
− | ==[http://www.gatecse. | + | ==[http://www.gatecse.in/calculus/ Calculus]== |
* [http://gateoverflow.in/tag/limit Limits], [http://gateoverflow.in/tag/continuity continuity] and [http://gateoverflow.in/tag/differentiability differentiability]. | * [http://gateoverflow.in/tag/limit Limits], [http://gateoverflow.in/tag/continuity continuity] and [http://gateoverflow.in/tag/differentiability differentiability]. | ||
* [http://gateoverflow.in/tag/maxima-minima Maxima and minima]. Mean value theorem. | * [http://gateoverflow.in/tag/maxima-minima Maxima and minima]. Mean value theorem. | ||
Line 31: | Line 31: | ||
'''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. | '''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. | + | ==[http://www.gatecse.in/probability/ Probability]== |
*[http://gateoverflow.in/tag/random-variable Random variables]. | *[http://gateoverflow.in/tag/random-variable Random variables]. | ||
*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]. | *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]. | ||
Line 38: | Line 38: | ||
'''Bayes theorem''' newly added but it was implicitly part of conditional probability | '''Bayes theorem''' newly added but it was implicitly part of conditional probability | ||
− | ==[http://www.gatecse. | + | ==[http://www.gatecse.in/digital-logic/ Digital Logic]== |
*[http://gateoverflow.in/tag/boolean-expressions Boolean algebra]. | *[http://gateoverflow.in/tag/boolean-expressions Boolean algebra]. | ||
Line 45: | Line 45: | ||
'''Boolean algebra''' added to here from set theory & algebra | '''Boolean algebra''' added to here from set theory & algebra | ||
− | ==[http://www.gatecse. | + | ==[http://www.gatecse.in/co-architecture/ Computer Organization and Architecture]== |
*[http://gateoverflow.in/tag/machine-instructions Machine instructions] and [http://gateoverflow.in/tag/addressing-modes addressing modes]. | *[http://gateoverflow.in/tag/machine-instructions Machine instructions] and [http://gateoverflow.in/tag/addressing-modes addressing modes]. | ||
Line 54: | Line 54: | ||
'''[http://gateoverflow.in/tag/ram 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. | ||
− | ==[http://www.gatecse. | + | ==[http://www.gatecse.in/data-structures/ Programming and Data Structures]== |
*[http://gateoverflow.in/tag/programming-in-c Programming in C.] [http://gateoverflow.in/tag/recursion Recursion]. | *[http://gateoverflow.in/tag/programming-in-c Programming in C.] [http://gateoverflow.in/tag/recursion Recursion]. | ||
*[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], [http://gateoverflow.in/tag/binary-tree binary search trees], [http://gateoverflow.in/tag/heap 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], [http://gateoverflow.in/tag/binary-tree binary search trees], [http://gateoverflow.in/tag/heap binary heaps], graphs. | ||
Line 60: | Line 60: | ||
'''Graphs''' added here. | '''Graphs''' added here. | ||
− | ==[http://www.gatecse. | + | ==[http://www.gatecse.in/algorithms/ Algorithms]== |
*[http://gateoverflow.in/tag/binary-search Searching], [http://gateoverflow.in/tag/sorting sorting], [http://gateoverflow.in/tag/hashing hashing]. | *[http://gateoverflow.in/tag/binary-search Searching], [http://gateoverflow.in/tag/sorting sorting], [http://gateoverflow.in/tag/hashing hashing]. | ||
*[http://gateoverflow.in/tag/time-complexity Asymptotic worst case time] and [http://gateoverflow.in/tag/space-complexity 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, [http://gateoverflow.in/tag/dynamic-programming dynamic programming] and divide‐and‐conquer. | + | *Algorithm design techniques: [http://gateoverflow.in/tag/greedy-algorithm greedy], [http://gateoverflow.in/tag/dynamic-programming dynamic programming] and divide‐and‐conquer. |
*[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. | ||
Line 70: | Line 70: | ||
'''Basic concepts of complexity classes – [http://gateoverflow.in/tag/p-np-npc-nph 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 – [http://gateoverflow.in/tag/p-np-npc-nph P, NP, NP-hard, NP-complete]. ''' removed. So, these definitions need not be studied but reduction is there in Theory of Computation anyway. | ||
− | ==[http://www.gatecse. | + | ==[http://www.gatecse.in/theory-of-computation/ Theory of Computation]== |
*[http://gateoverflow.in/tag/regular-expressions Regular expressions] and [http://gateoverflow.in/tag/finite-automata finite automata]. | *[http://gateoverflow.in/tag/regular-expressions Regular expressions] and [http://gateoverflow.in/tag/finite-automata finite automata]. | ||
*[http://gateoverflow.in/tag/grammar Context-free grammars] and [http://gateoverflow.in/tag/pda push-down automata]. | *[http://gateoverflow.in/tag/grammar Context-free grammars] and [http://gateoverflow.in/tag/pda push-down automata]. | ||
Line 78: | Line 78: | ||
'''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. | ||
− | ==[http://www.gatecse. | + | ==[http://www.gatecse.in/compiler-design/ Compiler Design]== |
*[http://gateoverflow.in/tag/lexical-analysis Lexical analysis], [http://gateoverflow.in/tag/parsing parsing], [http://gateoverflow.in/tag/syntax-directed-translation syntax-directed translation]. | *[http://gateoverflow.in/tag/lexical-analysis 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]. | ||
*[http://gateoverflow.in/tag/intermediate-code Intermediate code generation]. | *[http://gateoverflow.in/tag/intermediate-code Intermediate code generation]. | ||
− | '''[http://gateoverflow.in/tag/code-generation target code generation], [http://gateoverflow.in/tag/optimization Basics of code optimization].''' removed. This is quite a good removal for students. Questions like register allocation, optimizations like code | + | '''[http://gateoverflow.in/tag/code-generation target code generation], [http://gateoverflow.in/tag/optimization Basics of code optimization].''' removed. This is quite a good removal for students. Questions like register allocation, optimizations like code motion etc. would not be there |
− | ==[http://www.gatecse. | + | ==[http://www.gatecse.in/operating-systems/ Operating System]== |
*[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.] | *[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.] | ||
*[http://gateoverflow.in/tag/resource-allocation Deadlock.] | *[http://gateoverflow.in/tag/resource-allocation Deadlock.] | ||
Line 92: | Line 92: | ||
'''I/O systems, Protection and security''' removed. Rarely questions like size of graphic card required etc have been asked. | '''I/O systems, Protection and security''' removed. Rarely questions like size of graphic card required etc have been asked. | ||
− | ==[http://www.gatecse. | + | ==[http://www.gatecse.in/databases/ Databases]== |
*[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]. | *[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]. | ||
*[http://gateoverflow.in/tag/referential-integrity Integrity constraints], | *[http://gateoverflow.in/tag/referential-integrity Integrity constraints], | ||
Line 100: | Line 100: | ||
No change | No change | ||
− | ==[http://www.gatecse. | + | ==[http://www.gatecse.in/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, | ||
Line 112: | Line 112: | ||
'''IPv6''' added | '''IPv6''' added | ||
'''[http://gateoverflow.in/tag/token-ring Token Ring]''' removed | '''[http://gateoverflow.in/tag/token-ring Token Ring]''' removed | ||
− | |||
'''Basics of Wi-Fi''' added | '''Basics of Wi-Fi''' added | ||
'''[http://gateoverflow.in/tag/routers-bridge-hubs-switches 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. |
==General Aptitude== | ==General Aptitude== | ||
− | *No change in [http://www.gatecse. | + | *No change in [http://www.gatecse.in/numerical-ability/ Numerical Ability] as well as [http://www.gatecse.in/verbal-ability/ Verbal Ability]. |
==Removals== | ==Removals== |
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 and other algorithm portions. 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, optimizations like code motion 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 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 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 and other algorithm portions. 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, optimizations like code motio 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.