LEADER 03176nam  2200805   450 
001 9910139028803321
005 20231206204003.0
010   $a1-927356-39-3
035   $a(CKB)2550000001110823
035   $a(EBL)1350175
035   $a(OCoLC)856626663
035   $a(SSID)ssj0001139880
035   $a(PQKBManifestationID)11643331
035   $a(PQKBTitleCode)TC0001139880
035   $a(PQKBWorkID)11220556
035   $a(PQKB)10856757
035   $a(CEL)446449
035   $a(OCoLC)860709296
035   $a(CaBNVSL)slc00233256
035   $a(WaSeSS)IndRDA00056905
035   $a(Au-PeEL)EBL4839957
035   $a(CaPaEBR)ebr11376416
035   $a(OCoLC)986213633
035   $a(Au-PeEL)EBL4948061
035   $a(CaONFJC)MIL510715
035   $a(OCoLC)985346794
035   $a(oapen)https://directory.doabooks.org/handle/20.500.12854/55265
035   $a(VaAlCD)20.500.12592/k1ggpg
035   $a(MnU)OTLid0000171
035   $a(MiAaPQ)EBC4839957
035   $a(MiAaPQ)EBC1350175
035   $a(MiAaPQ)EBC3288517
035   $a(MiAaPQ)EBC4948061
035   $a(EXLCZ)992550000001110823
100   $a20170510h20132013  uy             0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 10$aOpen data structures $ean introduction /$fPat Morin
205   $a31th ed.
210   $cAthabasca University Press$d2013
210  1$aEdmonton, Alberta :$cAU Press,$d2013.
210  4$dİ2013
215   $a1 online resource (337 p.)
225 1 $aOPEL (Open Paths to Enriched Learning)
311   $a1-927356-38-5 
311   $a1-299-79464-5 
320   $aIncludes bibliographical references and index.
327   $aIntroduction -- 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.
330   $aOffered 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
410  0$aOpen paths to enriched learning.
606   $aData structures (Computer science)
606   $aComputer algorithms
610   $aalgorithms
610   $ajava
610   $adata structures
610   $aprogramming
615  0$aData structures (Computer science)
615  0$aComputer algorithms.
676   $a005.73
700   $aMorin$b Pat$0802741
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910139028803321
996   $aOpen data structures$91927619
997   $aUNINA