Unit 1
1.Introduction
|
|
2.Space & Time complexity
|
|
3.Asymptotic Notation
|
|
4.Divide and Conquer
|
|
5.Divide and conquer2
|
|
6.Divide and Conquer3
|
|
7.Selection sort
|
|
8.Stressens Matrix Multiplication
|
|
9.Greedy method-knapsack problem
|
|
10.Job sequence
|
|
11.Spanning tree
|
|
Unit 2
1.Dynamic programming
|
|
2.Optimal Binary Search tree
|
|
Unit 3
1.Basic Traversal & Search techniques
|
|
Unit 4
1.Branch and Bound
|
|
Unit 5
1.NP hard and NP complement problems
|
|
2.Basic concepts
|
|