How to think about Algorithms (Record no. 295707)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02306nam a2200157Ia 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780521614108 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 518.1 EDM-H |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Jeff Edmonds |
| 245 ## - TITLE STATEMENT | |
| Title | How to think about Algorithms |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Place of publication, distribution, etc. | Cambridge ; New York |
| Name of publisher, distributor, etc. | Cambridge University Press |
| Date of publication, distribution, etc. | 2008 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xiii, 448 pages : illustrations ; 25 cm |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Iterative algorithms: measures of progress and loop invariants -- Examples using more-of-the-input loop invariants -- Abstract data types -- Narrowing the search space: binary search -- Iterative sorting algorithms -- Euclid's GCD algorithm -- The loop invariant for lower bounds -- Abstractions, techniques, and theory -- Some simple examples of recursive algorithms -- Recursion on trees -- Recursive images -- Parsing with context-free grammars -- Definition of optimization problems -- Graph search algorithms -- Network flows and linear programming -- Greedy algorithms -- Recursive backtracking -- Dynamic programming algorithms -- Examples of dynamic programs -- Reductions and NP-completeness -- Randomized algorithms -- Existential and universal quantifiers -- Time complexity -- Logarithms and exponentials -- Asymptotic growth -- Adding-made-easy approximations -- Recurrence relations -- A formal proof of correctness. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | There are many algorithm texts that provide lots of well-polished code and proofs of correctness. This book is not one of them. Instead, this book presents insights, notations, and analogies to help the novice describe and think about algorithms like an expert. By looking at both the big picture and easy step-by-step methods for developing algorithms, the author helps students avoid the common pitfalls. He stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. Part of the goal is to teach the students to think abstractly. Without getting bogged with formal proofs, the book fosters a deeper understanding of how and why each algorithm works. These insights are presented in a slow and clear manner accessible to second- or third-year students of computer science, preparing them to find their own innovative ways to solve problems. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Study and teaching, Invariants, Algorithms, Loops (Group theory), Recursion theory |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | Book |
| Withdrawn status | Lost status | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Total Checkouts | Full call number | Barcode | Date last seen | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dept. of Computational Biology and Bioinformatics | Dept. of Computational Biology and Bioinformatics | Processing Center | 01/09/2015 | 518/.1 EDM-H | DCB2547 | 17/01/2024 | 01/09/2015 | Book |