Fundamentals of Algorithms (V-U)

Heap sort algorithm (V-U)

Huffman Encoding Algorithm (V-U)

Huffman Encoding: Correctness, Activity Selection (V-U)

In-place,Stable Sorting (V-U)

Introduction,Implementation Issues, Analyzing Algorithms (V-U)

Knapsack Problem (V-U)

Knapsack Problem: Dynamic Programming Approach (V-U)

Kruskal''s Algorithm (V-U)

Minimum Spanning Trees (V-U)

Model of Computation (V-U)

Plane-sweep Algorithm its analysis and Comparison to Brute-force Algorithim (V-U)

Precedence Constraint Graph ,Topological Sort (V-U)

Prim''s Algorithm (V-U)

Quick sort (V-U)

Radix sort (V-U)

Reductions ,NP-Completeness (V-U)

Shortest Paths (V-U)

Sieve Technique (V-U)

Strong Components and DFS (V-U)

The Iteration and Recursion Tree Methods for Solving Recurrence Relations (V-U)