Description
This accessible and entertaining book provides an in-depth introduction to computational thinking through the lens of data structures a critical component in any programming endeavour. You'll learn how to work with more than 15 key data structures, from arrays, stacks, and queues, to caches, bloom filters, skip lists, and graphs. You'll also master linked lists by virtually standing in line at a cafe, hash tables by cataloguing the history of the summer Olympics, and QuadTrees by neatly organizing your kitchen cabinets, all while becoming familiar with basic computer science concepts, like recursion and running time analysis.
About the Author
Jeremy Kubica is an engineer director specializing in artificial intelligence and machine learning. He received a Ph.D. in Robotics from Carnegie Mellon University and a BS in Computer Science from Cornell University. He spent his graduate school years creating algorithms to detect killer asteroids (actually stopping them was, of course, left as "future work"). He is the author of multiple books designed to introduce people to computer science, including Computational Fairy Tales and The CS Detective, as well as the Computational Fairy Tales Blog.
Reviews
"The perfect book for novice programmers as well as developers who want to improve their knowledge of key software concepts."
-Ben Dickson, TechTalks
"Clear and fun to someone learning the topics for the first time. . . . overall a great read."
-Jeanne Boyarsky, CodeRanch
"A good book to read from beginning to end . . . a nice quick reference for reading about data structures, the complexity of each one, and for what is useful or not!"
-Eduardo Blazquez, @Farenain, COSEC Lab at Charles III University of Madrid
"Good overview of data structures, intuitive with good visualizations."
-Lucille E Nguyen, Computational Social Scientist
"A fun intro to the topic for self-taught programmers and data scientists."
-Crow Intelligence
Book Information
ISBN 9781718502604
Author Jeremy Kubica
Format Paperback
Page Count 304
Imprint No Starch Press,US
Publisher No Starch Press,US
About the Author
Jeremy Kubica is an engineer director specializing in artificial intelligence and machine learning. He received a Ph.D. in Robotics from Carnegie Mellon University and a BS in Computer Science from Cornell University. He spent his graduate school years creating algorithms to detect killer asteroids (actually stopping them was, of course, left as "future work"). He is the author of multiple books designed to introduce people to computer science, including Computational Fairy Tales and The CS Detective, as well as the Computational Fairy Tales Blog.
Reviews
"The perfect book for novice programmers as well as developers who want to improve their knowledge of key software concepts."
-Ben Dickson, TechTalks
"Clear and fun to someone learning the topics for the first time. . . . overall a great read."
-Jeanne Boyarsky, CodeRanch
"A good book to read from beginning to end . . . a nice quick reference for reading about data structures, the complexity of each one, and for what is useful or not!"
-Eduardo Blazquez, @Farenain, COSEC Lab at Charles III University of Madrid
"Good overview of data structures, intuitive with good visualizations."
-Lucille E Nguyen, Computational Social Scientist
"A fun intro to the topic for self-taught programmers and data scientists."
-Crow Intelligence
Book Information
ISBN 9781718502604
Author Jeremy Kubica
Format Paperback
Page Count 304
Imprint No Starch Press,US
Publisher No Starch Press,US
