Note: Please check your Spam or Junk folder, in case you didn't receive the email with verification code.
This is a digital eBook. No physical copy of this ebook will be delivered. This ebook can be accessed only through this web platform or uLektz readers supported mobile app.
1.1 Introduction: Algorithm - Psuedo code for expressing algorithms - Performance Analysis-Space complexity, Time complexity
1.2 Asymptotic Notation- Big oh notation, Omega notation, Theta notation and Little oh notation
1.3 Probabilistic analysis, Amortized analysis.
2.1 Divide and conquer: General method
2.2 Applications-Binary search, Quick sort, Merge sort
3.1 Greedy method: General method
3.2 Applications-Job sequencing with deadlines, knapsack problem, spanning trees, Minimum cost spanning trees, Single source shortest path problem.
4.1 Dynamic Programming: General method
4.2 Applications-Matrix chain multiplication, Optimal binary search trees, 0/1 knapsack problem, All pairs shortest path problem, Travelling sales person problem, Reliability design.
5.1 Backtracking: General method
5.2 Applications-n-queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles.
6.1 Branch and Bound: General method
6.2 Applications - Travelling sales person problem,0/1 knapsack problem
6.3 LC Branch and Bound solution - FIFO Branch and Bound solution..
No Preview is available for this book
Get 100 instant uPoints on the purchase of Rs.100 or above for each order.
CategoriesComputer Science
Format EPUB
TypeeBook
0
Facebook
Twitter
Email