Data Abstraction and Problem Solving with Java
Home > Computing and Information Technology > Computer programming / software engineering > Web programming > Data Abstraction and Problem Solving with Java: Walls and Mirrors
Data Abstraction and Problem Solving with Java: Walls and Mirrors

Data Abstraction and Problem Solving with Java: Walls and Mirrors


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

This book is based on the classic "Walls and Mirrors" approach used in the best-selling Data Abstraction and Problem Solving with C++, and is now updated to the Java programming language. It uses the running theme of "Walls and Mirrors" to help make clear the challenging concepts of recursion (the mirrors) and data abstraction (the walls). Authors Carrano and Prichard cover key object-oriented concepts, including encapsulation, inheritance, and polymorphism. However, the focus of the book remains on data abstraction.

Table of Contents:
(NOTE: Each chapter concludes with a Summary, Cautions, Self-Test Exercises, Exercises and Programming Problems.)I. PROBLEM-SOLVING TECHNIQUES. 1. Principles of Programming and Software Engineering. Problem Solving and Software Engineering. What Is Problem Solving. The Life Cycle of Software. What Is a Good Solution. Achieving a Modular Design. Abstraction and Information Hiding. Object-Oriented Design. Top-Down Design. General Design Guidelines. A Summary of Key Issues in Programming. Modularity. Modifiability. Ease of Use. Fail-Safe Programming. Style. Debugging. 2. Recursion: The Mirrors. Recursive Solutions. A Recursive Valued Method: The Factorial of n. A Recursive Void Method: Writing a String Backward. Counting Things. Multiplying Rabbits (The Fibonacci Sequence). Organizing a Parade. Mr. Spock's Dilemma (Choosing k out of n Things). Searching an Array. Finding the Largest Item in an Array. Binary Search. Finding the kth Smallest Item of an Array. Organizing Data. The Towers of Hanoi. Recursion and Efficiency. 3. Data Abstraction: The Walls. Abstract Data Types. Specifying ADTs. The ADT List. The ADT Sorted List. Designing an ADT. Axioms (Optional). Implementing ADTs. Java Classes. Java Interfaces. Java Exceptions. An Array-Based Implementation of the ADT List. 4. Linked Lists. Preliminaries. Object References. Resizeable Arrays. Reference-Based Linked Lists. Programming with Linked Lists. Displaying the Contents of a Linked List. Deleting a Specified Node from a Linked List. Inserting a Node into a Specified Position of a Linked List. A Reference-Based Implementation of the ADT List. Comparing Array-Based and Reference-Based Implementations. Passing a Linked List to a Method. Processing Linked Lists Recursively. Variations of the Linked List. Tail References. Circular Linked Lists. Dummy Head Nodes. Doubly Linked Lists. Application: Maintaining an Inventory. 5. Recursion as a Problem-Solving Technique. Backtracking. The Eight Queens Problem. Defining Languages. The Basics of Grammars. Two Simple Languages. Algebraic Expressions. The Relationship Between Recursion and Mathematical Induction. The Correctness of the Recursive Factorial Method. The Cost of Towers of Hanoi. II. PROBLEM SOLVING WITH ABSTRACT DATA TYPES. 6. Stacks. The Abstract Data Type Stack. Developing an ADT During the Design of a Solution. Simple Applications of the ADT Stack. Checking for Balanced Braces. Recognizing Strings in a Language. Implementations of the ADT Stack. An Array-Based Implementation of the ADT Stack. A Reference-Based Implementation of the ADT Stack. An Implementation That Uses the ADT List. Comparing Implementations. Application: Algebraic Expressions. Evaluating Postfix Expressions. Converting Infix Expressions to Equivalent Postfix Expressions. Application: A Search Problem. A Nonrecursive Solution That Uses a Stack. A Recursive Solution. The Relationship Between Stacks and Recursion. 7. Queues. The Abstract Data Type Queue. Simple Applications of the ADT Queue. Reading a String of Characters. Recognizing Palindromes. Implementations of the ADT Queue. A Reference-Based Implementation. An Array-Based Implementation. An Implementation That Uses the ADT List. Comparing Implementations. A Summary of Position-Oriented ADTs. Application: Simulation. 8. Class Relationships. Inheritance Revisited. Java Packages. Java Access Modifiers. Is-a and Has-a Relationships. Dynamic Binding and Abstract Classes. Abstract Classes. Java Interfaces Revisited (Iterators). The ADTs LIST and Sorted List Revisited. Implementations of A List Iterator. Implementations of the ADT Sorted List That Use the ADT List. The Advantages of an Object-Oriented Approach. 9. Algorithm Efficiency and Sorting. Determining the Efficiency of Algorithms. The Execution Time of Algorithms. Algorithm Growth Rates. Order-of-Magnitude Analysis and Big O Notation. Keeping Your Perspective. The Efficiency of Searching Algorithms. Sorting Algorithms and Their Efficiency. Selection Sort. Bubble Sort. Insertion Sort. Mergesort. Quicksort. Radix Sort. A Comparison of Sorting Algorithms. 10. Trees. Terminology. The ADT Binary Tree. Basic Operations of the ADT Binary Tree . General Operations of the ADT Binary Tree. Traversals of a Binary Tree. Possible Representations of a Binary Tree. A Reference-Based Implementation of the ADT Binary Tree. Tree Traversals Using an Iterator. The ADT Binary Search Tree. Algorithms for the Operations of the ADT Binary Search Tree. A Reference-Based Implementation of the ADT Binary Search Tree. The Efficiency of Binary Search Tree Operations. Treesort. Saving a Binary Search Tree in a File. General Trees. 11. Tables and Priority Queues. The ADT Table. Selecting an Implementation. A Sorted Array-Based Implementation of the ADT Table. A Binary Search Tree Implementation of the ADT Table. The ADT Priority Queue: A Variation of the ADT Table. Heaps. A Heap Implementation of the ADT Priority Queue. Heapsort. 12. Advanced Implementation of Tables. Balanced Search Trees. 2-3 Trees. 2-3-4 Trees. Red-Black Trees. AVL Trees. Hashing. Hash Functions. Resolving Collisions. The Efficiency of Hashing. What Constitutes a Good Hash Function? Table Traversal: An Inefficient Operation Under Hashing. Data with Multiple Organizations. 13. Graphs. Terminology. Graphs as ADTs. Implementing Graphs. Graph Traversals. Depth-First Search. Breadth-First Search. Applications of Graphs. Topological Sorting. Spanning Trees. Minimum Spanning Trees. Shortest Paths. Circuits. Some Difficult Problems. 14. External Methods. A Look at External Storage. Sorting Data in an External File. External Tables. Indexing an External File. External Hashing. B-Trees. Traversals. Multiple Indexing. Appendix A: Review of Java Fundamentals. Program Structure. Packages. Classes. Data Fields. Methods. How to Access Members of an Object. Language Basics. Comments. Identifiers and Keywords. Variables. Primitive Data Types. References. Literal Constants. Named Constants. Assignments and Expressions. Arrays. Useful Java Classes. The Object Class. String Classes. Java Exceptions. Catching Exceptions. Throwing Exceptions. Text Input and Output. Input Output. Selection Statements. The if Statement. The switch Statement. Iteration Statements. The while Statement. The for Statement. The do Statement. File Input and Output. Text Files. Object Serialization. A Comparison to C++. Appendix B: Unicode Character Codes (ASCII Subset).. Appendix C: Java Resources. Appendix D: Mathematical Induction. Glossary. Answers to Self-Test Exercises. Index.

About the Author :
Frank M. Carrano is Associate Professor of Computer Science at the University of Rhode Island. Janet J. Prichard is a is professor of computer science at East Carolina University. She received her Ph.D. from the University of Rhode Island. Her areas of interest include real-time semantic objects, relationships, and constraints. 0201702207AB04062001


Best Sellers


Product Details
  • ISBN-13: 9780201702200
  • Publisher: Pearson Education (US)
  • Publisher Imprint: Pearson
  • Height: 261 mm
  • No of Pages: 806
  • Sub Title: Walls and Mirrors
  • Width: 208 mm
  • ISBN-10: 0201702207
  • Publisher Date: 01 Aug 2000
  • Binding: Hardback
  • Language: English
  • Spine Width: 33 mm
  • Weight: 1640 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Data Abstraction and Problem Solving with Java: Walls and Mirrors
Pearson Education (US) -
Data Abstraction and Problem Solving with Java: Walls and Mirrors
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.

Data Abstraction and Problem Solving with Java: Walls and Mirrors

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!