Open Data Structures: An Introduction (Record no. 241)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 02004nam a2200229 i 4500 |
| 001 - CONTROL NUMBER | |
| control field | UUN-OA-171 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20260922220309.0 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9781927356388 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Pat Morin |
| 245 10 - TITLE STATEMENT | |
| Title | Open Data Structures: An Introduction |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Name of producer, publisher, distributor, manufacturer | Athabasca University Press |
| Date of production, publication, distribution, manufacture, or copyright notice | 2013 |
| 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 |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc. | Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Focusing on a mathematically rigorous approach that is fast, practical, and efficient, Morin clearly and briskly presents instruction along with source code. Analyzed and implemented in Java, the data structures presented in the book include stacks, queues, deques, and lists implemented as arrays and linked-lists; space-efficient implementations of lists; skip lists; hash tables and hash codes; binary search trees including treaps, scapegoat trees, and red-black trees; integer searching structures including binary tries, x-fast tries, and y-fast tries; heaps, including implicit binary heaps and randomized meldable heaps; graphs, including adjacency matrix and adjacency list representations; and B-trees. A modern treatment of an essential computer science topic, Open Data Structures is a measured balance between classical topics and state-of-the art structures that will serve the needs of all undergraduate students or self-directed learners. |
| 540 ## - TERMS GOVERNING USE AND REPRODUCTION NOTE | |
| Terms governing use and reproduction | Attribution-NonCommercial-NoDerivs |
| 650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Computer Science |
| 650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | B. Sc. Artificial Intelligence |
| Source of heading or term | local |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://www.aupress.ca/books/120226-open-data-structures/">https://www.aupress.ca/books/120226-open-data-structures/</a> |
| Link text | Read online |
| 856 42 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://open.umn.edu/opentextbooks/textbooks/open-data-structures-an-introduction">https://open.umn.edu/opentextbooks/textbooks/open-data-structures-an-introduction</a> |
| Link text | Open Textbook Library record |
No items available.