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
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Paperback. Condizione: Very Good. 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. Codice articolo 00094859036
Quantità: 2 disponibili
Da: World of Books (was SecondSale), Montgomery, IL, U.S.A.
Paperback. Condizione: Good. 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. Codice articolo 00105121406
Quantità: 1 disponibili
Da: BooksRun, Philadelphia, PA, U.S.A.
Paperback. Condizione: Fair. Illustrated. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way. Codice articolo 1593277490-7-1
Quantità: 1 disponibili
Da: Greenworld Books, Arlington, TX, U.S.A.
Condizione: very_good. Fast Free Shipping â" Very Good condition book with a firm cover and clean pages. Shows normal use and some light wear or limited notes markings. A solid, nice copy to enjoy. Codice articolo GWV.1593277490.VG
Quantità: 1 disponibili
Da: BooksRun, Philadelphia, PA, U.S.A.
Paperback. Condizione: Very Good. Illustrated. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting. Codice articolo 1593277490-8-6
Quantità: 1 disponibili
Da: Zoom Books Company, Lynden, WA, U.S.A.
Condizione: very_good. Book is in very good condition and may include minimal underlining highlighting. The book can also include "From the library of" labels. May not contain miscellaneous items toys, dvds, etc. . We offer 100% money back guarantee and 24 7 customer service. Codice articolo ZBV.1593277490.VG
Quantità: 1 disponibili
Da: Greenworld Books, Arlington, TX, U.S.A.
Condizione: good. Fast Free Shipping â" Good condition. It may show normal signs of use, such as light writing, highlighting, or library markings, but all pages are intact and the book is fully readable. A solid, complete copy that's ready to enjoy. Codice articolo GWV.1593277490.G
Quantità: 1 disponibili
Da: Goodwill, Brooklyn Park, MN, U.S.A.
Condizione: very_good. Item may have minor cosmetic defects such as marks, wears, cuts, bends, or crushes on the cover, spine, pages, or dust cover. Shrink wrap, dust covers, or boxed set case may be missing. Item may contain remainder marks on outside edges, which should be noted in listing comments. Item may be missing bundled media. Codice articolo MINV.1593277490.VG
Quantità: 1 disponibili
Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Paperback. Condizione: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Codice articolo G1593277490I3N00
Quantità: 1 disponibili
Da: Half Price Books Inc., Dallas, TX, U.S.A.
Paperback. Condizione: Very Good. Connecting readers with great books since 1972! Used books may not include companion materials, and may have some shelf wear or limited writing. We ship orders daily and Customer Service is our top priority! Codice articolo S_465341427
Quantità: 1 disponibili