Introducing Data Structures with Java
Data structures with their associated operations form an essential component of studies in computing, and this book sets out to provide a firm understanding of them. It deals with arrays, lists, queues, stacks, binary trees and graphs, and with algorithms for operations such as searching and sorting. Practical implementation, to promote sound understanding, is a key feature, and many example programs are developed, using a clear design process; full source code listings are supplied in each chapter and all of the programs are supplied on the CD-ROM.
Table of Content
- Some Basic Ideas
- Data Types
- Using Java
- File Input and Output
- Array Data Structures
- Searching Arrays
- Hashing and Hash Tables
- Sorting Arrays— Selection, Bubble, Insertion, Merge and Quick Sorts
- Linked Lists
- Queues
- Stacks
- Binary Trees
- Graphs
- Case Study 1—A Student Grades Program
- Case Study 2—An Inventory Table
- Case Study 3—A Flight Departures Timetable
- Case Study 4—A Queue Simulation
Index
|
Salient Features
- Four practical case studies that review and apply the topics covered
- Covers object-oriented software development: used to create object classes for the structures encountered
- Discusses comparative efficiency of algorithms: Big O notation
- Explains recursion: a powerful programming technique
- Self-test questions and exercises
|
|
|
|
|