000			02111nam a22002177a 4500
999			_c2471 _d2471
003			OSt
005			20200224104710.0
008			200118b ||||| |||| 00| 0 eng d
020			_a978-93-82609-43-8
028			_bAllied Informatics, Jaipur _c7084 _d13/01/2020 _q2019-20
040			_aBSDU _bEnglish _cBSDU
082			_a005.1 _bSHA
100			_aSharma,Gajendra
245			_aDesign & Analysis of Algorithms
250			_b4th
260			_aNew Delhi _bKhanna Book Publishing Co (P) Ltd. _c2019
300			_a656
504			_aContents 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 Heapsort Chapter 8: Quicksort 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 Exam Papers
650			_aAlgorithms
942			_2ddc _cBK