OPEN EDUCATIONAL RESOURCES

UPA PERPUSTAKAAN UNEJ | NPP. 3509212D1000001

  • Home
  • Admin
  • Select Language :
    Arabic Bengali Brazilian Portuguese English Espanol German Indonesian Japanese Malay Persian Russian Thai Turkish Urdu

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}
Image of Open Data Structures
An Introduction
Bookmark Share

Text

Open Data Structures An Introduction

MORIN, Pat - Personal Name;

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.


Availability

No copy data

Detail Information
Series Title
-
Call Number
336 pages
Publisher
Canada : AU Press., 2013
Collation
-
Language
English
ISBN/ISSN
9781927356388.01
Classification
336 pages
Content Type
text
Media Type
computer
Carrier Type
online resource
Edition
-
Subject(s)
Computing
Specific Detail Info
-
Statement of Responsibility
Pat Morin
Other Information
Cataloger
Arin
Source
-
Validator
-
Other version/related

No other version available

File Attachment
  • Open Data Structures An Introduction
Comments

You must be logged in to post a comment

OPEN EDUCATIONAL RESOURCES

Search

start it by typing one or more keywords for title, author or subject


Select the topic you are interested in
  • Computer Science, Information & General Works
  • Philosophy & Psychology
  • Religion
  • Social Sciences
  • Language
  • Pure Science
  • Applied Sciences
  • Art & Recreation
  • Literature
  • History & Geography
Icons made by Freepik from www.flaticon.com
Advanced Search
Where do you want to share?