How to Think About Algorithms free download online

Title: How to Think About Algorithms
Author(s): Jeff Edmonds
Pages: 472
Publisher: Cambridge University Press; 1 edition
Publication date: 2008
Language: English
Format: PDF
ISBN-10: 0521849314
ISBN-13:
Description: There are many algorithm texts that provide lots of well-polished code and proofs of correctness. This book is not one of them. Instead, this book presents insights, notations, and analogies to help the novice describe and think about algorithms like an expert. By looking at both the big picture and easy step-by-step methods for developing algorithms, the author helps students avoid the common pitfalls. He stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. Part of the goal is to teach the students to think abstractly. Without getting bogged with formal proofs, the book fosters a deeper understanding of how and why each algorithm works. These insights are presented in a slow and clear manner accessible to second- or third-year students of computer science, preparing them to find their own innovative ways to solve problems. Rather than provide lots of well-polished code and proofs of correctness, this book presents insights, notations, and analogies to help the novice describe and think about algorithms like an expert. It stresses paradigms such as loop invariants and recursion to unify a huge range of algorithms into a few meta-algorithms. About the Author 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.

How to Think About Algorithms free download links:

Link type	Link	Password
Mirror	http://mihd.net/hp2bito	www.freebookspot.com
Mirror	http://www.paid4share.net/file/8965/9780521849319-0521849314-rar.html
Mirror	http://www.file2box.com/stg1qvvkj52m	www.freebookspot.com
Mirror	http://hotfile.com/dl/14293390/5a103a0/138A6A42-4078-4821-BCA9-276BAF3A7A9F.rar.html	www.freebookspot.com