How to think about algorithms / (Record no. 45910)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04711nam a22003971i 4500 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | UkCbUP |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20251013122913.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 220511s2023||||enk o ||1 0|eng|d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9781009302180 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| Cancelled/invalid ISBN | 9781009302142 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| Cancelled/invalid ISBN | 9781009302135 |
| 041 ## - LANGUAGE CODE | |
| Language | English |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 518.1 |
| Edition number | 23/eng20230722 |
| Item number | EDM |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Edmonds, Jeff, |
| 245 10 - TITLE STATEMENT | |
| Title | How to think about algorithms / |
| Statement of responsibility, etc | Jeff Edmonds. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | Second edition. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Name of publisher, distributor, etc | Cambridge, |
| Date of publication, distribution, etc | 2024. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | xv, 599 pages : |
| Other physical details | ill. ; |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Title | Frontmatter <br/>Introduction<br/><br/>pp 1-2<br/>Part I - Iterative Algorithms and Loop Invariants<br/><br/>pp 3-4<br/>1 - Iterative Algorithms: Measures of Progress and Loop Invariants<br/><br/>pp 5-32<br/>2 - Examples Using More-of-the-Input Loop Invariants<br/><br/>pp 33-46<br/>3 - Abstract Data Types<br/><br/>pp 47-63<br/>4 - Narrowing the Search Space: Binary Search<br/><br/>pp 64-73<br/>5 - Iterative Sorting Algorithms<br/><br/>pp 74-79<br/>6 - More Iterative Algorithms<br/><br/>pp 80-87<br/>7 - The Loop Invariant for Lower Bounds<br/><br/>pp 88-96<br/>8 - Key Concepts Summary: Loop Invariants and Iterative Algorithms<br/><br/>pp 97-101<br/>9 - Additional Exercises: Part I<br/><br/>pp 102-123<br/>10 - Partial Solutions to Additional Exercises: Part I<br/><br/>pp 124-130<br/>Part II - Recursion<br/><br/>pp 131-132<br/>11 - Abstractions, Techniques, and Theory<br/><br/>pp 133-148<br/>12 - Some Simple Examples of Recursive Algorithms<br/><br/>pp 149-168<br/>13 - Recursion on Trees<br/><br/>pp 169-191<br/>14 - Recursive Images<br/><br/>pp 192-197<br/>15 - Parsing with Context-Free Grammars<br/><br/>pp 198-207<br/>16 - Key Concepts Summary: Recursion<br/><br/>pp 208-210<br/>17 - Additional Exercises: Part II<br/><br/>pp 211-229<br/>18 - Partial Solutions to Additional Exercises: Part II<br/><br/>pp 230-238<br/>Part III - Optimization Problems<br/><br/>pp 239-240<br/>19 - Definition of Optimization Problems<br/><br/>pp 241-242<br/>20 - Graph Search Algorithms<br/><br/>pp 243-267<br/>21 - Network Flows and Linear Programming<br/><br/>pp 268-293<br/>22 - Greedy Algorithms<br/><br/>pp 294-320<br/>23 - Recursive Backtracking<br/><br/>pp 321-335<br/>24 - Dynamic Programming Algorithms<br/><br/>pp 336-374<br/>25 - Designing Dynamic Programming Algorithms via Reductions<br/><br/>pp 375-379<br/>26 - The Game of Life<br/><br/>pp 380-389<br/>27 - Solution Is a Tree<br/><br/>pp 390-401<br/>28 - Reductions and NP-Completeness<br/><br/>pp 402-422<br/>29 - Randomized Algorithms<br/><br/>pp 423-430<br/>30 - Machine Learning<br/><br/>pp 431-438<br/>31 - Key Concepts Summary: Greedy Algorithms and Dynamic Programming<br/><br/>pp 439-453<br/>32 - Additional Exercises: Part III<br/><br/>pp 454-481<br/>33 - Partial Solutions to Additional Exercises: Part III<br/><br/>pp 482-496<br/>Part IV - Additional Topics<br/><br/>pp 497-498<br/>34 - Existential and Universal Quantifiers<br/><br/>pp 499-507<br/>35 - Time Complexity<br/><br/>pp 508-514<br/>36 - Logarithms and Exponentials<br/><br/>pp 515-517<br/>37 - Asymptotic Growth<br/><br/>pp 518-528<br/>38 - Adding-Made-Easy Approximations<br/><br/>pp 529-539<br/>39 - Recurrence Relations<br/><br/>pp 540-548<br/>40 - A Formal Proof of Correctness<br/><br/>pp 549-550<br/>41 - Additional Exercises: Part IV<br/><br/>pp 551-555<br/>42 - Partial Solutions to Additional Exercises: Part IV<br/><br/>pp 556-560<br/>Exercise Solutions<br/><br/>pp 561-587<br/>Conclusion<br/><br/>pp 588-588<br/>Index<br/><br/>pp 589-600 |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | Understand algorithms and their design with this revised student-friendly textbook. Unlike other algorithms books, this one is approachable, the methods it explains are straightforward, and the insights it provides are numerous and valuable. Without grinding through lots of formal proof, students will benefit from step-by-step methods for developing algorithms, expert guidance on common pitfalls, and an appreciation of the bigger picture. Revised and updated, this second edition includes a new chapter on machine learning algorithms, and concise key concept summaries at the end of each part for quick reference. Also new to this edition are more than 150 new exercises: selected solutions are included to let students check their progress, while a full solutions manual is available online for instructors. No other text explains complex topics such as loop invariants as clearly, helping students to think abstractly and preparing them for creating their own innovative ways to solve problems. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Loops (Group theory) |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Invariants |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Recursion theory |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://ezproxy.lib.gla.ac.uk/login?url=https://www.cambridge.org/core/product/identifier/9781009302180/type/BOOK">https://ezproxy.lib.gla.ac.uk/login?url=https://www.cambridge.org/core/product/identifier/9781009302180/type/BOOK</a> |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Source of classification or shelving scheme | Dewey Decimal Classification |
| Koha item type | General Books |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Dates associated with a name | 1963- |
| Relator term | author. |
| 506 ## - RESTRICTIONS ON ACCESS NOTE | |
| Terms governing access | Access restricted to subscribing institutions. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| General subdivision | Study and teaching. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| General subdivision | Study and teaching. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| General subdivision | Study and teaching. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| General subdivision | Study and teaching. |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Display text | Print version: |
| International Standard Book Number | 9781009302142. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Public note | Connect to resource |
| 907 ## - LOCAL DATA ELEMENT G, LDG (RLIN) | |
| a | .b41978730 |
| Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection code | Home library | Location | Shelving location | Date of Cataloging | Total Checkouts | Full call number | Barcode | Date last seen | Price effective from | Koha item type |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dewey Decimal Classification | Non-fiction | CUTN Central Library | CUTN Central Library | Sciences | 13/10/2025 | 518.1 EDM | 54565 | 13/10/2025 | 13/10/2025 | General Books |