Setting
 
Shopping Cart (0 item)
My Cart

You have no items in your shopping cart.

You're currently on:

DESIGN & ANALYSIS OF ALGORITHMS

DESIGN & ANALYSIS OF ALGORITHMS

DESIGN & ANALYSIS OF ALGORITHMS

SANDEEP KUMAR

Availability: In stock

-
+
₹120.00
  • Pages: 332 pages
  • Edition:
  • Year:
  • ISBN:: 978-93-5140-327-1
  • Publisher: Pragati Prakashan
 
1. INTRODUCTION, 2. GROWTH OF FUNCTIONS, 3. SUMMATION, 4. RECURRENCE, 5. HEAP AND HEAPSORT, 6. QUICK SORT, 7. SORTING IN LINEAR TIME, 8. MEDIANS AND ORDER OF STATISTICS, 9. ELEMENTARY DATA STRUCTURES, 10. HASHING, 11. BINARY SEARCH TREE, 12. RED-BLACK TREES, 13. SPLAY TREE, 14. AUGMENTING DATA STRUCTURES, 15. DYNAMIC PROGRAMMING, 16. GREEDY ALGORITHMS, 17. AMORTIZED ANALYSIS, 18. B-TREES: EXTERNAL SEARCHING, 19. BINOMIAL TREES AND BINOMIAL HEAPS, 20. FIBONACI HEAPS, 21. DATA STRUCTURES FOR DISJOINT SETS, 22. ELEMENTARY GRAPH ALGORITHMS, 23. MANIMUM SPANNING TREE, 24. SINGLE-SOURCE SHORTEST PATH, 25. ALL PAIRS SHORTEST PATHS, 26. MAXIMUM FLOW, 27. SORTING NETWORKS, 28. LINEAR PROGRAMMING, 29. NUMBER THEORITIC ALGORITHMS, 30. POLYNOMIALS AND FFT, 31. MATRIX OPERATIONS, 32. STRING MATCHING, 33. COMPUTATIONAL GEOMETRY, 34. NP-COMPLETENESS, 35. APPROXIMATION ALGORITHMS, 36. MISCELLANEOUS TOPICS

Additional Information

Edition N/A
Pages 332
ISBN 978-93-5140-327-1
ISBN 9789351403271
Year N/A
Author SANDEEP KUMAR

Product Tags

Use spaces to separate tags. Use single quotes (') for phrases.

  • Free Shipping on orders over Rs. 1200
  • Returns and Replacement with 5 business days
  • Cancellation within 2 business days
  • Address any queries here
Location

Address: Pragati Bhawan, 240 Western Kutchery Road, Meerut, Uttar Pradesh - 250001

Mail to: [email protected]

Phone: 0121-4007643, 0121-2640642, 0121-2643636

[profiler]
Memory usage: real: 10485760, emalloc: 8048888
Code ProfilerTimeCntEmallocRealMem