Think Data Structures (Record no. 371)

MARC details
000 -LEADER
fixed length control field 04995nam a2200505 i 4500
001 - CONTROL NUMBER
control field UMUN-OA-20261005-CS-009
003 - CONTROL NUMBER IDENTIFIER
control field local
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20261005174809.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS
fixed length control field m o d s
007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION
fixed length control field cr
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 181007s2016 mnu o 0 0 eng d
035 ## - SYSTEM CONTROL NUMBER
System control number (MnU)OTLid0000621
040 ## - CATALOGING SOURCE
Original cataloging agency MnU
Language of cataloging eng
Transcribing agency MnU
050 #4 - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Downey, Allen B.
Relator term author
245 00 - TITLE STATEMENT
Title Think Data Structures
Remainder of title Algorithms and Information Retrieval in Java
Statement of responsibility, etc. Allen Downey
264 #2 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture Minneapolis, MN
Name of producer, publisher, distributor, manufacturer Open Textbook Library
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Place of production, publication, distribution, manufacture [Place of publication not identified]
Name of producer, publisher, distributor, manufacturer Green Tea Press
Date of production, publication, distribution, manufacture, or copyright notice [2016]
264 #4 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Date of production, publication, distribution, manufacture, or copyright notice ©2016.
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource
336 ## - CONTENT TYPE
Content type term text
Content type code txt
Source rdacontent
337 ## - MEDIA TYPE
Media type term computer
Media type code c
Source rdamedia
338 ## - CARRIER TYPE
Carrier type term online resource
Carrier type code cr
Source rdacarrier
341 0# - ACCESSIBILITY CONTENT
Content access mode textual
Textual assistive features unknown
Source sapdv
490 0# - SERIES STATEMENT
Series statement Open textbook library.
500 ## - GENERAL NOTE
General note Publication type: Open textbook.
505 0# - FORMATTED CONTENTS NOTE
Formatted contents note Chapter 1: Interfaces -- Chapter 2: Analysis of Algorithms -- Chapter 3: ArrayList -- Chapter 4: LinkedList -- Chapter 5: Doubly-linked list -- Chapter 6: Tree traversal -- Chapter 7: Getting to Philosophy -- Chapter 8: Indexer -- Chapter 9: The Map interface -- Chapter 10: Hashing -- Chapter 11: HashMap -- Chapter 12: TreeMap -- Chapter 13: Binary search tree -- Chapter 14: Persistence -- Chapter 15: Crawling Wikipedia -- Chapter 16: Boolean search -- Chapter 17: Sorting
506 0# - RESTRICTIONS ON ACCESS NOTE
Terms governing access Open access; no subscription required for the linked open-access version.
Standardized terminology for access restriction Unrestricted online access
Source of term star
520 0# - SUMMARY, ETC.
Summary, etc. Data structures and algorithms are among the most important inventions of the last 50 years, and they are fundamental tools software engineers need to know. But in my opinion, most of the books on these topics are too theoretical, too big, and too bottom-up: Too theoretical: Mathematical analysis of algorithms is based on simplifying assumptions that limit its usefulness in practice. Many presentations of this topic gloss over the simplifications and focus on the math. In this book I present the most practical subset of this material and eliminate the rest. Too big: Most books on these topics are at least 500 pages, and some are more than 1000. By focusing on the topics I think are most useful for software engineers, I kept this book under 250 pages. Too bottom-up: Many data structures books focus on how data structures work (the implementations), with less about how to use them (the interfaces). In this book, I go “top down”, starting with the interfaces. Readers learn to use the structures in the Java Collections Framework before getting into the details of how they work. Finally, many present this material out of context and without motivation: it’s just one damn data structure after another! I try to alleviate the boredom by organizing the topics around an application—web search—that uses data structures extensively, and is an interesting and important topic in its own right. This application also motivates some topics that are not usually covered in an introductory data structures class, including persistent data structures, with Redis, and streaming algorithms. This book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercise that allows readers to apply what they have learned. Each exercise includes automated tests that check the solution. And for most exercises, I present my solution at the beginning of the next chapter. This book is intended for college students in computer science and related fields, as well as professional software engineers, people training in software engineering, and people preparing for technical interviews. I assume that the reader knows Java at an intermediate level, but I explain some Java features along the way, and provide pointers to supplementary material. People who have read Think Java or Head First Java are prepared for this book.
540 ## - TERMS GOVERNING USE AND REPRODUCTION NOTE
Terms governing use and reproduction Attribution-NonCommercial-ShareAlike (licence family recorded by the source; version not supplied in metadata).
Uniform Resource Identifier <a href="https://open.umn.edu/opentextbooks/textbooks/621">https://open.umn.edu/opentextbooks/textbooks/621</a>
542 1# - INFORMATION RELATING TO COPYRIGHT STATUS
Copyright statement Attribution-NonCommercial-ShareAlike
546 ## - LANGUAGE NOTE
Language note In English.
588 0# - SOURCE OF DESCRIPTION NOTE
Source of description note Description based on print resource
590 ## - LOCAL NOTE (RLIN)
Local note Course allocation: B. Sc. Computer Science.
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Science
Form subdivision Textbooks
653 ## - INDEX TERM--UNCONTROLLED
Uncontrolled term B. Sc. Computer Science
653 ## - INDEX TERM--UNCONTROLLED
Uncontrolled term UMUN open access collection
653 ## - INDEX TERM--UNCONTROLLED
Uncontrolled term Foundational textbook
655 #4 - INDEX TERM--GENRE/FORM
Genre/form data or focus term Electronic textbooks.
710 2# - ADDED ENTRY--CORPORATE NAME
Corporate name or jurisdiction name as entry element Open Textbook Library
Relator term distributor
856 40 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://greenteapress.com/wp/think-data-structures/">https://greenteapress.com/wp/think-data-structures/</a>
Link text Read open-access publication
Public note Open access.
Access status 0
856 42 - ELECTRONIC LOCATION AND ACCESS
Uniform Resource Identifier <a href="https://open.umn.edu/opentextbooks/textbooks/621">https://open.umn.edu/opentextbooks/textbooks/621</a>
Link text Open Textbook Library catalogue and formats
Access status 0
884 ## - DESCRIPTION CONVERSION INFORMATION
Conversion process Course selection and automated MARC21 enrichment from Open Textbook Library metadata.
Conversion date 20261005
Identifier of source metadata https://open.umn.edu/opentextbooks/textbooks/621
Conversion agency local
942 ## - ADDED ENTRY ELEMENTS (KOHA)
Suppress in OPAC No

No items available.