Amazon cover image
Image from Amazon.com

Data structures the fun way : an amusing adventure with coffee-filled examples / Jeremy Kubica

By: Material type: TextTextPublication details: San Francisco : No starch press, c2022.Description: 276 pages : illustrations ; 24 cmISBN:
  • 9781718502604
Subject(s): LOC classification:
  • QA 76.9.D35 .K83 2022
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
Summary: 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.
Item type: Books
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Call number Copy number Status Date due Barcode
Books Books National University - Manila LRC - Main General Circulation Multimedia Arts and Animation GC QA 76.9.D35 .K83 2022 c.2 (Browse shelf(Opens below)) c.2 Available NULIB000020546
Books Books National University - Manila LRC - Main General Circulation Digital Forensic GC QA 76.9.D35 .K83 2022 (Browse shelf(Opens below)) c.1 Available NULIB000020281

Includes index.

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

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.

There are no comments on this title.

to post a comment.