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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Jeff Edmonds received his Ph.D. in 1992 at University of Toronto in theoretical computer science. His thesis proved that certain computation problems require a given amount of time and space. He did his postdoctorate work at the ICSI in Berkeley on secure multi-media data transmission and in 1995 became an Associate Professor in the Department of Computer Science at York University, Canada. He has taught their algorithms course thirteen times to date. He has worked extensively at IIT Mumbai, India, and University of California San Diego. He is well published in the top theoretical computer science journals in topics including complexity theory, scheduling, proof systems, probability theory, combinatorics, and, of course, algorithms.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : World of Books (was SecondSale), Montgomery, IL, Etats-Unis
Etat : Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. N° de réf. du vendeur 00095906578
Quantité disponible : 1 disponible(s)
Vendeur : Greenworld Books, Arlington, TX, Etats-Unis
Etat : good. Fast Free Shipping â" Good condition book with a firm cover and clean, readable pages. Shows normal use, including some light wear or limited notes highlighting, yet remains a dependable copy overall. Supplemental items like CDs or access codes may not be included. N° de réf. du vendeur GWV.0521614104.G
Quantité disponible : 1 disponible(s)
Vendeur : HPB-Red, Dallas, TX, Etats-Unis
Paperback. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! N° de réf. du vendeur S_446480379
Quantité disponible : 1 disponible(s)
Vendeur : ThriftBooks-Atlanta, AUSTELL, GA, Etats-Unis
Paperback. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less. N° de réf. du vendeur G0521614104I4N00
Quantité disponible : 1 disponible(s)
Vendeur : ThriftBooks-Atlanta, AUSTELL, GA, Etats-Unis
Paperback. Etat : Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. N° de réf. du vendeur G0521614104I3N00
Quantité disponible : 1 disponible(s)
Vendeur : Better World Books, Mishawaka, IN, Etats-Unis
Etat : Good. Used book that is in clean, average condition without any missing pages. N° de réf. du vendeur 38641210-20
Quantité disponible : 1 disponible(s)
Vendeur : Anybook.com, Lincoln, Royaume-Uni
Etat : Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,850grams, ISBN:9780521614108. N° de réf. du vendeur 3718274
Quantité disponible : 1 disponible(s)
Vendeur : WorldofBooks, Goring-By-Sea, WS, Royaume-Uni
Paperback. Etat : Very Good. 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. The book has been read, but is in excellent condition. Pages are intact and not marred by notes or highlighting. The spine remains undamaged. N° de réf. du vendeur GOR013575712
Quantité disponible : 2 disponible(s)
Vendeur : Anybook.com, Lincoln, Royaume-Uni
Etat : Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,850grams, ISBN:9780521614108. N° de réf. du vendeur 5828087
Quantité disponible : 1 disponible(s)
Vendeur : Toscana Books, AUSTIN, TX, Etats-Unis
Paperback. Etat : new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. N° de réf. du vendeur Scanned0521614104
Quantité disponible : 1 disponible(s)