LEADER 04194nam 22006135 450 001 9910255454103321 005 20230810131729.0 010 $a3-319-70085-5 024 7 $a10.1007/978-3-319-70085-4 035 $a(CKB)4100000001794979 035 $a(DE-He213)978-3-319-70085-4 035 $a(MiAaPQ)EBC5578644 035 $a(PPN)22395599X 035 $a(EXLCZ)994100000001794979 100 $a20180102d2017 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aGuide to Data Structures $eA Concise Introduction Using Java /$fby James T. Streib, Takako Soma 205 $a1st ed. 2017. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017. 215 $a1 online resource (XIII, 376 p. 43 illus., 9 illus. in color.) 225 1 $aUndergraduate Topics in Computer Science,$x2197-1781 311 $a3-319-70083-9 320 $aIncludes bibliographical references and index. 327 $aPreliminary Concepts -- Stacks Using Arrays -- Queues Using Arrays -- Lists Using Arrays -- Lists Using Objects and References -- Ordered Linked Lists -- Stacks and Queues Using References -- Binary Trees -- Sorting -- Heaps -- Hashing. 330 $aThis accessible and engaging textbook/guide provides a concise introduction to data structures and associated algorithms. Emphasis is placed on the fundamentals of data structures, enabling the reader to quickly learn the key concepts, and providing a strong foundation for later studies of more complex topics. The coverage includes discussions on stacks, queues, lists, (using both arrays and links), sorting, and elementary binary trees, heaps, and hashing. This content is also a natural continuation from the material provided in the separate Springer title Guide to Java by the same authors. Topics and features: Reviews the preliminary concepts, and introduces stacks and queues using arrays, along with a discussion of array-based lists Examines linked lists, the implementation of stacks and queues using references, binary trees, a range of varied sorting techniques, heaps, and hashing Presents both primitive and generic data types in each chapter, and makes use of contour diagrams to illustrate object-oriented concepts Includes chapter summaries, and asks the reader questions to help them interact with the material Contains numerous examples and illustrations, and one or more complete program in every chapter Provides exercises at the end of each chapter, as well as solutions to selected exercises, and a glossary of important terms This clearly-written work is an ideal classroom text for a second semester course in programming using the Java programming language, in preparation for a subsequent advanced course in data structures and algorithms. The book is also eminently suitable as a self-study guide in either academe or industry. Dr. James T. Streib is a Professor of Computer Science at Illinois College, Jacksonville, IL, USA. Dr. Takako Soma is an Associate Professor of Computer Science at the same institution. 410 0$aUndergraduate Topics in Computer Science,$x2197-1781 606 $aArtificial intelligence$xData processing 606 $aComputer arithmetic and logic units 606 $aInformation retrieval 606 $aComputer architecture 606 $aData Science 606 $aArithmetic and Logic Structures 606 $aData Storage Representation 615 0$aArtificial intelligence$xData processing. 615 0$aComputer arithmetic and logic units. 615 0$aInformation retrieval. 615 0$aComputer architecture. 615 14$aData Science. 615 24$aArithmetic and Logic Structures. 615 24$aData Storage Representation. 676 $a005.73 700 $aStreib$b James T$4aut$4http://id.loc.gov/vocabulary/relators/aut$0987269 702 $aSoma$b Takako$4aut$4http://id.loc.gov/vocabulary/relators/aut 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910255454103321 996 $aGuide to Data Structures$92525631 997 $aUNINA