Introduction to the Analysis of Algorithms, an (2nd Edition) by Michael Soltys (PDF)

19

 

Ebook Info

  • Published: 2012
  • Number of pages: 214 pages
  • Format: PDF
  • File Size: 1.73 MB
  • Authors: Michael Soltys

Description

A successor to the first edition, this updated and revised book is a great companion guide for students and engineers alike, specifically software engineers who design reliable code. While succinct, this edition is mathematically rigorous, covering the foundations of both computer scientists and mathematicians with interest in algorithms.Besides covering the traditional algorithms of Computer Science such as Greedy, Dynamic Programming and Divide & Conquer, this edition goes further by exploring two classes of algorithms that are often overlooked: Randomised and Online algorithms — with emphasis placed on the algorithm itself. The coverage of both fields are timely as the ubiquity of Randomised algorithms are expressed through the emergence of cryptography while Online algorithms are essential in numerous fields as diverse as operating systems and stock market predictions.While being relatively short to ensure the essentiality of content, a strong focus has been placed on self-containment, introducing the idea of pre/post-conditions and loop invariants to readers of all backgrounds. Containing programming exercises in Python, solutions will also be placed on the book’s website.

User’s Reviews

Editorial Reviews: From the Back Cover A successor to the first edition, this updated and revised book is a great companion guide for students and engineers alike, specifically software engineers who design reliable code. While succinct, this edition is mathematically rigorous, covering the foundations of both computer scientists and mathematicians with interest in algorithms. Besides covering the traditional algorithms of Computer Science such as Greedy, Dynamic Programming and Divide & Conquer, this edition goes further by exploring two classes of algorithms that are often overlooked: Randomised and Online algorithms with emphasis placed on the algorithm itself. The coverage of both fields are timely as the ubiquity of Randomised algorithms are expressed through the emergence of cryptography while Online algorithms are essential in numerous fields as diverse as operating systems and stock market predictions. While being relatively short to ensure the essentiality of content, a strong focus has been placed on self-containment, introducing the idea of pre/post-conditions and loop invariants to readers of all backgrounds. Containing programming exercises in Python, solutions will also be placed on the book’s website.

Reviews from Amazon users which were colected at the time this book was published on the website:

Keywords

Free Download Introduction to the Analysis of Algorithms, an (2nd Edition) in PDF format
Introduction to the Analysis of Algorithms, an (2nd Edition) PDF Free Download
Download Introduction to the Analysis of Algorithms, an (2nd Edition) 2012 PDF Free
Introduction to the Analysis of Algorithms, an (2nd Edition) 2012 PDF Free Download
Download Introduction to the Analysis of Algorithms, an (2nd Edition) PDF
Free Download Ebook Introduction to the Analysis of Algorithms, an (2nd Edition)

Previous articleComplex Semisimple Lie Algebras by Jean-Pierre Serre (PDF)
Next articleFunctional Analysis: An Introduction (Graduate Studies in Mathematics) by Yuli Eidelman (PDF)