ADA Plus Data Structures: An Object-oriented Approach
Newly updated using Ada 2005, Ada Plus Data Structures: An Object-Oriented Approach, Second Edition is the most up-to-date, student-friendly Ada based text available. The text introduces, and discusses in detail, such familiar topics as sets, strings, stacks, queues, lists, trees, and graphs from an object-oriented point of view. The recurring theme throughout the text is modeling with levels of abstraction, presenting each class from three different perspectives: their specification, sample applications, and one or more implementations. Using this approach, the authors stress computer science theory and software engineering principles including: information hiding, data encapsulation, data abstraction, life-cycle verification, and designing for correctness. With its object-oriented presentation, real-world applications, and traditional Dale pedagogy, Ada Plus Data Structures remains the leading text in the field.
access types access value access variable address book allocation application array-based begin return binary search tree binary tree Bingo numbers bounded-length string bubble sort chapter characters contains data structure data type declaration defined Delete Dequeue doubly linked list Element with key Element_Type elsif empty end loop end record Enqueue error example Figure graph hash function hash table heap Index Info information hiding input Insert insertion sort instantiate integer Item iteration Key_Of Key_Type key-ordered list Left List_Type Location loop exit loop invariant Max_Size maze memory Node_Ptr Node_Type null number of elements object operations package body parameter pointer Postconditions Preconditions Pred_Loc priority queue private type problem procedure radix sort recursive call Result return Boolean Right root node selection sort sequential Set_Type slot sort algorithm Specification stack stored subprogram subtree subtype Swap tion Traverse vertex Write