Data structures the fun way : (Record no. 50)

MARC details
000 -LEADER
fixed length control field 01799nam a22002417a 4500
003 - CONTROL NUMBER IDENTIFIER
control field NULRC
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20241018093651.0
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 241018b ph ||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781718502604
040 ## - CATALOGING SOURCE
Transcribing agency NULRC
050 ## - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA 76.9.D35 .K83 2022
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Kubica, Jeremy
Relator term author
245 ## - TITLE STATEMENT
Title Data structures the fun way :
Remainder of title an amusing adventure with coffee-filled examples /
Statement of responsibility, etc. Jeremy Kubica
260 ## - PUBLICATION, DISTRIBUTION, ETC.
Place of publication, distribution, etc. San Francisco :
Name of publisher, distributor, etc. No starch press,
Date of publication, distribution, etc. c2022.
300 ## - PHYSICAL DESCRIPTION
Extent 276 pages :
Other physical details illustrations ;
Dimensions 24 cm.
365 ## - TRADE PRICE
Price amount USD40.00
504 ## - BIBLIOGRAPHY, ETC. NOTE
Bibliography, etc. note Includes index.
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note 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<br/>
520 ## - SUMMARY, ETC.
Summary, etc. 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.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element COMPUTER SCIENCE
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element DATA STRUCTURES
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Source of classification or shelving scheme Library of Congress Classification
Koha item type Books
Suppress in OPAC No
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection Home library Current library Shelving location Date acquired Source of acquisition Cost, normal purchase price Total checkouts Full call number Barcode Date last seen Copy number Koha item type
    Library of Congress Classification     Digital Forensic LRC - Main National University - Manila General Circulation 08/24/2024 Purchased - Amazon 40.00   GC QA 76.9.D35 .K83 2022 NULIB000020281 10/18/2024 c.1 Books
    Library of Congress Classification     Multimedia Arts and Animation LRC - Main National University - Manila General Circulation 01/20/2025 Purchased - Amazon 27.00   GC QA 76.9.D35 .K83 2022 c.2 NULIB000020546 03/26/2025 c.2 Books