Algorithms /
By: Johnsonbaugh, Richard.
Contributor(s): Schaefer, Marcus.
Material type:
BookPublisher: [S.l.] : Prentice Hall, 2009Description: 768 p.ISBN: 0023606924 (hardcover); 9780023606922 (hardcover).Online resources: Click here to access online Summary: Filling the void left by other algorithms books, Algorithms and Data Structures provides an approach that emphasizes design techniques. The volume includes application of algorithms, examples, end-of-section exercises, end-of-chapter exercises, hints and solutions to selected exercises, figures and notes to help the reader master the design and analysis of algorithms. This volume covers data structures, searching techniques, divided-and-conquer sorting and selection, greedy algorithms, dynamic programming, text searching, computational algebra, P and NP and parallel algorithms. For those interested in a better understanding of algorithms.
| Item type | Current location | Call number | Status | Date due | Barcode | Item holds |
|---|---|---|---|---|---|---|
Books
|
Central Library, QUEST, Nawabshah
Welcome to the Central Library, QUEST, Nawabshah, Sindh, Pakistan |
005.1JOH (Browse shelf) | Available | 37326 |
Browsing Central Library, QUEST, Nawabshah Shelves Close shelf browser
| 005.1JOH Algorithms | 005.1JOH Algorithms / | 005.1JOH Algorithms | 005.1JOH Algorithms / | 005.1JOH Algorithms | 005.1KAN Testing Computer Software | 005.1KEL Software Engineering : a concise study |
Filling the void left by other algorithms books, Algorithms and Data Structures provides an approach that emphasizes design techniques. The volume includes application of algorithms, examples, end-of-section exercises, end-of-chapter exercises, hints and solutions to selected exercises, figures and notes to help the reader master the design and analysis of algorithms. This volume covers data structures, searching techniques, divided-and-conquer sorting and selection, greedy algorithms, dynamic programming, text searching, computational algebra, P and NP and parallel algorithms. For those interested in a better understanding of algorithms.
There are no comments for this item.