Image from Amazon.com
Design and analysis of algorithms
Material type:
TextPublication details: New Delhi : S. K. Kataria & Sons, 2012.Description: xxx, 456 pages : ill.; 24 cmISBN: - 9789350141359
- 004.421 BHO
Contents:
Introduction to Algorithms Asymptotic Notations Recursion Vs Recurrence Divide and Conquer Paradigm Dynamic Programming Greedy Approach Backtracking Branch and Bound Lower bound theory Disjoint set manipulation Graph traversals Matrix manipulation algorithms Notion of NP-Completeness Approximation algorithms Large Integers multiplication File Compression Biconnectivity Strongly connected components Topological Sorting Dijkstra's Algorithm
| Item type | Current library | Collection | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|---|
Books
|
IIITDM Kurnool General Stacks | 004.421 BHO (Browse shelf(Opens below)) | Available | 0001578 | ||
|
Books
|
IIITDM Kurnool General Stacks | 004.421 BHO (Browse shelf(Opens below)) | Available | 0001579 | ||
|
Books
|
IIITDM Kurnool General Stacks | 004.421 BHO (Browse shelf(Opens below)) | Available | 0001580 | ||
|
Books
|
IIITDM Kurnool General Stacks | 004.421 BHO (Browse shelf(Opens below)) | Available | 0001581 | ||
Reference
|
IIITDM Kurnool General Stacks | Reference | 004.421 BHO (Browse shelf(Opens below)) | Not For Loan | 0001582 | |
|
Books
|
IIITDM Kurnool General Stacks | 004.421 BHO (Browse shelf(Opens below)) | Available | 0001583 | ||
|
Books
|
IIITDM Kurnool General Stacks | 004.421 BHO (Browse shelf(Opens below)) | Available | 0001584 | ||
|
Books
|
IIITDM Kurnool General Stacks | 004.421 BHO (Browse shelf(Opens below)) | Available | 0001585 | ||
|
Books
|
IIITDM Kurnool General Stacks | 004.421 BHO (Browse shelf(Opens below)) | Available | 0001586 | ||
|
Books
|
IIITDM Kurnool General Stacks | 004.421 BHO (Browse shelf(Opens below)) | Available | 0001587 | ||
Gratis, Gifts
|
IIITDM Kurnool General Stacks | 004.421 BHO (Browse shelf(Opens below)) | Available | G000027 | ||
|
Gratis, Gifts
|
IIITDM Kurnool General Stacks | 004.421 BHO (Browse shelf(Opens below)) | Available | G000028 | ||
|
Gratis, Gifts
|
IIITDM Kurnool General Stacks | 004.421 BHO (Browse shelf(Opens below)) | Available | G000058 |
Introduction to Algorithms Asymptotic Notations Recursion Vs Recurrence Divide and Conquer Paradigm Dynamic Programming Greedy Approach Backtracking Branch and Bound Lower bound theory Disjoint set manipulation Graph traversals Matrix manipulation algorithms Notion of NP-Completeness Approximation algorithms Large Integers multiplication File Compression Biconnectivity Strongly connected components Topological Sorting Dijkstra's Algorithm
There are no comments on this title.