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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: ThriftBooks-Dallas, Dallas, TX, Estados Unidos de America
Paperback. Condición: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Nº de ref. del artículo: G0521614104I3N00
Cantidad disponible: 1 disponibles
Librería: World of Books (was SecondSale), Montgomery, IL, Estados Unidos de America
Paperback. Condición: 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. Nº de ref. del artículo: 00108990371
Cantidad disponible: 1 disponibles
Librería: World of Books (was SecondSale), Montgomery, IL, Estados Unidos de America
Paperback. Condición: 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. Nº de ref. del artículo: 00105383107
Cantidad disponible: 2 disponibles
Librería: HPB-Red, Dallas, TX, Estados Unidos de America
Paperback. Condición: 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 ref. del artículo: S_446480379
Cantidad disponible: 1 disponibles
Librería: Better World Books, Mishawaka, IN, Estados Unidos de America
Condición: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Nº de ref. del artículo: 38641210-20
Cantidad disponible: 1 disponibles
Librería: World of Books Inc, Montgomery, IL, Estados Unidos de America
Paperback. Condición: 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. Nº de ref. del artículo: CIN0521614104G
Cantidad disponible: 1 disponibles
Librería: World of Books Inc, Montgomery, IL, Estados Unidos de America
Paperback. Condición: 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. Nº de ref. del artículo: CIN0521614104VG
Cantidad disponible: 2 disponibles
Librería: Better World Books Ltd, Dunfermline, Reino Unido
Condición: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Nº de ref. del artículo: 15605552-20
Cantidad disponible: 1 disponibles
Librería: Affordable Collectibles, Columbia, MO, Estados Unidos de America
Paperback. Condición: Good. X_Library copy with minimal use. Only one check out date listed. A very nice clean copy. Nº de ref. del artículo: 26070420
Cantidad disponible: 1 disponibles
Librería: Anybook.com, Lincoln, Reino Unido
Condición: 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 ref. del artículo: 3718274
Cantidad disponible: 1 disponibles