Notion of Algorithm, Fundamentals of Algorithmic Problem Solving, Important ProblemTypes, Fundamental data Structures. Analysis Framework, Asymptotic Notations and Basicefficiency classes, Mathematical analysis of Recursive and Non-recursive algorithms,Examples. Selection Sort and Bubble Sort, Sequential Search and String Matching.
Mergesort, Quicksort, Binary Search, Binary tree Traversals and related properties,Multiplication of large integers, Stressen’s Matrix Multiplication
Insertion Sort, Depth First and Breadth First Search, Topological sorting, Algorithms forGenerating Combinatorial Objects
Sorting by Counting, Input Enhancement in String Matching, Hashing
Computing a binomial coefficient, Warshall’s and Floyd’s Algorithms, The KnapsackProblem and Memory Functions
Prim’s Algorithm, Kruskal’s Algorithm, Dijkstra’s Algorithm, Knapsack
Lower-Bound Arguments, Decision Trees, P, NP and NP-Complete Problems