Open Data Structures: An Introduction
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 ap...
Gardado en:
| Autor Principal: | |
|---|---|
| Formato: | Online |
| Idioma: | inglés |
| Publicado: |
Athabasca University Press
2021
|
| Subjects: | |
| Acceso en liña: | 16222 |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|
| _version_ | 1869519455025889280 |
|---|---|
| author | Pat Morin |
| author_browse | Pat Morin |
| author_facet | Pat Morin |
| author_sort | Pat Morin |
| collection | Directory of Open Access Books |
| description | 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. |
| format | Online |
| id | doab-20.500.12854ir-55265 |
| institution | Directory of Open Access Books |
| language | eng |
| publishDate | 2021 |
| publishDateRange | 2021 |
| publishDateSort | 2021 |
| publisher | Athabasca University Press |
| publisherStr | Athabasca University Press |
| record_format | ojs |
| spelling | doab-20.500.12854ir-552652022-01-31T12:13:56Z Open Data Structures: An Introduction Pat Morin algorithms java data structures programming 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. 2021-02-11T21:42:11Z 2021-02-11T21:42:11Z 2014-08-04 17:04:53 2013 book 16222 22912614 9781927356388 9781927356395 https://directory.doabooks.org/handle/20.500.12854/55265 eng OPEL (Open Paths to Enriched Learning) image/jpeg Attribution-NonCommercial-NoDerivatives 4.0 International http://www.aupress.ca/index.php/books/120226 Athabasca University Press 6b1b8af7-79e4-4b18-b297-b983df0f073f 9781927356388 9781927356395 336 open access |
| spellingShingle | algorithms java data structures programming Pat Morin Open Data Structures: An Introduction |
| title | Open Data Structures: An Introduction |
| title_full | Open Data Structures: An Introduction |
| title_fullStr | Open Data Structures: An Introduction |
| title_full_unstemmed | Open Data Structures: An Introduction |
| title_short | Open Data Structures: An Introduction |
| title_sort | open data structures an introduction |
| topic | algorithms java data structures programming |
| topic_facet | algorithms java data structures programming |
| url | 16222 |
| work_keys_str_mv | AT patmorin opendatastructuresanintroduction |