Catholic University of Zimbabwe Library
Online Public Access Catalogue
(OPAC)

Think Data Structures (Record no. 19986)

MARC details
000 -LEADER
fixed length control field 03978nam a2200337 4500
001 - CONTROL NUMBER
control field OTLid0000621
003 - CONTROL NUMBER IDENTIFIER
control field MnU
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20201105133347.0
006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS
fixed length control field m o d s
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 181007s2016 mnu o 0 0 eng d
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
Name of producer, publisher, distributor, manufacturer Open Textbook Library
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Name of producer, publisher, distributor, manufacturer Green Tea Press
300 ## - PHYSICAL DESCRIPTION
Extent 1 online resource
490 0# - SERIES STATEMENT
Series statement Open textbook library.
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
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.
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 online resource
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name entry element Computer Science
Form subdivision 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://open.umn.edu/opentextbooks/textbooks/621">https://open.umn.edu/opentextbooks/textbooks/621</a>
Public note Access online version
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Home library Shelving location Date acquired Total Checkouts Full call number Date last seen Uniform Resource Identifier Price effective from Koha item type
          Digital Library Online Access 05.11.2020   QA76 05.11.2020 https://open.umn.edu/opentextbooks/textbooks/621 05.11.2020 eBook

OPENING HOURS

Weekdays: 0815hrs - 1800hrs
Weekends:0900hrs - 1200hrs

Closed for Mass:

Mon, Thur: 1200hrs - 1300hrs
Sunday & Public Holiday’s

CALL SUPPORT

0242-570570, 0242-570169
09200664, +263 8644140602

LOCATION

18443, Cranborne Avenue, Hatfield, Harare

Other Links


©2021 | CUZ Library