Hurray Buy More, Save More – Get EXTRA Discount on EXTRA Quantity!
Menu
Shopping Cart 0

Your cart is empty

Continue Shopping
Design & Analysis of Algorithms
(0)
(22)
In Stock
Published:
May 29, 2026
Edition:
4
Type of book:
physical
No. of Pages:
672
Year:
2026
Language:
English
Publisher:
Khanna Publishing House
Categories:
UNIVERSITY RECOMMENDED, Computer Science Engineering, Computer Science Engineerings, Book Store
Condition Type:
New
Country Origin:
India
🎁 Get EXTRA Discount on EXTRA Quantity
$363.75
In Stock
ISBN 13 : 978-93-82609-43-8
ISBN-10: 9382609431
🚚 Ships within 1-2 business days

This book is intended for B. Tech (CS/IT), MCA and M. Tech students who want to have the basic to advanced knowledge of the design and analysis of algorithms. This book discusses various features of  Algorithm design. In this 3rd edition more algorithms are added, papers of last few years are solved in chapters; few algorithms which were difficult to understand in previous edition are presented in easier form.

  1. Introduction
  2. Growth of Functions
  3. Summations
  4. Recurrences
  5. Sets Relations and Functions
  6. Probability
  7. Heaps and Heapsort
  8. Quicksort
  9. Sorting in Linear Time
  10. Medians and Order Statistics
  11. Elementary Data Structures
  12. Hashing
  13. BS Trees
  14. Optimal Binary Search Trees
  15. AVL Trees And Splaying
  16. RB-Trees
  17. Augmenting Data Structure
  18. Dynamic Programming
  19. Greedy Algorithms
  20. Amortized Analysis
  21. B. Trees-External Searching
  22. Binomial Trees and Binomial Heaps
  23. Fibonacci Heaps
  24. Data Structure for Disjoint Sets
  25. Elementary Graph Algorithms
  26. Back Tracking
  27. Branch and Bound
  28. Minimum Spanning Tree
  29. Single-Source Shortest Paths
  30. All Pair Shortest Paths
  31. Network Flow
  32. Sorting Networks
  33. Arithmetic Circuits
  34. Algorithms for Parallel Computers
  35. Matrix Operation
  36. Polynomials and FFT
  37. Number-Theoretic Algorithms
  38. String Matching
  39. Computational Geometry
  40. NP-Completeness
  41. Non-Deterministic Algorithms
  42. Approximation Algorithms
  43. Program
  44. Exam Papers
  45. Bibliography

Gajendra Sharma

Gajendra Sharma, a widely acclaimed author in the field of IT and Software both at the National and International arena, is currently working as an Assistant Professor at IIMT Group of College, Greater Noida. The best qualities of his writings have been the core topics of computer science, which has always been precise and concise with all concepts dealt in greater detail. He is having nine years of teaching experience. He also provides consultancy in software development to several IT firms.

0.0

Customer Rating (0)

0% (0)
0% (0)
0% (0)
0% (0)
0% (0)

Customer Feedback

No reviews yet. Be the first to review this product!

No other books found by the same author.

If you are a professor or educator and would like to request a review copy for your institution, please contact us at or use the review form below to express interest.

Related Products

Browse All Books

Recently Viewed Products

View All
Books

0 +

No. of Books

Languages

0 +

Published in language

Experience

0 +

Years of Experience

Manuscripts

0 +

Manuscripts received annually

Subscribe to our newsletter

Subscribe newsletter for updates, special offers and promotions