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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
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.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Zoom Books East, Glendale Heights, IL, Estados Unidos de America
Condición: very_good. Book is in very good condition and may include minimal underlining highlighting. The book can also include "From the library of" labels. May not contain miscellaneous items toys, dvds, etc. . We offer 100% money back guarantee and 24 7 customer service. Nº de ref. del artículo: ZEV.1927356385.VG
Cantidad disponible: 1 disponibles
Librería: ThriftBooks-Atlanta, AUSTELL, GA, Estados Unidos de America
Paperback. Condición: As New. No Jacket. Pages are clean and are not marred by notes or folds of any kind. ~ ThriftBooks: Read More, Spend Less. Nº de ref. del artículo: G1927356385I2N00
Cantidad disponible: 1 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: As New. Unread book in perfect condition. Nº de ref. del artículo: 19509179
Cantidad disponible: 4 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: FW-9781927356388
Cantidad disponible: 4 disponibles
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 19509179-n
Cantidad disponible: 4 disponibles
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
Paperback. Condición: New. 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. Nº de ref. del artículo: LU-9781927356388
Cantidad disponible: 2 disponibles
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condición: New. 2013. 31st ed. Paperback. . . . . . Nº de ref. del artículo: V9781927356388
Cantidad disponible: 1 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. pp. 344 88 Illus. Nº de ref. del artículo: 96064181
Cantidad disponible: 3 disponibles
Librería: GreatBookPricesUK, Woodford Green, Reino Unido
Condición: New. Nº de ref. del artículo: 19509179-n
Cantidad disponible: 4 disponibles
Librería: Revaluation Books, Exeter, Reino Unido
Paperback. Condición: Brand New. 344 pages. 8.75x6.00x0.75 inches. In Stock. Nº de ref. del artículo: __1927356385
Cantidad disponible: 2 disponibles