Data Structures and Algorithms

1. Front Matter

   Pages i-xvi

   PDF

2. Preliminaries

   • John Beidler

   Pages 1-47

3. Encapsulation

   • John Beidler

   Pages 49-89

4. Stacks

   • John Beidler

   Pages 91-120

5. Queues

   • John Beidler

   Pages 121-144

6. Lists

   • John Beidler

   Pages 145-179

7. Trees

   • John Beidler

   Pages 181-215

8. Tree Applications

   • John Beidler

   Pages 217-250

9. Graphs

   • John Beidler

   Pages 251-268

10. Sets

    • John Beidler

    Pages 269-286

11. Strings

    • John Beidler

    Pages 287-316

12. Sorting

    • John Beidler

    Pages 317-336

13. Search/Update

    • John Beidler

    Pages 337-354

14. Back Matter

    Pages 355-364

    PDF

This textbook provides an in depth course on data structures in the context of object oriented development. Its main themes are abstraction, implementation, encapsulation, and measurement: that is, that the software process begins with abstraction of data types, which then lead to alternate representations and encapsulation, and finally to resource measurement. A clear object oriented approach, making use of Booch components, will provide readers with a useful library of data structure components and experience in software reuse. Students using this book are expected to have a reasonable understanding of the basic logical structures such as stacks and queues. Throughout, Ada 95 is used and the author takes full advantage of Ada's encapsulation features and the ability to present specifications without implementational details. Ada code is supported by two suites available over the World Wide Web.

• Action
• Ada
• Ada 95
• algorithm
• algorithms
• data structure
• data structures
• algorithm analysis and problem complexity

• Department of Computing Sciences, University of Scranton, Scranton, USA

  John Beidler

Policies and ethics