How to Think about Algorithms

Jeff Edmonds

ISBN 10: 1009302132 / ISBN 13: 9781009302135

Edité par Cambridge University Pr. Feb 2024, 2024

A propos de cet article

Neuware -'The second edition of this student-friendly textbook now includes over 150 new exercises, key concept summaries and a chapter on machine learning algorithms. Its approachability and clarity make it ideal as both a main course text or as a supplementary book for students who find other books challenging'--Libri GmbH, Europaallee 1, 36244 Bad Hersfeld 500 pp. Englisch.

N° de réf. du vendeur 9781009302135

Détails bibliographiques

• Titre: How to Think about Algorithms
• Éditeur: Cambridge University Pr. Feb 2024
• Date de parution: 2024
• Langue: anglais
• ISBN à 10 chiffres: 1009302132
• ISBN à 13 chiffres: 9781009302135
• Reliure: Taschenbuch
• Édition: 2ème Édition
• État de l'article: Neu

A propos de ce titre

Synopsis

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.

À propos de l?auteur

Jeff Edmonds is Professor in the Department of Electrical Engineering and Computer Science at York University, Canada.