Open Data Structures: An Introduction (OPEL: Open Paths to Enriched Learning) - Softcover

Morin, Pat

Softcover

ISBN 10: 1927356385 ISBN 13: 9781927356388

Publisher: Athabasca University Press, 2013

Synopsis

Offered as an introduction to the field of data structures andalgorithms, Open Data Structures covers the implementation andanalysis of data structures for sequences (lists), queues, priorityqueues, unordered dictionaries, ordered dictionaries, and graphs.Focusing on a mathematically rigorous approach that is fast, practical,and efficient, Morin clearly and briskly presents instruction alongwith source code.

Analyzed and implemented in Java, the data structures presented inthe book include stacks, queues, deques, and lists implemented asarrays and linked-lists; space-efficient implementations of lists; skiplists; hash tables and hash codes; binary search trees includingtreaps, scapegoat trees, and red-black trees; integer searchingstructures including binary tries, x-fast tries, and y-fast tries;heaps, including implicit binary heaps and randomized meldable heaps;and graphs, including adjacency matrix and adjacency listrepresentations; and B-trees.

A modern treatment of an essential computer science topic, OpenData Structures is a measured balance between classical topics andstate-of-the art structures that will serve the needs of allundergraduate students or self-directed learners.

About this title

About the Author

Pat Morin is Professor in the School of ComputerScience at Carleton University as well as founder and managing editorof the open access Journal of Computational Geometry. He is the authorof numerous conference papers and journal publications on the topics ofcomputational geometry, algorithms, and data structures.

From the Back Cover

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.

From the Inside Flap

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.

Edition details

• Publisher: Athabasca University Press
• Publication date: 2013
• ISBN 10: 1927356385
• ISBN 13: 9781927356388
• Binding: Paperback
• Language: English
• Number of pages: 344