Analysis and Design of Computer Algorithms by Ganesh Kumar
File Type :PDF
Number of Pages :85
This note covers the following topics: Divide And Conquer Strategy, Greedy
Method, Minimum Spanning Trees, Dynamic Programming, Optimal Binary search
trees, Backtracking Method, Branch and Bound, Lower bound Theory.