Read more
Informationen zum Autor 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. Klappentext "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 endeavor. It will give you a strong background in implementing and working with more than 15 key data structures, from arrays, stacks, and queues to caches, bloom filters, skip lists, and graphs"-- Zusammenfassung Learn how and when to use the right data structures in any situation, strengthening your computational thinking, problem-solving, and programming skills in the process. 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 endeavor. You’ll learn how to work with more than 15 key data structures, from stacks, queues, and caches to bloom filters, skip lists, and graphs. You’ll also master linked lists by virtually standing in line at a cafe, hash tables by cataloging 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. Inhaltsverzeichnis Introduction Chapter 1: Information in Memory Chapter 2: Binary Search Chapter 3: Dynamic Data Structures Chapter 4: Stacks and Queues Chapter 5: Binary Search Trees Chapter 6: Tries and Adapting Data Structures Chapter 7: Priority Queues and Heaps Chapter 8: Grids Chapter 9: Spatial Trees Chapter 10: Hash Tables Chapter 11: Caches Chapter 12: B-Trees Chapter 13: Bloom Filters Chapter 14: Skip Lists Chapter 15: Graphs Conclusion ...
List of contents
Introduction
Chapter 1: Information in Memory
Chapter 2: Binary Search
Chapter 3: Dynamic Data Structures
Chapter 4: Stacks and Queues
Chapter 5: Binary Search Trees
Chapter 6: Tries and Adapting Data Structures
Chapter 7: Priority Queues and Heaps
Chapter 8: Grids
Chapter 9: Spatial Trees
Chapter 10: Hash Tables
Chapter 11: Caches
Chapter 12: B-Trees
Chapter 13: Bloom Filters
Chapter 14: Skip Lists
Chapter 15: Graphs
Conclusion
