What do you think?
Rate this book
Design & Analysis of Algorithms for JNTU
Introduction Divide and Conquer Searching and Traversal Techniques Greedy Method Dynamic Programming Backtracking Branch and Bound NP-Hard and NP-Complete Problems
444 pages, Paperback
30 people are currently reading
292 people want to read
Ratings & Reviews
Friends & Following
Create a free account to discover what your friends think of this book!
Community Reviews
Displaying 1 - 2 of 2 reviews
June 14, 2019
How to read a book it's not showing pages only
October 27, 2020
How to read this
Displaying 1 - 2 of 2 reviews