|
||||||||||
|
||||||||||
FAQ | CONTACT US | ||||||||||
DESIGN
AND ANALYSIS OF ALGORITHMS
Unit-IUnit-II Devide and conquer:Control abstraction, Analysis of binary search ,Finding maximum and minimum, Merge sort, Quick sort, Finding smallest element (selection), Strassen's matrix multiplication. Unit-IIIThe Greedy Method: Control abstraction, optimal storage on tapes, Knapsack problem, Optimal merge patterns, Huffman codes, MST (Minimum Spanning Trees), Prim's algorithm, Kruskal's algorithm. Unit-IVDynamic Programming and Traversal Technique : General method, Multistage graphs, Shortest path (-ve weights), OBST (Optimal Binary Search Tree),0/1 Knapsack, TSP(Travelling Sales Person Problem), Graph Traversal ( BFS and DFS ) Unit-VBacktracking & Lower Bound Theory: General algorithm (non recursive & recursive), n-Queens problem, Sum of subsets problem, Graph coloring, Hamiltonian cycles, Lower bound on searching, Lower bound on sorting, Lower bound on finding Max & Min. Books
|
||||||||||