1.
Selection sort algo and its complexity n2(2-43)
2 .
Selection sort & quick sort its complexity
n2(3-31)
3.
Different dynamic program vs. greedy algo(5-3)
4.
Worst case, best case ,average case complexity(2-5)
5.
Explain DFS with algo & suitable eg.(6-19)
6.
Explain Knapsack problem with example(5-27)
7.
Explain BFS with algo & suitable eg.(6-10)
8.
P & NP Compile program(8-3,8-5)
9.
Robin karp algo (7-6)
Example question is same ……
10.
Explain asymptotic analysis of algo(2-9)
11.
Short note on 8 queens problem (6-59)
[NOTE: à
page numbers are of technical A.A. Pumtambekar ]
