Foundations of algorithms using Java pseudocode / Richard Neapolitan, Kumarss Naimipour.
Material type:
TextPublication details: Sudbury, Mass. : Jones and Bartlett, 2004.Description: xv, 618 p. : ill ; 24 cmISBN: - 9780763721299
- .
| Item type | Current library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
| REGULAR | University of Wollongong in Dubai Main Collection | 518.1 NE FO (Browse shelf(Opens below)) | Available | T0023897 |
Browsing University of Wollongong in Dubai shelves, Shelving location: Main Collection Close shelf browser (Hides shelf browser)
|
|
|
|
|
|
|
||
| 518.1 NE FO Foundations of algorithms using C++ pseudocode / | 518.1 NE FO Foundations of algorithms using C++ pseudocode / | 518.1 NE FO Foundations of algorithms using C++ pseudocode / | 518.1 NE FO Foundations of algorithms using Java pseudocode / | 518.5 WI DE The design of approximation algorithms / | 519.24 GR TE Tempered stable distributions : | 519.54 NE RO Robustness tests for quantitative research |
Includes bibliographical references and index. Ch. 1. Algorithms: Efficiency, Analysis, and Order -- Ch. 2. Divide-and-Conquer -- Ch. 3. Dynamic Programming -- Ch. 4. The Greedy Approach -- Ch. 5. Backtracking -- Ch. 6. Branch-and-Bound -- Ch. 7. Introduction to Computational Complexity: The Sorting Problem -- Ch. 8. More Computational Complexity: The Searching Problem -- Ch. 9. Computational Complexity and Intractability: An Introduction to the Theory of NP -- Ch. 10. Number-Theoretic Algorithms -- Ch. 11. Introduction to Parallel Algorithms -- App. B. Solving Recurrence Equations: With Applications to Analysis of Recursive Algorithms -- App. C. Data Structures for Disjoint Sets.
CSCI103
CSCI203
There are no comments on this title.