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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Jeff Edmonds is Professor in the Department of Electrical Engineering and Computer Science at York University, Canada.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
EUR 12,31 expédition depuis Etats-Unis vers France
Destinations, frais et délaisEUR 4,62 expédition depuis Royaume-Uni vers France
Destinations, frais et délaisVendeur : Books From California, Simi Valley, CA, Etats-Unis
paperback. Etat : Good. Cover/edges are worn and or have small tears, otherwise good reading copy. N° de réf. du vendeur mon0003800946
Quantité disponible : 1 disponible(s)
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
paperback. Etat : Very Good. N° de réf. du vendeur mon0003610900
Quantité disponible : 1 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9781009302135_new
Quantité disponible : 12 disponible(s)
Vendeur : Speedyhen, London, Royaume-Uni
Etat : NEW. N° de réf. du vendeur NW9781009302135
Quantité disponible : 2 disponible(s)
Vendeur : PBShop.store UK, Fairford, GLOS, Royaume-Uni
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur FM-9781009302135
Quantité disponible : 15 disponible(s)
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
Etat : New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. N° de réf. du vendeur ABNR-282379
Quantité disponible : 1 disponible(s)
Vendeur : PBShop.store US, Wood Dale, IL, Etats-Unis
PAP. Etat : New. New Book. Shipped from UK. Established seller since 2000. N° de réf. du vendeur L2-9781009302135
Quantité disponible : 10 disponible(s)
Vendeur : Wegmann1855, Zwiesel, Allemagne
Taschenbuch. Etat : Neu. 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'--. N° de réf. du vendeur 9781009302135
Quantité disponible : 1 disponible(s)
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEJUNE24-372357
Quantité disponible : 4 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. 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'-- 500 pp. Englisch. N° de réf. du vendeur 9781009302135
Quantité disponible : 1 disponible(s)