Filter by

  • Publication Year
  • Availability
  • Attachment
  • Collection Type
  • General Material Designation
    See More
  • Location
  • Language
Found 3 from your keywords: author="MORIN, Pat"
cover
Open Data Structures An Introduction
Comment Share
MORIN, Pat

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 tri…

Edition
-
ISBN/ISSN
9781927356388.01
Collation
-
Series Title
-
Call Number
336 pages
cover
Open Data Structures : An Introduction
Comment Share
MORIN, Pat

There are plenty of books that teach introductory data structures. Some of them are very good. Most of them cost money, and the vast majority of computer science undergraduate students will shell out at least some cash on a data structures book.

Edition
-
ISBN/ISSN
9781927356388
Collation
-
Series Title
-
Call Number
004 MOR o
cover
Open Data Structures
Comment Share
MORIN, Pat

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…

Edition
-
ISBN/ISSN
-
Collation
-
Series Title
-
Call Number
-