Rating:
(41 reviews)
Author: Sanjoy Dasgupta
ISBN : 0073523402
New from $39.84
Format: PDF
Download file now Free Algorithms [Paperback] for everyone book mediafire, rapishare, and mirror link
This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal.
Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated.
Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence.
An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center.
"Algorithms is an outstanding undergraduate text, equally informed by the historical roots and contemporary applications of its subject. Like a captivating novel, it is a joy to read." Tim Roughgarden Stanford University
Direct download links available for Free Algorithms [Paperback]
- Paperback: 336 pages
- Publisher: McGraw-Hill Science/Engineering/Math; 1 edition (September 13, 2006)
- Language: English
- ISBN-10: 0073523402
- ISBN-13: 978-0073523408
- Product Dimensions: 0.5 x 7.2 x 9 inches
- Shipping Weight: 1 pounds (View shipping rates and policies)
Free Algorithms
One of the most appealing characteristics of this book is the small size. Textbooks in algorithms are similar to those of other fields in that they have continued to increase in girth over the years. At 320 pages, this book is a relative midget.
However, that does not in any way mean that it is weak in content, there is plenty of material for a one-semester course in algorithms. The chapters are:
*) Prologue - a bit of history and the big-O notation
*) Algorithms with numbers - basic and modular arithmetic, primality testing and cryptography
*) Divide-and-conquer algorithms - multiplication, recurrence relations, mergesort, matrix multiplication and the Fast Fourier Transform (FFT).
*) Decomposition of graphs - the fundamental definition of directed and undirected graphs and performing depth-first searches.
*) Paths in graphs- basic algorithms used in graph searches
*) Greedy algorithms - some fundamental greedy algorithms and their basic level of performance
*) Dynamic programming - shortest paths, knapsack optimization and independent sets in trees
*) Linear programming and reductions - the definition of linear programming and some of the standard problems that it can be used to solve
*) NP-complete problems - definition of NP-complete, some examples and reduction strategies used to show NP equivalence
*) Coping with NP-completeness - intelligent search, approximation and random algorithms
*) Quantum algorithms - a brief foray into a possible revolution in computing. Explanations of how data may be stored and processed at the quantum level.
The explanations are brief yet thorough enough for advanced computer science students, the algorithms are presented in a generic pseudocode.
-
Download Link 2