The CS Detective Book

Crack the Case with "The CS Detective" Book!

Calling all digital technology teachers, computer science educators, and schools! Dive into the captivating world of algorithmic investigations with "The CS Detective." This innovative novel-meets-computer-science-textbook, featured in The Wall Street Journal, is your key to unlocking high-level computational concepts in a thrilling detective story.

Why Choose "The CS Detective"?

1. Engaging Learning: Immerse students in a detective story where disgraced ex-detective Frank Runtime uses algorithmic tools to solve a robbery, making learning computational concepts exciting.

2. Algorithmic Concepts: Explore best-first and depth-first search, iterative deepening, parallelizing, binary search, and more through captivating detective missions.

3. Technical Recaps: Each chapter ends with a technical recap, reinforcing the learning experience and aiding in concept retention.

4. Real-World Applications: Follow Frank's mission to adapt search algorithms to unusual data structures, pick locks with priority queues, and unravel a deep conspiracy.

Features of "The CS Detective":

• Perfect Blend: Ideal for both computer science students and amateur sleuths, this book seamlessly integrates algorithmic education with an entertaining detective narrative.

• Author Expertise: Written by Jeremy Kubica, a principal engineer at Google with a PhD in robotics, this book delivers credible insights into algorithms and computational concepts.

• Comprehensive Coverage: From basic computational concepts to efficient algorithms and common-sense heuristic methods, "The CS Detective" covers a broad spectrum of topics.

• Unique Structure: Follow the detective's journey through search problems, arrays, strings, binary search, backtracking, parallelized search, and more, with each chapter presenting a new algorithmic concept.

Table of Contents:

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

Invest in Algorithmic Adventures – Order "The CS Detective" Today!

Make learning algorithms an immersive experience with this unique blend of detective intrigue and computational education. "The CS Detective" ensures students grasp high-level concepts while enjoying an exciting detective narrative.