Fundamentals of Algorithms (V-U)

Analysis of Merge Sort (V-U)

Analysis of Selection, Sorting, Heaps (V-U)

Analysis of the brute-force maxima algorithm (V-U)

Asymptotic Notation (V-U)

Average-case Analysis of Quicksort (V-U)

Boolean Satisfiability Problem:Cook''s Theorem,Independent Sets (V-U)

Breadth-first Search,Generic Graph Traversal Algorithm (V-U)

Breadth-first Search,Generic Graph Traversal Algorithm II (V-U)

Brute-Force Algorithm,Running Time Analysis (V-U)

Chain Matrix Multiply (V-U)

Chain Matrix Multiply II (V-U)

Complexity Theory,Classes P,NP (V-U)

Computing MST: Generic Approach,Greedy MST (V-U)

Correctness of Dijkstra''s Algorithm, Bellman-Ford Algorithm (V-U)

Correctness of Greedy Activity Selection (V-U)

DFS – Timestamp Structure ,DFS – Cycles (V-U)

Dijkstra''s Algorithm (V-U)

Divide and Conquer Strategy,Merge Sort (V-U)

Dynamic Programming ,Edit Distance Applications and Algorithim (V-U)

Edit Distance: Dynamic Programming Algorithm and its Analysis (V-U)

Floyd-Warshall Algorithm (V-U)

Floyd-Warshall Algorithm II (V-U)

Fractional Knapsack Problem ,Graphs (V-U)

Graphs: Representations,Traversal (V-U)

Greedy Algorithms,Examples:Counting Money (V-U)