Fundamentals of Algorithms (V-U)

• Introduction,Implementation Issues, Analyzing Algorithms (V-U)
• Model of Computation (V-U)
• Brute-Force Algorithm,Running Time Analysis (V-U)
• Analysis of the brute-force maxima algorithm (V-U)
• Plane-sweep Algorithm its analysis and Comparison to Brute-force Algorithim (V-U)
• Asymptotic Notation (V-U)
• Divide and Conquer Strategy,Merge Sort (V-U)
• Analysis of Merge Sort (V-U)
• The Iteration and Recursion Tree Methods for Solving Recurrence Relations (V-U)
• Sieve Technique (V-U)
• Heap sort algorithm (V-U)
• Quick sort (V-U)
• Average-case Analysis of Quicksort (V-U)
• In-place,Stable Sorting (V-U)
• Radix sort (V-U)
• Dynamic Programming ,Edit Distance Applications and Algorithim (V-U)
• Edit Distance: Dynamic Programming Algorithm and its Analysis (V-U)
• Chain Matrix Multiply (V-U)
• Chain Matrix Multiply II (V-U)
• Knapsack Problem (V-U)
• Knapsack Problem: Dynamic Programming Approach (V-U)
• Greedy Algorithms,Examples:Counting Money (V-U)
• Huffman Encoding Algorithm (V-U)
• Huffman Encoding: Correctness, Activity Selection (V-U)
• Correctness of Greedy Activity Selection (V-U)