How to Think about Algorithms (Record no. 2490)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02864nam a22002057a 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | OSt |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200224112635.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 200118b ||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 978-1-107-439887 |
| 028 ## - PUBLISHER NUMBER | |
| Source | Allied Informatics, Jaipur |
| Bill Number | 7084 |
| Bill Date | 13/01/2020 |
| Purchase Year | 2019-20 |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | BSDU |
| Language of cataloging | English |
| Transcribing agency | BSDU |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 518.1 |
| Item number | EDM |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Edmonds,Jeff |
| 245 ## - TITLE STATEMENT | |
| Title | How to Think about Algorithms |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. | |
| Place of publication, distribution, etc. | New Delhi |
| Name of publisher, distributor, etc. | Cambridge University Press |
| Date of publication, distribution, etc. | 2019 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 448 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE | |
| Bibliography, etc. note | This textbook, for second- or third-year students of computer science, presents insights, notations, and analogies to help them describe and think about algorithms like an expert, without grinding through lots of formal proof. Solutions to many problems are provided to let students check their progress, while class-tested PowerPoint slides are on the web for anyone running the course. By looking at both the big picture and easy step-by-step methods for developing algorithms, the author guides students around the common pitfalls. He stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. The book fosters a deeper understanding of how and why each algorithm works. These insights are presented in a careful and clear way, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems.<br/><br/>Includes lots of exercises, with selected solutions in the text; PowerPoint slides for instructors available from the web<br/>Presents the big picture and step-by-step methods for developing algorithms, while avoiding common pitfalls<br/>Appendices give background on big-O notation, logic, asymptotics, and other mathematical tools<br/><br/>Part I. Iterative Algorithms and Loop Invariants:<br/>1. Measures of progress and loop invariants<br/>2. Examples using more of the input loop invariant<br/>3. Abstract data types<br/>4. Narrowing the search space: binary search<br/>5. Iterative sorting algorithms<br/>6. Euclid's GCD algorithm<br/>7. The loop invariant for lower bounds<br/>Part II. Recursion:<br/>8. Abstractions, techniques, and theory<br/>9. Some simple examples of recursive algorithms<br/>10. Recursion on trees<br/>11. Recursive images<br/>12. Parsing with context-free grammars<br/>Part III. Optimization Problems:<br/>13. Definition of optimization problems<br/>14. Graph search algorithms<br/>15. Network flows and linear programming<br/>16. Greedy algorithms<br/>17. Recursive backtracking<br/>18. Dynamic programming algorithms<br/>19. Examples of dynamic programming<br/>20. Reductions and NP-completeness<br/>21. Randomized algorithms<br/>Part IV. Appendix:<br/>22. Existential and universal quantifiers<br/>23. Time complexity<br/>24. Logarithms and exponentials<br/>25. Asymptotic growth<br/>26. Adding made easy approximations<br/>27. Recurrence relations<br/>28. A formal proof of correctness |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Algorithms |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Dewey Decimal Classification |
| Koha item type | Books |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Home library | Current library | Shelving location | Date acquired | Cost, normal purchase price | Total Checkouts | Full call number | Barcode | Date last seen | Cost, replacement price | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dewey Decimal Classification | BSDU Knowledge Resource Center, Jaipur | BSDU Knowledge Resource Center, Jaipur | General Stacks | 01/18/2020 | 795.00 | 518.1 EDM | 018037 | 02/12/2020 | 795.00 | 01/18/2020 | Books |