• Home
  • Advanced Search
  • Directory of Libraries
  • About lib.ir
  • Contact Us
  • History

عنوان
Open Data Structures

پدید آورنده
Pat Morin

موضوع
Computer science, Textbooks

رده
QA76

کتابخانه
Center and Library of Islamic Studies in European Languages

محل استقرار
استان: Qom ـ شهر: Qom

Center and Library of Islamic Studies in European Languages

تماس با کتابخانه : 32910706-025

INTERNATIONAL STANDARD BOOK NUMBER

(Number (ISBN
9781927356388

NATIONAL BIBLIOGRAPHY NUMBER

Number
b423105

TITLE AND STATEMENT OF RESPONSIBILITY

Title Proper
Open Data Structures
General Material Designation
[Book]
Other Title Information
An Introduction
First Statement of Responsibility
Pat Morin

PHYSICAL DESCRIPTION

Specific Material Designation and Extent of Item
1 online resource

SERIES

Series Title
Open textbook library

FREQUENCY STATEMENT NOTE

Frequency
Updated irregularly

CONTENTS NOTE

Text of Note
1 Introduction -- 2 Array-Based Lists -- 3 Linked Lists -- 4 Skiplists -- 5 Hash Tables -- 6 Binary Trees -- 7 Random Binary Search Trees -- 8 Scapegoat Trees -- 9 Red-Black Trees -- 10 Heaps -- 11 Sorting Algorithms -- 12 Graphs -- 13 Data Structures for Integers -- 14 External Memory Searching
0

SUMMARY OR ABSTRACT

Text of Note
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

SYSTEM REQUIREMENTS NOTE (ELECTRONIC RESOURCES)

Text of Note
Mode of access: World Wide Web

TOPICAL NAME USED AS SUBJECT

Computer science, Textbooks

LIBRARY OF CONGRESS CLASSIFICATION

Class number
QA76

PERSONAL NAME - PRIMARY RESPONSIBILITY

Morin, Pat

PERSONAL NAME - ALTERNATIVE RESPONSIBILITY

Morin, Pat

CORPORATE BODY NAME - ALTERNATIVE RESPONSIBILITY

Open Textbook Library, distributor

ORIGINATING SOURCE

Date of Transaction
20190321234446.0

ELECTRONIC LOCATION AND ACCESS

Electronic name
 مطالعه متن کتاب 

[Book]

Y

Proposal/Bug Report

Warning! Enter The Information Carefully
Send Cancel
This website is managed by Dar Al-Hadith Scientific-Cultural Institute and Computer Research Center of Islamic Sciences (also known as Noor)
Libraries are responsible for the validity of information, and the spiritual rights of information are reserved for them
Best Searcher - The 5th Digital Media Festival