Normal view MARC view ISBD view

How to think about algorithms / Jeff Edmonds.

By: Edmonds, Jeff | , 1963-.
Material type: materialTypeLabelBookPublisher: Cambridge ; New York : Cambridge University Press, 2008Description: xiii, 448 p. : ill. ; 25 cm.ISBN: 9780521849319 (hardback); 0521849314 (hardback); 9780521614108 (pbk.); 0521614104 (pbk.).Subject(s): Algorithms | Loops (Group theory) | Invariants | Recursion theory | -- Study and teaching | -- Study and teaching | -- Study and teaching | -- Study and teachingDDC classification: 518.1 Online resources: Contributor biographical information | Publisher description | Table of contents only
Contents:
Part I. Iterative Algorithms and Loop Invariants: 1. Measures of progress and loop invariants; 2. Examples using more of the input loop invariant; 3. Abstract data types; 4. Narrowing the search space: binary search; 5. Iterative sorting algorithms; 6. Euclid's GCD algorithm; 7. The loop invariant for lower bounds; Part II. Recursion: 8. Abstractions, techniques, and theory; 9. Some simple examples of recursive algorithms; 10. Recursion on trees; 11. Recursive images; 12. Parsing with context-free grammars; Part III. Optimization Problems: 13. Definition of optimization problems; 14. Graph search algorithms; 15. Network flows and linear programming; 16. Greedy algorithms; 17. Recursive backtracking; 18. Dynamic programming algorithms; 19. Examples of dynamic programming; 20. Reductions and NP-completeness; 21. Randomized algorithms; Part IV. Appendix: 22. Existential and universal quantifiers; 23. Time complexity; 24. Logarithms and exponentials; 25. Asymptotic growth; 26. Adding made easy approximations; 27. Recurrence relations; 28. A formal proof of correctness; Part V. Exercise Solutions.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode
General Books General Books CUTN Central Library

This is a searchable open catalogue of all library of the Central University of Tamil Nadu.

Sciences
Non-fiction 518.1 EDM (Browse shelf) Available 28054
General Books General Books CUTN Central Library

This is a searchable open catalogue of all library of the Central University of Tamil Nadu.

Sciences
Non-fiction 518.1 EDM (Browse shelf) Available 24093

Includes index.

Part I. Iterative Algorithms and Loop Invariants: 1. Measures of progress and loop invariants; 2. Examples using more of the input loop invariant; 3. Abstract data types; 4. Narrowing the search space: binary search; 5. Iterative sorting algorithms; 6. Euclid's GCD algorithm; 7. The loop invariant for lower bounds; Part II. Recursion: 8. Abstractions, techniques, and theory; 9. Some simple examples of recursive algorithms; 10. Recursion on trees; 11. Recursive images; 12. Parsing with context-free grammars; Part III. Optimization Problems: 13. Definition of optimization problems; 14. Graph search algorithms; 15. Network flows and linear programming; 16. Greedy algorithms; 17. Recursive backtracking; 18. Dynamic programming algorithms; 19. Examples of dynamic programming; 20. Reductions and NP-completeness; 21. Randomized algorithms; Part IV. Appendix: 22. Existential and universal quantifiers; 23. Time complexity; 24. Logarithms and exponentials; 25. Asymptotic growth; 26. Adding made easy approximations; 27. Recurrence relations; 28. A formal proof of correctness; Part V. Exercise Solutions.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha