Open data structures :: an introduction /
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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Edmonton, AB :
AU Press, Athabasca University,
[2013]
|
| Schriftenreihe: | Open paths to enriched learning.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | 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. |
| Beschreibung: | 1 online resource (357 pages). |
| Bibliographie: | Includes bibliographical references and index. |
| ISBN: | 9781927356395 1927356393 9781927356401 1927356407 1299794645 9781299794641 1927356385 9781927356388 |
| ISSN: | 2291-2614 |
Internformat
MARC
| LEADER | 00000cam a2200000 i 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn841710249 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr mn||||||||| | ||
| 008 | 130425t20132013abca ob 001 0 eng | ||
| 040 | |a NLC |b eng |e rda |e pn |c NLC |d HEBIS |d N$T |d OCLCF |d IDEBK |d EBLCP |d CDX |d MHW |d MEAUC |d K6U |d DEBSZ |d CELBN |d E7B |d YDXCP |d CNSPO |d VT2 |d AZK |d CNNLC |d AGLDB |d JBG |d CAUOI |d MERER |d COCUF |d LOA |d MERUC |d OTZ |d STF |d WY@ |d NLC |d WRM |d MNI |d OCLCQ |d VTS |d CEF |d OCLCQ |d WYU |d LVT |d S9I |d CANPU |d OCLCQ |d M8D |d UKAHL |d OCLCQ |d OPENT |d DKU |d OCLCQ |d OCLCO |d OCL |d OCLCQ |d SFB |d OCLCQ |d OCLCO |d OCLCQ |d OCLCL |d DEGRU |d NUI |d DITRP | ||
| 016 | |a (AMICUS)000041736527 | ||
| 016 | |z 20139021701 (print) | ||
| 019 | |a 856626663 |a 860709296 |a 872698423 |a 875380430 |a 923089736 |a 961487025 |a 1056398977 |a 1060863543 |a 1064201844 |a 1073066224 |a 1200300631 | ||
| 020 | |a 9781927356395 |z 9781927356388 |q (pdf) | ||
| 020 | |a 1927356393 | ||
| 020 | |a 9781927356401 | ||
| 020 | |a 1927356407 | ||
| 020 | |a 1299794645 | ||
| 020 | |a 9781299794641 | ||
| 020 | |a 1927356385 | ||
| 020 | |a 9781927356388 | ||
| 035 | |a (OCoLC)841710249 |z (OCoLC)856626663 |z (OCoLC)860709296 |z (OCoLC)872698423 |z (OCoLC)875380430 |z (OCoLC)923089736 |z (OCoLC)961487025 |z (OCoLC)1056398977 |z (OCoLC)1060863543 |z (OCoLC)1064201844 |z (OCoLC)1073066224 |z (OCoLC)1200300631 | ||
| 037 | |a 510715 |b MIL | ||
| 050 | 4 | |a QA76.9 .D35 | |
| 055 | 0 | 2 | |a QA76.9* |
| 055 | 0 | |a QA76.9 D35 |b M67 2013 | |
| 072 | 7 | |a COM |x 051010 |2 bisacsh | |
| 082 | 7 | |a 005.7/3 |2 23 | |
| 084 | |a cci1icc |2 lacc | ||
| 084 | |a coll11 |2 lacc | ||
| 084 | |a coll13 |2 lacc | ||
| 049 | |a MAIN | ||
| 100 | 1 | |a Morin, Pat, |d 1973- |e author. | |
| 245 | 1 | 0 | |a Open data structures : |b an introduction / |c Pat Morin. |
| 264 | 1 | |a Edmonton, AB : |b AU Press, Athabasca University, |c [2013] | |
| 264 | 4 | |c ©2013 | |
| 300 | |a 1 online resource (357 pages). | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a data file |2 rda | ||
| 490 | 1 | |a OPEL (Open paths to enriched learning), |x 2291-2614 | |
| 504 | |a Includes bibliographical references and index. | ||
| 505 | 0 | |a 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 | 8 | |a 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 | 8 | |a 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 | 8 | |a 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 | 8 | |a 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 | |a 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. | ||
| 650 | 0 | |a Data structures (Computer science) |0 http://id.loc.gov/authorities/subjects/sh85035862 | |
| 650 | 0 | |a Computer algorithms. |0 http://id.loc.gov/authorities/subjects/sh91000149 | |
| 650 | 0 | |a Algorithms. |0 http://id.loc.gov/authorities/subjects/sh85003487 | |
| 650 | 2 | |a Algorithms |0 https://id.nlm.nih.gov/mesh/D000465 | |
| 650 | 6 | |a Structures de données (Informatique) | |
| 650 | 6 | |a Algorithmes. | |
| 650 | 7 | |a algorithms. |2 aat | |
| 650 | 7 | |a COMPUTERS |x Programming Languages |x General. |2 bisacsh | |
| 650 | 7 | |a Algorithms |2 fast | |
| 650 | 7 | |a Computer algorithms |2 fast | |
| 650 | 7 | |a Data structures (Computer science) |2 fast | |
| 653 | |a algorithms | ||
| 653 | |a java | ||
| 653 | |a data structures | ||
| 653 | |a programming | ||
| 758 | |i has work: |a Open data structures (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGmkxYBBwDGTrb4FbMyrYK |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 1 | |a Morin, Pat, 1973- |t Open data structures.: |d Edmonton, AB : AU Press, Athabasca University, [2013] ©2013 |k Open paths to enriched learning |k OPEL (Open paths to enriched learning) |w (CaOONL)20139021701 |w (OCoLC)841710248 | |
| 830 | 0 | |a Open paths to enriched learning. |0 http://id.loc.gov/authorities/names/no2014040548 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=638956 |3 Volltext |
| 938 | |a Open Trip Network |b TRAP |n OTLid0000171 | ||
| 938 | |a De Gruyter |b DEGR |n 9781927356395 | ||
| 938 | |a Open Textbook Network |b OTNX |n OTLid0000171 | ||
| 938 | |a Askews and Holts Library Services |b ASKH |n AH35203532 | ||
| 938 | |a Canadian Electronic Library |b CELB |n 10766008 | ||
| 938 | |a Coutts Information Services |b COUT |n 26020687 | ||
| 938 | |a ProQuest Ebook Central |b EBLB |n EBL1350175 | ||
| 938 | |a ebrary |b EBRY |n ebr10766008 | ||
| 938 | |a EBSCOhost |b EBSC |n 638956 | ||
| 938 | |a ProQuest MyiLibrary Digital eBook Collection |b IDEB |n cis26020687 | ||
| 938 | |a YBP Library Services |b YANK |n 10254999 | ||
| 938 | |a YBP Library Services |b YANK |n 11088885 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn841710249 |
|---|---|
| _version_ | 1816882231698784256 |
| adam_text | |
| any_adam_object | |
| author | Morin, Pat, 1973- |
| author_facet | Morin, Pat, 1973- |
| author_role | aut |
| author_sort | Morin, Pat, 1973- |
| author_variant | p m pm |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9 .D35 |
| callnumber-search | QA76.9 .D35 |
| callnumber-sort | QA 276.9 D35 |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | 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. 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. 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. 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. 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. |
| ctrlnum | (OCoLC)841710249 |
| dewey-full | 005.7/3 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.7/3 |
| dewey-search | 005.7/3 |
| dewey-sort | 15.7 13 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>07831cam a2200961 i 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn841710249</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr mn|||||||||</controlfield><controlfield tag="008">130425t20132013abca ob 001 0 eng </controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">NLC</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">NLC</subfield><subfield code="d">HEBIS</subfield><subfield code="d">N$T</subfield><subfield code="d">OCLCF</subfield><subfield code="d">IDEBK</subfield><subfield code="d">EBLCP</subfield><subfield code="d">CDX</subfield><subfield code="d">MHW</subfield><subfield code="d">MEAUC</subfield><subfield code="d">K6U</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">CELBN</subfield><subfield code="d">E7B</subfield><subfield code="d">YDXCP</subfield><subfield code="d">CNSPO</subfield><subfield code="d">VT2</subfield><subfield code="d">AZK</subfield><subfield code="d">CNNLC</subfield><subfield code="d">AGLDB</subfield><subfield code="d">JBG</subfield><subfield code="d">CAUOI</subfield><subfield code="d">MERER</subfield><subfield code="d">COCUF</subfield><subfield code="d">LOA</subfield><subfield code="d">MERUC</subfield><subfield code="d">OTZ</subfield><subfield code="d">STF</subfield><subfield code="d">WY@</subfield><subfield code="d">NLC</subfield><subfield code="d">WRM</subfield><subfield code="d">MNI</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">VTS</subfield><subfield code="d">CEF</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">WYU</subfield><subfield code="d">LVT</subfield><subfield code="d">S9I</subfield><subfield code="d">CANPU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">M8D</subfield><subfield code="d">UKAHL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OPENT</subfield><subfield code="d">DKU</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">SFB</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCL</subfield><subfield code="d">DEGRU</subfield><subfield code="d">NUI</subfield><subfield code="d">DITRP</subfield></datafield><datafield tag="016" ind1=" " ind2=" "><subfield code="a">(AMICUS)000041736527</subfield></datafield><datafield tag="016" ind1=" " ind2=" "><subfield code="z">20139021701 (print)</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">856626663</subfield><subfield code="a">860709296</subfield><subfield code="a">872698423</subfield><subfield code="a">875380430</subfield><subfield code="a">923089736</subfield><subfield code="a">961487025</subfield><subfield code="a">1056398977</subfield><subfield code="a">1060863543</subfield><subfield code="a">1064201844</subfield><subfield code="a">1073066224</subfield><subfield code="a">1200300631</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781927356395</subfield><subfield code="z">9781927356388</subfield><subfield code="q">(pdf)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1927356393</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781927356401</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1927356407</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1299794645</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781299794641</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1927356385</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781927356388</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)841710249</subfield><subfield code="z">(OCoLC)856626663</subfield><subfield code="z">(OCoLC)860709296</subfield><subfield code="z">(OCoLC)872698423</subfield><subfield code="z">(OCoLC)875380430</subfield><subfield code="z">(OCoLC)923089736</subfield><subfield code="z">(OCoLC)961487025</subfield><subfield code="z">(OCoLC)1056398977</subfield><subfield code="z">(OCoLC)1060863543</subfield><subfield code="z">(OCoLC)1064201844</subfield><subfield code="z">(OCoLC)1073066224</subfield><subfield code="z">(OCoLC)1200300631</subfield></datafield><datafield tag="037" ind1=" " ind2=" "><subfield code="a">510715</subfield><subfield code="b">MIL</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.9 .D35</subfield></datafield><datafield tag="055" ind1="0" ind2="2"><subfield code="a">QA76.9*</subfield></datafield><datafield tag="055" ind1=" " ind2="0"><subfield code="a">QA76.9 D35</subfield><subfield code="b">M67 2013</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM</subfield><subfield code="x">051010</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">005.7/3</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">cci1icc</subfield><subfield code="2">lacc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">coll11</subfield><subfield code="2">lacc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">coll13</subfield><subfield code="2">lacc</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Morin, Pat,</subfield><subfield code="d">1973-</subfield><subfield code="e">author.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Open data structures :</subfield><subfield code="b">an introduction /</subfield><subfield code="c">Pat Morin.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edmonton, AB :</subfield><subfield code="b">AU Press, Athabasca University,</subfield><subfield code="c">[2013]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2013</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (357 pages).</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">data file</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">OPEL (Open paths to enriched learning),</subfield><subfield code="x">2291-2614</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Data structures (Computer science)</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85035862</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh91000149</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Algorithms.</subfield><subfield code="0">http://id.loc.gov/authorities/subjects/sh85003487</subfield></datafield><datafield tag="650" ind1=" " ind2="2"><subfield code="a">Algorithms</subfield><subfield code="0">https://id.nlm.nih.gov/mesh/D000465</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Structures de données (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Algorithmes.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithms.</subfield><subfield code="2">aat</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">COMPUTERS</subfield><subfield code="x">Programming Languages</subfield><subfield code="x">General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computer algorithms</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Data structures (Computer science)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">algorithms</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">java</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">data structures</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">programming</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Open data structures (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCGmkxYBBwDGTrb4FbMyrYK</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="1" ind2=" "><subfield code="a">Morin, Pat, 1973-</subfield><subfield code="t">Open data structures.:</subfield><subfield code="d">Edmonton, AB : AU Press, Athabasca University, [2013] ©2013</subfield><subfield code="k">Open paths to enriched learning</subfield><subfield code="k">OPEL (Open paths to enriched learning)</subfield><subfield code="w">(CaOONL)20139021701</subfield><subfield code="w">(OCoLC)841710248</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Open paths to enriched learning.</subfield><subfield code="0">http://id.loc.gov/authorities/names/no2014040548</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=638956</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Open Trip Network</subfield><subfield code="b">TRAP</subfield><subfield code="n">OTLid0000171</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">De Gruyter</subfield><subfield code="b">DEGR</subfield><subfield code="n">9781927356395</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Open Textbook Network</subfield><subfield code="b">OTNX</subfield><subfield code="n">OTLid0000171</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Askews and Holts Library Services</subfield><subfield code="b">ASKH</subfield><subfield code="n">AH35203532</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Canadian Electronic Library</subfield><subfield code="b">CELB</subfield><subfield code="n">10766008</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">Coutts Information Services</subfield><subfield code="b">COUT</subfield><subfield code="n">26020687</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest Ebook Central</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL1350175</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10766008</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">638956</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ProQuest MyiLibrary Digital eBook Collection</subfield><subfield code="b">IDEB</subfield><subfield code="n">cis26020687</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">10254999</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">11088885</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| id | ZDB-4-EBA-ocn841710249 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:25:19Z |
| institution | BVB |
| isbn | 9781927356395 1927356393 9781927356401 1927356407 1299794645 9781299794641 1927356385 9781927356388 |
| issn | 2291-2614 |
| language | English |
| oclc_num | 841710249 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (357 pages). |
| psigel | ZDB-4-EBA |
| publishDate | 2013 |
| publishDateSearch | 2013 |
| publishDateSort | 2013 |
| publisher | AU Press, Athabasca University, |
| record_format | marc |
| series | Open paths to enriched learning. |
| series2 | OPEL (Open paths to enriched learning), |
| spelling | Morin, Pat, 1973- author. Open data structures : an introduction / Pat Morin. Edmonton, AB : AU Press, Athabasca University, [2013] ©2013 1 online resource (357 pages). text txt rdacontent computer c rdamedia online resource cr rdacarrier data file rda OPEL (Open paths to enriched learning), 2291-2614 Includes bibliographical references and index. 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. 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. 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. 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. 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. 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. Data structures (Computer science) http://id.loc.gov/authorities/subjects/sh85035862 Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Algorithms https://id.nlm.nih.gov/mesh/D000465 Structures de données (Informatique) Algorithmes. algorithms. aat COMPUTERS Programming Languages General. bisacsh Algorithms fast Computer algorithms fast Data structures (Computer science) fast algorithms java data structures programming has work: Open data structures (Text) https://id.oclc.org/worldcat/entity/E39PCGmkxYBBwDGTrb4FbMyrYK https://id.oclc.org/worldcat/ontology/hasWork Morin, Pat, 1973- Open data structures.: Edmonton, AB : AU Press, Athabasca University, [2013] ©2013 Open paths to enriched learning OPEL (Open paths to enriched learning) (CaOONL)20139021701 (OCoLC)841710248 Open paths to enriched learning. http://id.loc.gov/authorities/names/no2014040548 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=638956 Volltext |
| spellingShingle | Morin, Pat, 1973- Open data structures : an introduction / Open paths to enriched learning. 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. 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. 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. 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. 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. Data structures (Computer science) http://id.loc.gov/authorities/subjects/sh85035862 Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Algorithms https://id.nlm.nih.gov/mesh/D000465 Structures de données (Informatique) Algorithmes. algorithms. aat COMPUTERS Programming Languages General. bisacsh Algorithms fast Computer algorithms fast Data structures (Computer science) fast |
| subject_GND | http://id.loc.gov/authorities/subjects/sh85035862 http://id.loc.gov/authorities/subjects/sh91000149 http://id.loc.gov/authorities/subjects/sh85003487 https://id.nlm.nih.gov/mesh/D000465 |
| title | Open data structures : an introduction / |
| title_auth | Open data structures : an introduction / |
| title_exact_search | Open data structures : an introduction / |
| title_full | Open data structures : an introduction / Pat Morin. |
| title_fullStr | Open data structures : an introduction / Pat Morin. |
| title_full_unstemmed | Open data structures : an introduction / Pat Morin. |
| title_short | Open data structures : |
| title_sort | open data structures an introduction |
| title_sub | an introduction / |
| topic | Data structures (Computer science) http://id.loc.gov/authorities/subjects/sh85035862 Computer algorithms. http://id.loc.gov/authorities/subjects/sh91000149 Algorithms. http://id.loc.gov/authorities/subjects/sh85003487 Algorithms https://id.nlm.nih.gov/mesh/D000465 Structures de données (Informatique) Algorithmes. algorithms. aat COMPUTERS Programming Languages General. bisacsh Algorithms fast Computer algorithms fast Data structures (Computer science) fast |
| topic_facet | Data structures (Computer science) Computer algorithms. Algorithms. Algorithms Structures de données (Informatique) Algorithmes. algorithms. COMPUTERS Programming Languages General. Computer algorithms |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=638956 |
| work_keys_str_mv | AT morinpat opendatastructuresanintroduction |