01972nam a22001937a 4500003000400000005001700004008004100021020002200062028005800084040002400142082001500166100002000181245003600201250000900237260005600246300000800302504145300310650001501763OSt20200224104710.0200118b           ||||| |||| 00| 0 eng d  a978-93-82609-43-8  bAllied Informatics, Jaipurc7084d13/01/2020q2019-20  aBSDUbEnglishcBSDU  a005.1bSHA  aSharma,Gajendra  aDesign & Analysis of Algorithms  b4th   aNew DelhibKhanna Book Publishing Co (P) Ltd.c2019  a656  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  aAlgorithms