menu
{ "item_title" : "Intro Anal Algorithms (2nd Ed)", "item_author" : [" Soltys Michael "], "item_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.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/9/81/440/115/9814401153_b.jpg", "price_data" : { "retail_price" : "65.00", "online_price" : "65.00", "our_price" : "65.00", "club_price" : "65.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Intro Anal Algorithms (2nd Ed)|Soltys Michael

Intro Anal Algorithms (2nd Ed)

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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.

This item is Non-Returnable

Details

  • ISBN-13: 9789814401159
  • ISBN-10: 9814401153
  • Publisher: World Scientific Publishing Company
  • Publish Date: July 2012
  • Dimensions: 9 x 6 x 0.7 inches
  • Shipping Weight: 0.9 pounds
  • Page Count: 212

Related Categories

You May Also Like...

    1

BAM Customer Reviews