Design & Analysis of Algorithms
Material type:
TextPublisher number: Allied Informatics, Jaipur | 2019-20Publication details: New Delhi Khanna Book Publishing Co (P) Ltd. 2019Edition: 4thDescription: 656ISBN: - 978-93-82609-43-8
- 005.1 SHA
| Item type | Current library | Call number | Status | Barcode | |
|---|---|---|---|---|---|
Books
|
BSDU Knowledge Resource Center, Jaipur General Stacks | 005.1 SHA (Browse shelf(Opens below)) | Available | 018025 |
Browsing BSDU Knowledge Resource Center, Jaipur shelves, Shelving location: General Stacks Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 005 SHA Information Security | 005.1 CHO Object Oriented Software Engineering: A practical approach | 005.1 GOM Software Modeling and Design | 005.1 SHA Design & Analysis of Algorithms | 005.1068 CHO Software Project Management: A practical approach | 005.10685 SHA Software Quality Engineering | 005.117 SUM Programming in Python 3: A complete introduction to the python language |
Contents
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
There are no comments on this title.