Skip to main content

Guide to Data Structures

A Concise Introduction Using Java

  • Textbook
  • © 2017

Overview

  • Stresses the fundamentals, supporting the text with numerous illustrations and examples
  • Presents a complete program, a summary of key concepts, and exercises in each chapter
  • Contains a glossary of key terms, and answers to selected exercises
  • Includes supplementary material: sn.pub/extras

Part of the book series: Undergraduate Topics in Computer Science (UTICS)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others

Keywords

Table of contents (11 chapters)

Reviews

“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)​

Authors and Affiliations

  • Illinois College, Jacksonville, USA

    James T. Streib, Takako Soma

About the authors

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.

Bibliographic Information

Publish with us