
Guide to Data Structures
A Concise Introduction Using Java
Springer (Publisher)
1st Edition
Published on 22. January 2018
Book
Paperback/Softback
XIII, 376 pages
978-3-319-70083-0 (ISBN)
Description
This 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.
Reviews / Votes
"This text is intended to provide undergraduates using Java with a concise, focused, and relatively simple coverage of some of the basic data structures in use. These include arrays, linked lists, trees, heaps (in arrays), and hash tables. . The book covers the algorithms and data structures well with clear language, abundant diagrams, and good exercises. It could be a good introduction for curricula using Java as a primary teaching language." (Jeffrey Putnam, Computing Reviews, July, 2018)More details
Product info
Paperback
Series
Edition
1st ed. 2017
Language
English
Place of publication
Cham
Switzerland
Publishing group
Springer International Publishing
Target group
Professional and scholarly
Illustrations
34
5 farbige Tabellen, 9 farbige Abbildungen, 34 s/w Abbildungen
XIII, 376 p. 43 illus., 9 illus. in color.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 22 mm
Weight
593 gr
ISBN-13
978-3-319-70083-0 (9783319700830)
DOI
10.1007/978-3-319-70085-4
Schweitzer Classification
Other editions
Additional editions

E-Book
12/2017
Springer
€64.19
Available for download
Persons
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.
Content
Preliminary 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