Chapter 1 : Review

Concept of algorithm

Components of algorithms

Chapter 2 : Different perspectives of algorithm

Numerical algorithm

Review of searching algorithm

Review of sorting algorithm

Recursion v/s iteration

Chapter 3 : Graph theory and related data structure

Introduction to graph theory

Matrix representation

Trees

Chapter 4 : Divide and Conquer

Divide & Conquer : Binary search

Max- Min Search & Merge sort

Integer Multiplication

Chapter 5 : Greedy method

Cassette filling

Knapsack problem

Job scheduling

Chapter 6 : Backtracking and Branch and Bound

Backtracking

Branch & Bound

Chapter 7 : Graph theoretic algorithms

Shortest path

Minimal spanning trees

Techniques for Graphs