The CS Detective : An Algorithmic Tale of Crime, Conspiracy, and Computation. This item is unavailable.
114 ratings by Goodreads
Language: English
Published by No Starch Press, Incorporated, 2016
- First Edition
- Softcover
- Used
Seller: Better World Books: West, Reno, NV, U.S.A.Better World Books: West
5-star seller
AbeBooks seller since March 14, 2016
Unavailable
Softcover
Condition: Used - Very good
US$ 7.60
Item description from seller
Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.
Seller Inventory # 10789360-6
- Title
- The CS Detective : An Algorithmic Tale of Crime, Conspiracy, and Computation
- Author
- Kubica, Jeremy
- Publisher
- No Starch Press, Incorporated
- Publication year
- 2016
- Condition
- Very Good
- Binding
- Soft cover
- Language
- English
- ISBN 10
- 1593277490
- ISBN 13
- 9781593277499
- Edition
- 1st Edition.
- Item weight
- 0.939 pounds
- Dimensions
- N/A
Meet Frank Runtime. Disgraced ex-detective. Hard-boiled private eye. Search expert.
When a robbery hits police headquarters, it’s up to Frank Runtime and his extensive search skills to catch the culprits. In this detective story, you’ll learn how to use algorithmic tools to solve the case. Runtime scours smugglers’ boats with binary search, tails spies with a search tree, escapes a prison with depth-first search, and picks locks with priority queues. Joined by know-it-all rookie Officer Notation and inept tag-along Socks, he follows a series of leads in a best-first search that unravels a deep conspiracy. Each chapter introduces a thrilling twist matched with a new algorithmic concept, ending with a technical recap.
Perfect for computer science students and amateur sleuths alike, The CS Detective adds an entertaining twist to learning algorithms.
Follow Frank’s mission and learn:
–The algorithms behind best-first and depth-first search, iterative deepening, parallelizing, binary search, and more
–Basic computational concepts like strings, arrays, stacks, and queues
–How to adapt search algorithms to unusual data structures
–The most efficient algorithms to use in a given situation, and when to apply common-sense heuristic methods
When a robbery hits police headquarters, it’s up to Frank Runtime and his extensive search skills to catch the culprits. In this detective story, you’ll learn how to use algorithmic tools to solve the case. Runtime scours smugglers’ boats with binary search, tails spies with a search tree, escapes a prison with depth-first search, and picks locks with priority queues. Joined by know-it-all rookie Officer Notation and inept tag-along Socks, he follows a series of leads in a best-first search that unravels a deep conspiracy. Each chapter introduces a thrilling twist matched with a new algorithmic concept, ending with a technical recap.
Perfect for computer science students and amateur sleuths alike, The CS Detective adds an entertaining twist to learning algorithms.
Follow Frank’s mission and learn:
–The algorithms behind best-first and depth-first search, iterative deepening, parallelizing, binary search, and more
–Basic computational concepts like strings, arrays, stacks, and queues
–How to adapt search algorithms to unusual data structures
–The most efficient algorithms to use in a given situation, and when to apply common-sense heuristic methods
"Synopsis" may belong to another edition of this title.
About the Author
Jeremy Kubica is a principal engineer at Google working on machine learning and algorithms. He has a PhD in robotics from Carnegie Mellon University and a BS in computer science from Cornell University. Kubica is the author of the popular Computational Fairy Tales blog.
"About the title" may belong to another edition of this title.