Description
Khanna Publishing House Design & Analysis Of Algorithms 4Th Edition 2019 by Gajendra Sharma
Chapter 1: IntroductionChapter 2: Growth of FunctionsChapter 3: SummationsChapter 4: RecurrencesChapter 5: Sets Relations and FunctionsChapter 6: ProbabilityChapter 7: Heaps and Heapsort Chapter 8: QuicksortChapter 9: Sorting in Linear TimeChapter 10: Medians and Order StatisticsChapter 11: Elementary Data StructuresChapter 12: HashingChapter 13: BS TreesChapter 14: Optimal Binary Search TreesChapter 15: AVL Trees And SplayingChapter 16: RB-TreesChapter 17: Augmenting Data StructureChapter 18: Dynamic ProgrammingChapter 19: Greedy AlgorithmsChapter 20: Amortized AnalysisChapter 21: B. Trees-External SearchingChapter 22: Binomial Trees and Binomial HeapsChapter 23: Fibonacci HeapsChapter 24: Data Structure for Disjoint SetsChapter 25: Elementary Graph AlgorithmsChapter 26: Back TrackingChapter 27: Branch and BoundChapter 28: Minimum Spanning TreeChapter 29: Single-Source Shortest PathsChapter 30: All Pair Shortest PathsChapter 31: Network FlowChapter 32: Sorting NetworksChapter 33: Arithmetic CircuitsChapter 34: Algorithms for Parallel ComputersChapter 35: Matrix OperationChapter 36: Polynomials and FFTChapter 37: Number-Theoretic AlgorithmsChapter 38: String MatchingChapter 39: Computational GeometryChapter 40: NP-CompletenessChapter 41: Non-Deterministic AlgorithmsChapter 42: Approximation AlgorithmsChapter 43: ProgramExam PapersBibliography