Open data structures : : an introduction /

Open data structures : : an introduction / / Pat Morin.

Show other versions (1)

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...

Full description

Saved in:
Bibliographic Details
Superior document:OPEL (Open Paths to Enriched Learning)
VerfasserIn:
Morin, Pat,
Place / Publishing House:Edmonton, Alberta : : AU Press,, 2013.
©2013
Year of Publication:2013
Edition:31th ed.
Language:English
Series:Open paths to enriched learning.
Physical Description:1 online resource (337 p.)
Tags: Add Tag
No Tags, Be the first to tag this record!
id 993547585604498
ctrlnum (CKB)2550000001110823
(EBL)1350175
(OCoLC)856626663
(SSID)ssj0001139880
(PQKBManifestationID)11643331
(PQKBTitleCode)TC0001139880
(PQKBWorkID)11220556
(PQKB)10856757
(CEL)446449
(OCoLC)860709296
(CaBNVSL)slc00233256
(WaSeSS)IndRDA00056905
(Au-PeEL)EBL4839957
(CaPaEBR)ebr11376416
(OCoLC)986213633
(Au-PeEL)EBL4948061
(CaONFJC)MIL510715
(OCoLC)985346794
(oapen)https://directory.doabooks.org/handle/20.500.12854/55265
(VaAlCD)20.500.12592/k1ggpg
(MnU)OTLid0000171
(MiAaPQ)EBC4839957
(MiAaPQ)EBC1350175
(MiAaPQ)EBC3288517
(MiAaPQ)EBC4948061
(DE-B1597)665376
(DE-B1597)9781927356395
(EXLCZ)992550000001110823
collection bib_alma
record_format marc
spelling Morin, Pat, author.
Open data structures : an introduction / Pat Morin.
31th ed.
Athabasca University Press 2013
Edmonton, Alberta : AU Press, 2013.
©2013
1 online resource (337 p.)
text txt
computer c
online resource cr
OPEL (Open Paths to Enriched Learning)
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
English
Introduction -- Array-based lists -- Linked lists -- Skiplists -- Hash tables -- Binary trees -- Random binary search trees -- Scapegoat trees -- Red-black trees -- Heaps -- Sorting algorithms -- Graphs -- Data structures for integers -- External memory searching.
Includes bibliographical references and index.
Description based on online resource; title from PDF title page (ebrary, viewed May 10, 2017).
Data structures (Computer science)
Computer algorithms.
algorithms
java
data structures
programming
1-927356-38-5
1-299-79464-5
Open paths to enriched learning.
language English
format eBook
author Morin, Pat,
spellingShingle Morin, Pat,
Open data structures : an introduction /
OPEL (Open Paths to Enriched Learning)
Introduction -- Array-based lists -- Linked lists -- Skiplists -- Hash tables -- Binary trees -- Random binary search trees -- Scapegoat trees -- Red-black trees -- Heaps -- Sorting algorithms -- Graphs -- Data structures for integers -- External memory searching.
author_facet Morin, Pat,
author_variant p m pm
author_role VerfasserIn
author_sort Morin, Pat,
title Open data structures : an introduction /
title_sub 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_auth Open data structures : an introduction /
title_new Open data structures :
title_sort open data structures : an introduction /
series OPEL (Open Paths to Enriched Learning)
series2 OPEL (Open Paths to Enriched Learning)
publisher Athabasca University Press
AU Press,
publishDate 2013
physical 1 online resource (337 p.)
edition 31th ed.
contents Introduction -- Array-based lists -- Linked lists -- Skiplists -- Hash tables -- Binary trees -- Random binary search trees -- Scapegoat trees -- Red-black trees -- Heaps -- Sorting algorithms -- Graphs -- Data structures for integers -- External memory searching.
isbn 1-927356-39-3
1-927356-38-5
1-299-79464-5
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA76
callnumber-sort QA 276.9 D35 M675 42013
illustrated Illustrated
dewey-hundreds 000 - Computer science, information & general works
dewey-tens 000 - Computer science, knowledge & systems
dewey-ones 005 - Computer programming, programs & data
dewey-full 005.73
dewey-sort 15.73
dewey-raw 005.73
dewey-search 005.73
oclc_num 856626663
860709296
986213633
985346794
work_keys_str_mv AT morinpat opendatastructuresanintroduction
status_str n
ids_txt_mv (CKB)2550000001110823
(EBL)1350175
(OCoLC)856626663
(SSID)ssj0001139880
(PQKBManifestationID)11643331
(PQKBTitleCode)TC0001139880
(PQKBWorkID)11220556
(PQKB)10856757
(CEL)446449
(OCoLC)860709296
(CaBNVSL)slc00233256
(WaSeSS)IndRDA00056905
(Au-PeEL)EBL4839957
(CaPaEBR)ebr11376416
(OCoLC)986213633
(Au-PeEL)EBL4948061
(CaONFJC)MIL510715
(OCoLC)985346794
(oapen)https://directory.doabooks.org/handle/20.500.12854/55265
(VaAlCD)20.500.12592/k1ggpg
(MnU)OTLid0000171
(MiAaPQ)EBC4839957
(MiAaPQ)EBC1350175
(MiAaPQ)EBC3288517
(MiAaPQ)EBC4948061
(DE-B1597)665376
(DE-B1597)9781927356395
(EXLCZ)992550000001110823
carrierType_str_mv cr
hierarchy_parent_title OPEL (Open Paths to Enriched Learning)
is_hierarchy_title Open data structures : an introduction /
container_title OPEL (Open Paths to Enriched Learning)
_version_ 1798003760657596416
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03198nam a2200769 i 4500</leader><controlfield tag="001">993547585604498</controlfield><controlfield tag="005">20231206204003.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr -n---------</controlfield><controlfield tag="008">170510t20132013abca ob 001 0 eng d</controlfield><datafield tag="016" ind1=" " ind2=" "><subfield code="q">(print)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1-927356-39-3</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)2550000001110823</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EBL)1350175</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)856626663</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(SSID)ssj0001139880</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PQKBManifestationID)11643331</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PQKBTitleCode)TC0001139880</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PQKBWorkID)11220556</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PQKB)10856757</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CEL)446449</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)860709296</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaBNVSL)slc00233256</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(WaSeSS)IndRDA00056905</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL4839957</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaPaEBR)ebr11376416</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)986213633</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL4948061</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CaONFJC)MIL510715</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)985346794</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(oapen)https://directory.doabooks.org/handle/20.500.12854/55265</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(VaAlCD)20.500.12592/k1ggpg</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MnU)OTLid0000171</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)EBC4839957</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)EBC1350175</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)EBC3288517</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)EBC4948061</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)665376</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)9781927356395</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)992550000001110823</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">xxc</subfield><subfield code="c">CA</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.9.D35</subfield><subfield code="b">.M675 2013</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">COM062000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.73</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Morin, Pat,</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="250" ind1=" " ind2=" "><subfield code="a">31th ed.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="b">Athabasca University Press</subfield><subfield code="c">2013</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Edmonton, Alberta :</subfield><subfield code="b">AU Press,</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 (337 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">OPEL (Open Paths to Enriched Learning)</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="546" ind1=" " ind2=" "><subfield code="a">English</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Introduction -- Array-based lists -- Linked lists -- Skiplists -- Hash tables -- Binary trees -- Random binary search trees -- Scapegoat trees -- Red-black trees -- Heaps -- Sorting algorithms -- Graphs -- Data structures for integers -- External memory searching.</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references and index.</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (ebrary, viewed May 10, 2017).</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computer algorithms.</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="776" ind1=" " ind2=" "><subfield code="z">1-927356-38-5</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">1-299-79464-5</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Open paths to enriched learning.</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2024-05-03 05:33:33 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2013-09-07 19:12:41 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="i">DOAB Directory of Open Access Books</subfield><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&amp;portfolio_pid=5338548270004498&amp;Force_direct=true</subfield><subfield code="Z">5338548270004498</subfield><subfield code="b">Available</subfield><subfield code="8">5338548270004498</subfield></datafield></record></collection>

Similar Items