How to Think about Algorithms (Record no. 23505)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01847cam a2200217 a 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 080110s2008 enka 001 0 eng |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9780521614108 (pbk) |
| 041 ## - LANGUAGE CODE | |
| Language code of text/sound track or separate title | eng |
| 080 ## - UNIVERSAL DECIMAL CLASSIFICATION NUMBER | |
| Universal Decimal Classification number | 510.6 |
| Item number | EDM |
| 100 1# - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Edmonds, Jeff |
| 245 10 - TITLE STATEMENT | |
| Title | How to Think about Algorithms |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | New York |
| Name of publisher | Cambridge University Press |
| Year of publication | 2008 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | xiii, 448p |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Iterative algorithms: measures of progress and loop invariants<br/>Examples using more-of-the-input loop invariants<br/>Abstract data types<br/>Narrowing the search space: binary search<br/>Iterative sorting algorithms<br/>Euclid's GCD algorithm<br/>The loop invariant for lower bounds<br/>Abstractions, techniques, and theory<br/>Some simple examples of recursive algorithms<br/>Recursion on trees<br/>Recursive images<br/>Parsing with context-free grammars<br/>Definition of optimization problems<br/>Graph search algorithms<br/>Network flows and linear programming<br/>Greedy algorithms<br/>Recursive backtracking<br/>Dynamic programming algorithms<br/>Examples of dynamic programs<br/>Reductions and NP-completeness<br/>Randomized algorithms<br/>Existential and universal quantifiers<br/>Time complexity<br/>Logarithms and exponentials<br/>Asymptotic growth<br/>Adding-made-easy approximations<br/>Recurrence relations<br/>A formal proof of correctness |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | "This book presents insights, notations, and analogies to help the novice describe and think about algorithms like an expert. Jeff Edmonds provides both the big picture and easy step-by-step methods for developing algorithms, while avoiding the common pitfalls. Paradigms such as loop invariants and recursion help to unify a huge range of algorithms into a few meta-algorithms. Part of the goal is to teach the students to think abstractly."--Jacket |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Algorithms |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Invariants |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | Recursion theory |
| 690 ## - LOCAL SUBJECT ADDED ENTRY--TOPICAL TERM (OCLC, RLIN) | |
| Topical term or geographic name as entry element | Mathematics |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | BOOKS |
| Withdrawn status | Lost status | Damaged status | Not for loan | Home library | Current library | Shelving location | Full call number | Accession Number | Koha item type |
|---|---|---|---|---|---|---|---|---|---|
| IMSc Library | IMSc Library | First Floor, Rack No: 28, Shelf No: 1 | 510.6 EDM | 61279 | BOOKS |