03176nam 2200805 450 991013902880332120231206204003.01-927356-39-3(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(EXLCZ)99255000000111082320170510h20132013 uy 0engur|n|---|||||txtccrOpen data structures an introduction /Pat Morin31th ed.Athabasca University Press2013Edmonton, Alberta :AU Press,2013.©20131 online resource (337 p.)OPEL (Open Paths to Enriched Learning)1-927356-38-5 1-299-79464-5 Includes bibliographical references and index.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.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 undergraduateOpen paths to enriched learning.Data structures (Computer science)Computer algorithmsalgorithmsjavadata structuresprogrammingData structures (Computer science)Computer algorithms.005.73Morin Pat802741MiAaPQMiAaPQMiAaPQBOOK9910139028803321Open data structures1927619UNINA