How to think about algorithms / (Record no. 93505)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01617nam a22002057a 4500 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20250522125206.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 250522b2024 |||||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9781009302135 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 518.1 EDM-J |
| 100 ## - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Edmonds, Jeff |
| 245 ## - TITLE STATEMENT | |
| Title | How to think about algorithms / |
| Statement of responsibility, etc. | Jeff Edmonds |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 2nd ed. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication, distribution, etc. | India |
| Name of publisher, distributor, etc. | Cambridge University Press |
| Date of publication, distribution, etc. | 2024 |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 599 p. |
| 500 ## - GENERAL NOTE | |
| General note | 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 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Algorithms - study and teaching |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Loops (Group theory) - study and teaching |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Invariants - study and teaching |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name as entry element | Recursion theory Study and teaching |
| 952 ## - LOCATION AND ITEM INFORMATION (KOHA) | |
| Withdrawn status | |
| Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection code | Home library | Current library | Shelving location | Date acquired | Total Checkouts | Full call number | Barcode | Date last seen | Price effective from | Koha item type | Public note |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dewey Decimal Classification | 510 | BITS Pilani Hyderabad | BITS Pilani Hyderabad | New Book Display (Welcome to Reserve) | 31/03/2025 | 518.1 EDM-J | 49921 | 22/05/2025 | 22/05/2025 | New books on display | Display - 10 |