- A single example of Design, Insertion Sort, Pseudo code for insertion sort, analysis of time complexity, Asymptotic notations and time complexity and writing efficient programs (by considering some small programs).
- Harner's method of evaluating a polynomial at a given point, finding maximum and minimum for a given set of numbers, straight min, combinations for max and min. Analysis of linear and binary search algorithms.
- Divide and conquer algorithms, Sorting, multiplication of two long integers, straseen's Matrix multiplication
- Greedy approach, Optimum scheduling, fractional Kanpsack problem minimum spanning trees, single source shortest path problem.
- Dynamic programming, Design and analysis, Traveling salesman problem, Optimal parameterization for product of a sequence of matrices.
- Back tracking and branch and bound methods, Least cost methos, 4 - Queens problem using back tracking. Traveling salesman problem using branch and bound method.
- Lower bound theory.
|