| |
Description: Ada Plus Data Structures is the most up-to-date, student-friendly Ada text available. The text introduces and discusses such familiar topics as strings, sets, stacks, queues, lists, trees, graphs, and much more. The recurring theme throughout the text is modeling with levels of abstraction, presenting each class from three different perspectives: their specification, their abstraction, and their implementation. Using this approach, the authors stress computer science theory and software engineering principles including information hiding, data encapsulation, data abstraction, stepwise refinement, and visual aids. With its Object-Oriented presentation, real-world applications, and traditional Dale Pedagogy, Ada Plus Data Structures is a pleasure to read and learn from.
• New and key features: Dale and McCormick provide an accessible introduction to object-oriented design methodologies, balanced with a clear presentation of traditional abstract data types, computer science theory, and software engineering practices • Unified Modeling Language ( UML) class diagrams and object-oriented approaches are used throughout the book • Expanded coverage of hashing • Reviews of principle Ada constructs are included within the text as a refresher for students • Includes the object.operation syntax as an alternative to the traditional package-operation syntax for invoking class operations • Introduces the Ada container class library • Many new chapter exercises and programming problems.
Contents: The software process • Program design • Verification of software correctness • Summary • Exercises • Data design and implementation • Different views of data • Ada’s built-in types • Packages • Child packages • Summary • Exercises • Sets with an introduction to generic units • The abstract level • The application level • The implementation level • Programming for reuse: Generic units • Summary • Exercises • Strings with introduction to access types • String terminology • The application level • The implementation level • Stacks with introductions to linked lists and big-O • The logical level • The Application level • The implementation level • Comparing implementations • FIFO queues with introduction to general access types and class-wide types • The logical level • The application level • The implementation level • Comparing the queue implementations • Testing the queue operations • Heterogeneous collections • Key-ordered lists • The logical level • The application level • The implementation level • Testing the list operations • Lists Plus • Circular linked lists • Doubly linked lists • Linked lists with dummy nodes • The linked lists as an array of nodes • Programming with recursion • What is Recursion? • The classic example of recursion • Programming recursively • Verifying recursive procedures and functions • Writing recursive procedures and functions • Using recursion to simplify solutions- Three examples • A recursive version of binary search • Debugging recursive routines • How recursion works • Removing recursion • Deciding whether to use a recursive solution • Binary search trees • Trees • The logical level • The application level • The implementation level • Comparing binary speech trees to linear lists • A nonlinked representation of binary trees • Priority queues, heaps and graphs • Sorting and searching algorithms • O(N Log2 N) Sorts • Radix sort • Efficiency considerations • More sorting considerations • Summary-sorting • Searching • Hashing • Summary-Searching • Exercises • Glossary • IndexISBN - 9788130909776
|
| |
Pages : 924
|