XWe have detected your location as outside the U.S/Canada, if you think this is wrong, you can choose your location.

Macmillan Higher Education Celebrating 20 years of Macmillan Study Skills

Cart

Continue Shopping
All prices are shown excluding Tax
The submitted promocode is invalid
Discount code already used. It can only be used once.
* Applied promocode: ×

Important information on your ebook order

Guide to Data Structures

A Concise Introduction Using Java

Author(s):
Publisher:

Springer

Pages: 376
Further Actions:

Recommend to library

AVAILABLE FORMATS

Paperback - 9783319700830

22 January 2018

$69.99

Free Shipping

In stock

Ebook - 9783319700854

30 December 2017

$54.99

In stock

All prices are shown excluding Tax

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...

Show More

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.

Show Less

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

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.

“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)​
Add a review

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.

Show More

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.

Show Less

New Publications 

Best Sellers