9780201702200

Data Abstraction and Problem Solving With Java: Walls and Mirrors

by ;
  • ISBN13:

    9780201702200

  • ISBN10:

    0201702207

  • Format: Hardcover
  • Copyright: 7/1/2000
  • Publisher: Pearson College Div
  • View Upgraded Edition

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping On Orders Over $59!
    Your order must be $59 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $99.00 Save up to $64.35
  • Rent Book $34.65
    Add to Cart Free Shipping

    TERM
    PRICE
    DUE
    HURRY! ONLY 1 COPY IN STOCK AT THIS PRICE

Supplemental Materials

What is included with this book?

  • The Used and Rental copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Summary

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

Part I Problem-Solving Techniques 1(244)
Principles of Programming and Software Engineering
3(44)
Recursion: The Mirrors
47(58)
Data Abstraction: The Walls
105(46)
Linked Lists
151(60)
Recursion as a Problem-Solving Technique
211(34)
Part II Problem Solving with Abstract Data Types 245(512)
Stacks
247(50)
Queues
297(36)
Class Relationships
333(38)
Algorithm Efficiency and Sorting
371(50)
Trees
421(76)
Tables and Priority Queues
497(44)
Advanced Implementations of Tables
541(70)
Graphs
611(38)
External Methods
649(108)
Appendices
A Review of Java Fundamentals
689(58)
B Unicode Character Codes (ASCII Subset)
747(2)
C Java Resources
749(2)
D Mathematical Induction
751(6)
Glossary 757(18)
Answers to Self-Test Questions 775(16)
Index 791

Rewards Program

Write a Review