Education and Career Forum

The academic course curriculum for Design and Analysis of Algorithms is simple and clear. It has the basic mathematical concepts associated with algorithmic concepts and fundamental models to depict the processes of designing. They can be mainly classified into graph algorithms, conquer algorithms, algorithms for social networks, optimization algorithms, algorithm analysis and computational geometry. An exhaustive overview of the main topics portray the key algorithmic concepts such as parallel algorithm, distributed algorithm, advanced algorithm, approximation algorithm and graphs. There are concepts of discrete maths like summation formulae, sets and operations, permutations, combinations, probability and asymptotic notation. Other than this, there are basic data structuring concepts like binary features, array, search, list and stack. Other topics describe the sorting techniques like radix-sort, merge-sort, binary search, quick-sort and heap-sort. Graph algorithms are even more integral zeroing in on connected components, transitive closure, DFS and BFS. Finally, it has digraph algorithms focussing on topological sorting.

is there is any one with elitmus sample papers???..
any book for high level apptitude???/