Notion of an Algorithm - Fundamentals of Algorithmic Problem Solving - Important Problem Types — Fundamentals of the Analysis of Algorithm Efficiency - Analysis Framework - Asymptotic Notations and its properties - Mathematical analysis for Recursive and Non-recursive algorithms.

Brute Force - Closest-Pair and Convex-Hull Problems-Exhaustive Search - Traveling Salesman Problem - Knapsack Problem - Assignment problem. Divide and conquer methodology - Merge sort — Quick sort — Binary search — Multiplication of Large Integers- Strassen"s Matrix Multiplication-Closest-Pair and Convex-Hull Problems.

Computing a Binomial Coefficient — Warshall"s and Floyd" algorithm - Optimal Binary Search Trees - Knapsack Problem and Memory functions. Greedy Technique— Prim"s al orithm- Kruskal's Al orithm-Di'kstra's Al orithm-Huffman Trees.

The Simplex MeFthod-The Maximum-Flow Problem - Maximm Matching in Bipartite Graphs- The Stable marriage Problem.

Limitations of Algorithm Power-Lower-Bound Arguments-Decision Trees-P, NP and NPComplete Problems--Coping with the Limitations - Backtracking - n-Queens problem — Hamiltonian Circuit Problem - Subset Sum Problem-Branch and Bound - Assignment problem - Knapsack Problem - Traveling Salesman Problem- Approximation Algorithms for NP - Hard Problems - Travelin Salesman roblem - Kna sack roblem