Fundamentals of Algorithmic Problem Solving
Algorithm Design Techniques
Methods of Specifying an Algorithm 
Proving an Algorithm’s Correctness
Coding an Algorithm
Designing an Algorithm and Data Structures
Important Problem Types in Algorithms Analysis
Fundamentals of the Analysis of Algorithm Efficiency
Properties of Asymptotic Notations
The Analysis Framework
Empirical Analysis of Algorithms
Mathematical Analysis of Non recursive Algorithms
Mathematical Analysis of Recursive Algorithms
Algorithm Visualization
Closest Pair of Points using Divide and Conquer algorithm
Closest-Pair and Convex-Hull Problems by Brute Force
Exhaustive Search
 Knapsack Problem 
DAA - Travelling Salesman Problem
Greedy approach vs Dynamic programming
Warshall’s and Floyd’s Algorithms
The Knapsack Problem and Memory Functions
Greedy Technique
Prim’s Algorithm
Kruskal’s Algorithm
Dijkstra’s Algorithm
Huffman Trees and Codes
Iterative Improvement
The Simplex Method
Maximum Matching in Bipartite Graphs