|
|
| Line 5: |
Line 5: |
| | * Graphs: connectivity, matching, coloring. | | * Graphs: connectivity, matching, coloring. |
| | * Combinatorics: counting, recurrence relations, generating functions. | | * Combinatorics: counting, recurrence relations, generating functions. |
| | + | |
| | + | '''Boolean Algebra''' moved to Digital Logic. |
| | + | '''Permutations; Combinations''' removed from Combinatorics but being basic and counting being there this doesn't 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. |
| | | | |
| | ==Linear Algebra== | | ==Linear Algebra== |
| Line 11: |
Line 16: |
| | *Eigenvalues and eigenvectors | | *Eigenvalues and eigenvectors |
| | *LU decomposition | | *LU decomposition |
| | + | |
| | + | '''LU decomposition''' added here from Numerical methods which was removed as a whole otherwise. |
| | | | |
| | ==Calculus== | | ==Calculus== |
| Line 16: |
Line 23: |
| | * Maxima and minima. Mean value theorem. | | * Maxima and minima. Mean value theorem. |
| | * Integration. | | * 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== | | ==Probability== |
| Line 22: |
Line 30: |
| | *Mean, median, mode and standard deviation. | | *Mean, median, mode and standard deviation. |
| | *Conditional probability and Bayes theorem. | | *Conditional probability and Bayes theorem. |
| | + | '''Bayes theorem''' newly added but it was implicitly part of conditional probability |
| | | | |
| | ==Digital Logic== | | ==Digital Logic== |
| Line 28: |
Line 37: |
| | *Combinational and sequential circuits. Minimization. | | *Combinational and sequential circuits. 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 |
| | | | |
| | ==Computer Organization and Architecture== | | ==Computer Organization and Architecture== |
| Line 36: |
Line 46: |
| | * Memory hierarchy: cache, main memory and secondary storage; | | * Memory hierarchy: cache, main memory and secondary storage; |
| | * I/O interface (interrupt and DMA mode). | | * I/O interface (interrupt and DMA mode). |
| | + | ''' Memory interface''' part is removed. So, questions on RAM won't be there. |
| | | | |
| | ==Programming and Data Structures== | | ==Programming and Data Structures== |
| | *Programming in C. Recursion. | | *Programming in C. Recursion. |
| | *Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. | | *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 won't be there. |
| | + | '''Graphs''' added here. |
| | | | |
| | ==Algorithms== | | ==Algorithms== |
GATECSE