Algorithms GATE CS Syllabus : Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer. Graph traversals, minimum spanning trees, shortest paths.
Algorithms Lectures and GATE CS & DA Previous Year Questions(PYQ) Slides by Monalisa Pradhan
-> Chapter 1 : Algorithm Analysis [Algorithm intro , Order of growth ,Asymptotic notation, Time complexity, space complexity, Analysis of Recursive & non recursive program, Master theorem ]
->Chapter 2 : Brute Force [Sequential search, Selection Sort and Bubble Sort , Radix sort, Depth first Search and Breadth First Search.]
->Chapter 3 : Decrease and Conquer [Insertion Sort, Topological sort , Binary Search .]
->Chapter 4 : Divide and conquer [Min max problem , matrix multiplication ,Merge sort ,Quick Sort , Binary Tree Traversals and Related Properties .]
-> Chapter 5 : Transform and conquer [Heaps and Heap sort, Balanced Search Trees.]
->Chapter 6 : Greedy Method [knapsack problem , Job Assignment problem, Optimal merge, Hoffman Coding, minimum spanning trees, Dijkstra’s Algorithm.]
-> Chapter 7 : Dynamic Programming [The Bellman-Ford algorithm ,Warshall’s and Floyd’s Algorithm ,Rod cutting, Matrix-chain multiplication ,Longest common subsequence ,Optimal binary search trees]
–>Chapter 8 : Hashing.