The CS Detective

Jeremy Kubica

$39.99

Paperback

Not in-store but you can order this
How long will it take?

Availability Information

We source books from suppliers in Australia and overseas. For books we don't currently have in stock, the time it takes to get them from our suppliers can vary widely - from a few days to a few months - so we check each book with each supplier to determine the expected time it will take to be supplied to us.

We then advise you accordingly. If the time taken to get any book is too long for you, you can let us know and we will cancel or adjust your order, and refund as required.

To find out the anticipated arrival time for specific items prior to ordering, please contact us by phone or email:

Phone +61 2 9264 3111, or 1800 4 BOOKS (1800 4 26657) if outside Sydney:
option 1 Abbey's Bookshop (Crime, History, Science, Kids & more) • info@abbeys.com.au
option 2 Language Book Centre (ESL & Foreign Languages) • language@abbeys.com.au
option 3 Galaxy Bookshop (Sci-fi, Fantasy, Romance, Graphic Novels) • sf@galaxybooks.com.au

QTY:

English

No Starch Press,US
01 August 2017

Mathematics & Sciences; Databases

The CS Detective is a fantasy whodunit for the digital age that introduces the concepts behind search algorithms and important data structures.

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

By: Jeremy Kubica
Imprint: No Starch Press,US
Country of Publication: United States
Dimensions: Height: 228mm, Width: 152mm, Spine: 16mm
Weight: 420g
ISBN: 9781593277499
ISBN 10: 1593277490
Pages: 256
Publication Date: 01 August 2017
Recommended Age: From 12 years
Audience: College/higher education , Professional and scholarly , Primary , Undergraduate
Format: Paperback
Publisher's Status: Active

Acknowledgments A Note to Readers Chapter 1: Search Problems Chapter 2: Exhaustive Search for an Informant Chapter 3: Arrays and Indexes on a Criminal's Farm Chapter 4: Strings and Hidden Messages Chapter 5: Binary Search for a Smuggler's Ship Chapter 6: Binary Search for Clues Chapter 7: Adapting Algorithms for a Daring Escape Chapter 8: Socks: An Interlude and an Introduction Chapter 9: Backtracking to Keep the Search Going Chapter 10: Picking Locks with Breadth-First Search Chapter 11: Depth-First Search in an Abandoned Prison Chapter 12: Cafeteria Stacks and Queues Chapter 13: Stacks and Queues for Search Chapter 14: Let's Split Up: Parallelized Search Chapter 15: Iterative Deepening Can Save Your Life Chapter 16: Inverted Indexes: The Search Narrows Chapter 17: A Binary Search Tree Trap Chapter 18: Building Binary Search Ladders Chapter 19: Binary Search Trees for Suspects Chapter 20: Adding Suspects to the Search Tree Chapter 21: The Binary Search Tree Property Chapter 22: Tries for Paperwork Chapter 23: Best-First Search: A Detective's Most Trusted Tool Chapter 24: Priority Queues for Investigations Chapter 25: Priority Queues for Lock Picking Chapter 26: Heuristics in Search Chapter 27: Heaps in Politics and Academia Chapter 28: Difficult Search Problems Chapter 29: Search Termination Epilogue

Jeremy Kubica is a principal engineer at Google working on machine learning and algorithms, with a PhD in robotics from Carnegie Mellon University and a B.S. in computer science from Cornell. Kubica is the author of the popular Computational Fairy Tales blog.

Reviews for The CS Detective

“This book is both entertaining and educational, and a great stocking stuffer, especially for anyone involved with data analysis.” —The Vancouver Sun “A great introduction for older kids or adults to the concepts contained therein. The story is filled with humor and adventure.” —Geek Dad “Exceptionally well written, organized and presented...truly adds an entertaining and novel twist to making the learning algorithms fun, practical, and effective.” —Midwest Book Review “I love being able to wrap learning into this story and that it doesn’t seem like learning at all. This book is perfect for computer science students or amateur sleuths who enjoy a good mystery.” —The Old Schoolhouse “I give this book 10 out of 10 horseshoes.” —CodeRanch “Good wizards and evil wizards cast spells, which helps capture the interest of students in the upper middle and lower high school grades...The story is worth the time to learn about different binary searches.” —National Council of Teachers of Mathematics “I think the book would be good for high school–college level students interested in search algorithms or computer science in general. I enjoyed the book and the refresher on CS topics.” —404 Tech Support

WIN $150 GIFT VOUCHERS: ALADDIN'S GOLD

The CS Detective

Jeremy Kubica

$39.99

Paperback

Reviews for The CS Detective

See Inside

See Also

Contact Abbeys

Contact Galaxy

Contact Language

Contact Us

About ABBEY'S