Software Construction and Data Structures with Ada 95
Home > Computing and Information Technology > Computer programming / software engineering > Algorithms and data structures > Software Construction and Data Structures with Ada 95
Software Construction and Data Structures with Ada 95

Software Construction and Data Structures with Ada 95

|
     0     
5
4
3
2
1




Out of Stock


Notify me when this book is in stock
About the Book

Using Ada 95, this book covers classical data structures and algorithms in a software engineering context. Through the use of generic abstract data types (ADT) packages, this text gives a realistic view of system development using reusable components. The book contains over 200 complete and compilable package specifications, implementations, and programs, which are compatible with any Ada compiler.

Table of Contents:
(Each chapter concludes with "Exercises".) 1. Abstraction and the Ada Type System. Your Ada Starting Points. Some Ada 95 Changes. The Life Cycle of Software Development. The Goals of Software Engineering. Using Abstraction to Manage Complexity. A Quick Tour of the Ada Type System. A Set of Numeric Types for This Book. Abstract Data Types (ADTs). Object-Oriented Programming. A Predefined ADT: the Ada.Calendar Package. Application: Time Around the World. A Predefined ADT: Strings in Ada. Exercises. 2. Writing Abstract Data Types. ADT Design: Rational Numbers. Developing a Test Plan. ADT Design: an ADT for Dollars and Cents. ADT Design: Calendar Dates. ADT Design: Simple Screen Handler. ADT Design: Simple Window Manager. A Few More Ada 95 Topics. Exercises. 3. Algorithms, Recursion, Performance Prediction, and Performance Measurement. Algorithms and Algorithm Design. Recursive Algorithms. Performance Prediction and the "Big O" Notation. Design: An ADT for Keyed Tables. Application: A Simple Employee Database. Measuring Program Performance. Exercises. 4. Multidimensional and Unconstrained Array Types. Data Structures: Multidimensional Arrays. Data Structures: Unconstrained Array Types. Application: A General Sorting Program. ADT Design: Mathematical Vectors. ADT Design: Mathematical Matrices. Storage Mappings. Exercises. 5. Generic Subprograms and Packages. Ada Structures: Generic Units. Application: A Generic Sorting Program. Application: a Generic Binary Search Program. ADT Design: An Abstract Data Type for Sets. Application: Music Makers. ADT Design: A Generic Vector Package. Summary of Generic Specifications. ADT Design: Generic Keyed Table Handler. ADT Design: A Generic Backup Package. Application: Airline Passenger List. ADT Design: ADTs versus Abstract Data Objects. Exercises. 6. Variant and Tagged Record Types. Ada Structures: Variant Records. ADT Design: Geometric Figures. ADT Design: Metric System. ADT Design: Variable-Length Strings. Ada Structures: Strings in Ada 95. Ada Structures: Tagged Types. Exercises. 7. Queues and Stacks. Queues and Stacks Introduced. ADT Design: FIFO Queues. ADT Design: Priority Queues. ADT Design: Stacks. Expression Evaluation and Polish Notation. Application: An Infix-to-RPN Translator Program. Application: An Event-Driven Simulation. Exercises. 8. Access Types and Dynamic Data Structures. Ada Structures: Access Types and the NEW Operator. Data Structures: Singly Linked Lists. Recursive Implementations of Linked-List Operations. Iterative Implementation of Linked-List Operations. Linked Lists with Head and Tail Pointers. Ordered Insertions in Linked Lists. Debugging Programs with Linked Lists. Exercises. 9. Linked List Applications. ADT Design: A Generic ADT for Singly-Linked Lists. Allocation Using a List of Available Space (LAVS). ADT Design: Unbounded Queues and Stacks. ADT Design: The Keyed Table as a Linked List. Application: The Airline Passenger List Again. ADT Design: Passive and Active Iterators. ADT Design: Unbounded Variable-Length Strings. Application: Sparse Vectors and Matrices. Simulating Dynamic Memory Management. Ada Structures: Ada 95 Unbounded Strings. Ada Structures: Ada 95 General Access Types. Heterogeneous Structures and Dynamic Dispatching. Exercises. 10. Directed Graphs. Undirected and Directed Graphs. Properties of Digraphs. Implementations of Directed Graphs. Graph Traversals. A Generic ADT for Directed Graphs. Application: A Simple Lexical Scanner. Exercises. 11. Binary Trees. Trees. Properties of Binary Trees. Implementing Binary Trees. Traversals of Binary Trees. Expression Trees. Application: Building an Expression Tree. Binary Search Trees (BSTs). ADT Design: The Keyed Table as a BST. Application: A Cross-Reference Generator. Subprogram Pointers and Table-Driven Programming. Exercises. 12. Advanced Tree Concepts. Threaded Binary Search Trees. Heaps. Application: The Priority Queue as a Heap. Digital Search Trees. AVL Balanced Binary Search Trees. B-Trees. Exercises. 13. Hash Table Methods. Sequential and Binary Search Revisited. The Hash Table. Choosing a Hash Function. Resolving Collisions in Hash Tables. Hybrid Search Strategies. Exercises. 14. Internal Sorting Methods. Introduction. O(N2) Sorts: Simple Selection Sort. O(N2) Sorts: Delayed Selection Sort. O(N2) Sorts: Bubble Sort. O(N2) Sorts: Linear Insertion Sort. O(N log N) Sorts: Merge Sort. O(N log N) Sorts: Heap Sort. O(N log N) Sorts: Quick Sort. Other Sorts: Shell Sort. Other Sorts: Quadratic Selection Sort. Other Sorts: Radix Sort. Exercises. 15. Introduction to Concurrent Programming. What Is Concurrent Programming? Ada Structures: Task Types and Task Objects. Ada Structures: Protected Types and Protected Objects. Data Structures: The Task as a Data Structure. Application: Simulation of a Bank. Application: The Dining Philosophers. Chapter Review. Exercises. Appendices. A. The Ada Character Set, Delimiters, and Reserved Words. B. Ada 95 Syntax Rules. C. The Ada Predefined Language Environment. D. Specification of the Package Ada.Text_IO. E. Specification of the Package Ada.Calendar. F. Specification of the Ada Math Libraries. G. Specification of the Ada String Libraries Used in this Book. H. Summary of Ada Execution-Time Exceptions. I. Ada Hints for Pascal Users. J. Timing Algorithm Performance on a Shared Computer.


Best Sellers


Product Details
  • ISBN-13: 9780201887952
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Pearson
  • Height: 188 mm
  • No of Pages: 648
  • Weight: 940 gr
  • ISBN-10: 0201887959
  • Publisher Date: 26 Jul 1996
  • Binding: Hardback
  • Language: English
  • Spine Width: 27 mm
  • Width: 235 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Software Construction and Data Structures with Ada 95
Pearson Education (US) -
Software Construction and Data Structures with Ada 95
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Software Construction and Data Structures with Ada 95

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!