MARC details
000 -LEADER |
fixed length control field |
05356cam a2200481 i 4500 |
001 - CONTROL NUMBER |
control field |
ocn841710249 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
OCoLC |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20240726105425.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
130425t20132013abca ob 001 0 eng |
040 ## - CATALOGING SOURCE |
Original cataloging agency |
NLC |
Language of cataloging |
eng |
Description conventions |
rda |
-- |
pn |
Transcribing agency |
NLC |
Modifying agency |
HEBIS |
-- |
NT |
-- |
OCLCF |
-- |
IDEBK |
-- |
EBLCP |
-- |
CDX |
-- |
MHW |
-- |
MEAUC |
-- |
K6U |
-- |
DEBSZ |
-- |
CELBN |
-- |
E7B |
-- |
YDXCP |
-- |
CNSPO |
-- |
VT2 |
-- |
AZK |
-- |
CNNLC |
-- |
AGLDB |
-- |
JBG |
-- |
CAUOI |
-- |
MERER |
-- |
COCUF |
-- |
LOA |
-- |
MERUC |
-- |
OTZ |
-- |
STF |
-- |
WY@ |
-- |
NLC |
-- |
WRM |
-- |
MNI |
-- |
OCLCQ |
-- |
VTS |
-- |
CEF |
-- |
OCLCQ |
-- |
WYU |
-- |
LVT |
-- |
S9I |
-- |
CANPU |
-- |
OCLCQ |
-- |
M8D |
-- |
UKAHL |
-- |
OCLCQ |
-- |
OPENT |
-- |
DKU |
-- |
OCLCQ |
-- |
OCLCO |
016 ## - NATIONAL BIBLIOGRAPHIC AGENCY CONTROL NUMBER |
Record control number |
(AMICUS)000041736527 |
016 ## - NATIONAL BIBLIOGRAPHIC AGENCY CONTROL NUMBER |
Canceled/invalid control number |
20139021701 (print) |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9781927356401 |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9781299794641 |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9781927356388 |
050 04 - LIBRARY OF CONGRESS CALL NUMBER |
Classification number |
QA76 |
Item number |
.O646 2013 |
049 ## - LOCAL HOLDINGS (OCLC) |
Holding library |
MAIN |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Morin, Pat, |
Dates associated with a name |
1973- |
Relator term |
Author |
245 10 - TITLE STATEMENT |
Title |
Open data structures : |
Remainder of title |
an introduction / |
Statement of responsibility, etc. |
Pat Morin. |
260 ## - PUBLICATION, DISTRIBUTION, ETC. |
Place of publication, distribution, etc. |
Edmonton, AB : |
Name of publisher, distributor, etc. |
AU Press, Athabasca University, |
Date of publication, distribution, etc. |
(c)2013. |
300 ## - PHYSICAL DESCRIPTION |
Extent |
1 online resource (357 pages). |
336 ## - CONTENT TYPE |
Content type term |
text |
Content type code |
txt |
Source |
rdacontent |
337 ## - MEDIA TYPE |
Media type term |
computer |
Media type code |
c |
Source |
rdamedia |
338 ## - CARRIER TYPE |
Carrier type term |
online resource |
Carrier type code |
cr |
Source |
rdacarrier |
347 ## - DIGITAL FILE CHARACTERISTICS |
File type |
data file |
Source |
rda |
490 1# - SERIES STATEMENT |
Series statement |
OPEL (Open paths to enriched learning), |
504 ## - BIBLIOGRAPHY, ETC. NOTE |
Bibliography, etc. note |
Includes bibliographies and index. |
505 00 - FORMATTED CONTENTS NOTE |
Formatted contents note |
Cover; Front Matter; Contents; Acknowledgments; Why This Book?; 1. Introduction; 1.1 The Need for Efficiency; 1.2 Interfaces; 1.2.1 The Queue, Stack, and Deque Interfaces; 1.2.2 The List Interface: Linear Sequences; 1.2.3 The USet Interface: Unordered Sets; 1.2.4 The SSet Interface: Sorted Sets; 1.3 Mathematical Background; 1.3.1 Exponentials and Logarithms; 1.3.2 Factorials; 1.3.3 Asymptotic Notation; 1.3.4 Randomization and Probability; 1.4 The Model of Computation; 1.5 Correctness, Time Complexity, and Space Complexity; 1.6 Code Samples; 1.7 List of Data Structures. |
505 00 - FORMATTED CONTENTS NOTE |
Formatted contents note |
1.8 Discussion and Exercises2. Array-Based Lists; 2.1 ArrayStack: Fast Stack Operations Using an Array; The Basics; Growing and Shrinking; Summary; 2.2 FastArrayStack: An Optimized ArrayStack; 2.3 ArrayQueue: An Array-Based Queue; 2.3.1 Summary; 2.4 ArrayDeque: Fast Deque Operations Using an Array; 2.4.1 Summary; 2.5 DualArrayDeque: Building a Deque from Two Stacks; 2.5.1 Balancing; 2.5.2 Summary; 2.6 RootishArrayStack: A Space-Efficient Array Stack; 2.6.1 Analysis of Growing and Shrinking; 2.6.2 Space Usage; 2.6.3 Summary; 2.6.4 Computing Square Roots; 2.7 Discussion and Exercises. |
505 00 - FORMATTED CONTENTS NOTE |
Formatted contents note |
3. Linked Lists3.1 SLList: A Singly-Linked List; 3.1.1 Queue Operations; 3.1.2 Summary; 3.2 DLList: A Doubly-Linked List; 3.2.1 Adding and Removing; 3.2.2 Summary; 3.3 SEList: A Space-Efficient Linked List; 3.3.1 Space Requirements; 3.3.2 Finding Elements; 3.3.3 Adding an Element; 3.3.4 Removing an Element; 3.3.5 Amortized Analysis of Spreading and Gathering; 3.3.6 Summary; 3.4 Discussion and Exercises; 4. Skiplists; 4.1 The Basic Structure; 4.2 SkiplistSSet: An Efficient SSet; 4.2.1 Summary; 4.3 SkiplistList: An Efficient Random-Access List; 4.3.1 Summary; 4.4 Analysis of Skiplists. |
505 00 - FORMATTED CONTENTS NOTE |
Formatted contents note |
4.5 Discussion and Exercises5. Hash Tables; 5.1 ChainedHashTable: Hashing with Chaining; 5.1.1 Multiplicative Hashing; 5.1.2 Summary; 5.2 LinearHashTable: Linear Probing; 5.2.1 Analysis of Linear Probing; 5.2.2 Summary; 5.2.3 Tabulation Hashing; 5.3 Hash Codes; 5.3.1 Hash Codes for Primitive Data Types; 5.3.2 Hash Codes for Compound Objects; 5.3.3 Hash Codes for Arrays and Strings; 5.4 Discussion and Exercises; 6. Binary Trees; 6.1 BinaryTree: A Basic Binary Tree; 6.1.1 Recursive Algorithms; 6.1.2 Traversing Binary Trees; 6.2 BinarySearchTree: An Unbalanced Binary Search Tree; 6.2.1 Searching. |
505 00 - FORMATTED CONTENTS NOTE |
Formatted contents note |
6.2.2 Addition6.2.3 Removal; 6.2.4 Summary; 6.3 Discussion and Exercises; 7. Random Binary Search Trees; 7.1 Random Binary Search Trees; 7.1.1 Proof of Lemma 7.1; 7.1.2 Summary; 7.2 Treap: A Randomized Binary Search Tree; 7.2.1 Summary; 7.3 Discussion and Exercises; 8. Scapegoat Trees; 8.1 ScapegoatTree: A Binary Search Tree with Partial Rebuilding; 8.1.1 Analysis of Correctness and Running-Time; 8.1.2 Summary; 8.2 Discussion and Exercises; 9. Red-Black Trees; 9.1 2-4 Trees; 9.1.1 Adding a Leaf; 9.1.2 Removing a Leaf; 9.2 RedBlackTree: A Simulated 2-4 Tree; 9.2.1 Red-Black Trees and 2-4 Trees. |
520 0# - SUMMARY, ETC. |
Summary, etc. |
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. Analyzed and implemented in Java, with a mathematically rigorous approach, Morin clearly and briskly presents instruction along with source code. A modern treatment of an essential computer science topic, this text is a measured balance between classical topics and state-of-the-art structures that will serve the needs of all undergraduate. |
530 ## - COPYRIGHT INFORMATION: |
COPYRIGHT INFORMATION |
COPYRIGHT NOT covered - Click this link to request copyright permission: |
Uniform Resource Identifier |
<a href="b">b</a> |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Data structures (Computer science) |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Computer algorithms. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name entry element |
Algorithms. |
655 #1 - INDEX TERM--GENRE/FORM |
Genre/form data or focus term |
Electronic Books. |
856 40 - ELECTRONIC LOCATION AND ACCESS |
Uniform Resource Identifier |
<a href="https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=638956&site=eds-live&custid=s3260518">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=638956&site=eds-live&custid=s3260518</a> |
-- |
Click to access digital title | log in using your CIU ID number and my.ciu.edu password |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Koha item type |
Online Book (LOGIN USING YOUR MY CIU LOGIN AND PASSWORD) |
DONATED BY: |
|
VENDOR |
EBSCO |
Classification part |
QA. . |
PUBLICATION YEAR |
2013 |
LOCATION |
ONLINE |
REQUESTED BY: |
|
-- |
|
-- |
NFIC |
Source of classification or shelving scheme |
|
994 ## - |
-- |
92 |
-- |
NT |
902 ## - LOCAL DATA ELEMENT B, LDB (RLIN) |
a |
1 |
b |
Cynthia Snell |
c |
1 |
d |
Cynthia Snell |