Design and analysis of algorithms
Material type:
TextPublication details: New Delhi : S. K. Kataria & Sons, 2012.Edition: 2nd edDescription: 613 pages : ill.; 23 cmISBN: - 9789350140918
- 004.421 RAJ
| Item type | Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
Gratis, Gifts
|
IIITDM Kurnool General Stacks | 004.421 RAJ (Browse shelf(Opens below)) | Available | G000047 |
Browsing IIITDM Kurnool shelves, Shelving location: General Stacks Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 004.421 HOR Fundamentals of Computer Algorithms | 004.421 HOR Fundamentals of Computer Algorithms | 004.421 PAR Design and analysis of algorithms | 004.421 RAJ Design and analysis of algorithms | 004.421 UPA The design and analysis of algorithms | 004.422 DRO Data structures and algorithms in C++ | 004.422 DRO Data structures and algorithms in C++ |
Growth of Function Recurrence Sorting Algorithms Divide and Conquer Heapsort Quicksort Sorting in Linear Time Median and Order Statistics Red Black Tree Augmenting Data Structures Dynamic Programming Greedy Algorithms Amortized Analysis B-Tree Binomial Heaps Fibonacci Heaps Data Strutures for Disjoint Sets Backtracking Branch and Sounds Elementary Graph Algorithms Minimum Spanning Tree Single Source Shortest Paths All Pairs Shortest Path Maximum Flow Sorting Networks Matrix Operations Polynomials and the FFT Number Theoretic Algorithms String Matching NP-Completeness Approximation Algorithms
This book provides a treatment of designing procedures of algorithms and how to analyze algorithms. The book is applicable for courses in data structures and algorithms.
There are no comments on this title.