Lets Explore,

Design & Analysis of Algorithms

(Paperback)

Gajendra Sharma,

Khanna Publishing House (Publisher)

Published

2015

Reviews

Computing and Information Technology Computer science

By: Gajendra Sharma | Publisher: Khanna Publishing House | Released: 08 Sep 2015

Ships within 4-6 days

₹366.00

₹460.00

20% off

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