English
Paperback
₹3898
(All inclusive*)
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
Looking to place a bulk order? SUBMIT DETAILS
Piracy-free
Assured Quality
Secure Transactions
About The Book
Description
Author
The book contains: Algorithms and Complexity: Asymptotic notations orders worst-case and average-case amortized complexity. Basic Techniques: divide & conquer dynamic programming greedy method backtracking. Branch and bound randomization. Data Structures: heaps search trees union-find problems. Applications: sorting & searching combinatorial problems. Optimization problems computational geometric problems string matching. Graph Algorithms: BFS and DFS connected components. Spanning trees shortest paths MAX-flow. NP - completeness Approximation algorithms.
Piracy-free
Assured Quality
Secure Transactions
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
Details
ISBN 13
9786202517126
Publication Date
-25-03-2020
Pages
-64
Weight
-101 grams
Dimensions
-150x220x3.89 mm
