000 04018nam a22004815i 4500
001 978-3-319-70085-4
003 DE-He213
005 20200812110143.0
007 cr nn 008mamaa
008 180102s2017 gw | s |||| 0|eng d
020 _a9783319700854
_9978-3-319-70085-4
024 7 _a10.1007/978-3-319-70085-4
_2doi
040 _cCUS
050 4 _aQA76.9.D35
072 7 _aUMB
_2bicssc
072 7 _aCOM062000
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a005.73
_223
100 1 _aStreib, James T.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aGuide to Data Structures
_h[electronic resource] :
_bA Concise Introduction Using Java /
_cby James T. Streib, Takako Soma.
250 _a1st ed. 2017.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2017.
300 _aXIII, 376 p. 43 illus., 9 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aUndergraduate Topics in Computer Science,
_x1863-7310
505 0 _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.
520 _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.
650 0 _aData structures (Computer science).
650 0 _aArithmetic and logic units, Computer.
650 1 4 _aData Structures.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I15017
650 2 4 _aArithmetic and Logic Structures.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I12026
650 2 4 _aData Storage Representation.
_0https://scigraph.springernature.com/ontologies/product-market-codes/I15025
700 1 _aSoma, Takako.
830 0 _aUndergraduate Topics in Computer Science,
_x1863-7310
856 4 0 _uhttps://doi.org/10.1007/978-3-319-70085-4
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
942 _cEBK
999 _c205301
_d205301