English
₹6508
(All inclusive*)
Paperback
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
Delivery Options
Please enter pincode to check delivery time.
*COD & Shipping Charges may apply on certain items.
Review final details at checkout.
About The Book
Description
Author
The aim of this book is to understand: Algorithm Pseudo code for expressing algorithms Performance Analysis-Space complexity Time complexity Asymptotic Notation - Big oh notation Omega notation The ta notation and Little oh notation Probabilistic analysis Amortized analysis. Searching and Traversal Techniques: Efficient non - recursive binary tree traversal algorithm Disjoint set operations union and find algorithms Spanning trees.
Piracy-free
Assured Quality
Secure Transactions
Fast Delivery
Sustainably Printed
Details
ISBN 13
9786202528849
Publication Date
-21-04-2020
Pages
-136
Weight
-195 grams
Dimensions
-150x220x7.59 mm
