Data Abstraction and Problem Solving with Java
Frank M. Carrano, Janet Prichard
- 出版商: Addison Wesley
- 出版日期: 2000-07-19
- 售價: $980
- 貴賓價: 9.8 折 $960
- 語言: 英文
- 頁數: 806
- 裝訂: Hardcover
- ISBN: 0201702207
- ISBN-13: 9780201702200
-
相關分類:
Java 程式語言
無法訂購
買這商品的人也買了...
-
System Software: An Introduction to Systems Programming, 3/e (Paperback)$6,790$6,451 -
Visual C++ 6 教學手冊 (Beginning Visual C++ 6)$580$458 -
神奇樂團 (Band In A Box Pro)$123$117 -
SQL Server 2000 應用程式指南 (SQL Server 2000 Developer's Guide)$990$495 -
精通 Java Swing 程式設計$650$553 -
Performance Testing Microsoft .NET Web Applications$1,670$1,587 -
JavaScript 範例活用辭典$450$351 -
C++ Builder 6 完全攻略$690$587 -
PHP & MySQL 完全架站攻略第二版$620$558 -
ASP.NET 程式設計徹底研究$590$466 -
精通 Visual Basic.NET 中文版黑皮書 (Visual Basic.NET Black Book)$750$585 -
Programming .NET Components$1,550$1,473 -
STRUTS 實作手冊(Struts in Action: Building Web Applications with the Leading Java Framework)$690$538 -
重構─改善既有程式的設計$720$569 -
鳥哥的 Linux 私房菜－伺服器架設篇$750$675 -
鳥哥的 Linux 私房菜─基礎學習篇增訂版$560$504 -
SCJP‧SCJD 專業認證指南 (Sun Certified Programmer & Developer for Java 2 #310-305 與310-027)$850$723 -
Network Security Assessment$1,550$1,473 -
JSP 2.0 技術手冊$750$593 -
建構嵌入式 Linux 系統$780$616 -
JSP 與 Servlet 500 個應用範例技巧大全集$590$460 -
最新 JavaScript 完整語法參考辭典 第三版$490$382 -
Windows 程式設計使用 MFC (Programming Windows with MFC, 2/e)$990$782 -
視窗程式設計函式庫：Win 32 API(上)─打開視窗的秘密$680$578 -
Java 2 全方位學習(J2SE 5.0 增修版)$750$593
商品描述
Description
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. 
Java Data Structures/CS2.
Features
- Provides a firm foundation in data abstraction (the walls), emphasizing the distinction between specification and implementation as the foundation for the object-oriented approach. Pg.__
- Offers extensive coverage of recursion (the mirrors) and uses the technique throughout many examples and exercises. Pg.__
- Introduces analysis of algorithms and Big "O" notation. Pg.__
- Provides an appendix covering basic Java syntax for those who know a different language or who need a refresher. Pg.__
- Contains many pedagogical study aids such as margin notes, cautionary warnings about common errors, programming projects, specifications for all major ADTs in both English and pseudecode, and self-test exercises with answers. Pg.__
- A proven approach, adapted from the best selling Data Abstraction and Problem Solving with C++. Pg.__
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.
2. Recursion: The Mirrors.
3. Data Abstraction: The Walls.
4. Linked Lists.
5. Recursion as a Problem-Solving Technique.
Problem Solving and Software Engineering.
Achieving a Modular Design.
A Summary of Key Issues in Programming.
What Is Problem Solving.
The Life Cycle of Software.
What Is a Good Solution.
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.
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.
Modifiability.
Ease of Use.
Fail-Safe Programming.
Style.
Debugging.
2. Recursion: The Mirrors.
Recursive Solutions.
Counting Things.
Searching an Array.
Organizing Data.
Recursion and Efficiency.
A Recursive Valued Method: The Factorial of n.
A Recursive Void Method: Writing a String Backward.
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).
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.
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.
Implementing ADTs.
Specifying ADTs.
The ADT List.
The ADT Sorted List.
Designing an ADT.
Axioms (Optional).
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.
Java Interfaces.
Java Exceptions.
An Array-Based Implementation of the ADT List.
4. Linked Lists.
Preliminaries.
Programming with Linked Lists.
Variations of the Linked List.
Application: Maintaining an Inventory.
Object References.
Resizeable Arrays.
Reference-Based Linked Lists.
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.
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.
Circular Linked Lists.
Dummy Head Nodes.
Doubly Linked Lists.
Application: Maintaining an Inventory.
5. Recursion as a Problem-Solving Technique.
Backtracking.
Defining Languages.
The Relationship Between Recursion and Mathematical Induction.
The Eight Queens Problem.
Defining Languages.
The Basics of Grammars.
Two Simple Languages.
Algebraic Expressions.
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.
The Cost of Towers of Hanoi.
II. PROBLEM SOLVING WITH ABSTRACT DATA TYPES.
6. Stacks.
7. Queues.
8. Class Relationships.
9. Algorithm Efficiency and Sorting.
10. Trees.
11. Tables and Priority Queues.
12. Advanced Implementation of Tables.
13. Graphs.
14. External Methods.
Appendix A: Review of Java Fundamentals.
Appendix B: Unicode Character Codes (ASCII Subset)..
Appendix C: Java Resources.
Appendix D: Mathematical Induction.
Glossary.
Answers to Self-Test Exercises.
Index.
The Abstract Data Type Stack.
Simple Applications of the ADT Stack.
Implementations of the ADT Stack.
Application: Algebraic Expressions.
Application: A Search Problem.
The Relationship Between Stacks and Recursion.
Developing an ADT During the Design of a Solution.
Simple Applications of the ADT Stack.
Checking for Balanced Braces.
Recognizing Strings in a Language.
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.
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.
Converting Infix Expressions to Equivalent Postfix Expressions.
Application: A Search Problem.
A Nonrecursive Solution That Uses a Stack.
A Recursive Solution.
A Recursive Solution.
The Relationship Between Stacks and Recursion.
7. Queues.
The Abstract Data Type Queue.
Simple Applications of the ADT Queue.
Implementations of the ADT Queue.
A Summary of Position-Oriented ADTs.
Application: Simulation.
Simple Applications of the ADT Queue.
Reading a String of Characters.
Recognizing Palindromes.
Recognizing Palindromes.
Implementations of the ADT Queue.
A Reference-Based Implementation.
An Array-Based Implementation.
An Implementation That Uses the ADT List.
Comparing Implementations.
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.
Dynamic Binding and Abstract Classes.
The ADTs LIST and Sorted List Revisited.
The Advantages of an Object-Oriented Approach.
Java Packages.
Java Access Modifiers.
Is-a and Has-a Relationships.
Java Access Modifiers.
Is-a and Has-a Relationships.
Dynamic Binding and Abstract Classes.
Abstract Classes.
Java Interfaces Revisited (Iterators).
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.
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.
Sorting Algorithms and Their Efficiency.
The Execution Time of Algorithms.
Algorithm Growth Rates.
Order-of-Magnitude Analysis and Big O Notation.
Keeping Your Perspective.
The Efficiency of Searching 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.
Bubble Sort.
Insertion Sort.
Mergesort.
Quicksort.
Radix Sort.
A Comparison of Sorting Algorithms.
10. Trees.
Terminology.
The ADT Binary Tree.
The ADT Binary Search Tree.
General Trees.
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.
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.
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.
The ADT Priority Queue: A Variation of the ADT Table.
Selecting an Implementation.
A Sorted Array-Based Implementation of the ADT Table.
A Binary Search Tree Implementation of the ADT Table.
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.
A Heap Implementation of the ADT Priority Queue.
Heapsort.
12. Advanced Implementation of Tables.
Balanced Search Trees.
Hashing.
Data with Multiple Organizations.
2-3 Trees.
2-3-4 Trees.
Red-Black Trees.
AVL 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.
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.
Graph Traversals.
Applications of Graphs.
Graphs as ADTs.
Implementing Graphs.
Graph Traversals.
Depth-First Search.
Breadth-First Search.
Breadth-First Search.
Applications of Graphs.
Topological Sorting.
Spanning Trees.
Minimum Spanning Trees.
Shortest Paths.
Circuits.
Some Difficult Problems.
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.
Sorting Data in an External File.
External Tables.
Indexing an External File.
External Hashing.
B-Trees.
Traversals.
Multiple Indexing.
External Hashing.
B-Trees.
Traversals.
Multiple Indexing.
Appendix A: Review of Java Fundamentals.
Program Structure.
Language Basics.
Useful Java Classes.
Java Exceptions.
Text Input and Output.
Selection Statements.
Iteration Statements.
File Input and Output.
A Comparison to C++.
Packages.
Classes.
Data Fields.
Methods.
How to Access Members of an Object.
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.
Identifiers and Keywords.
Variables.
Primitive Data Types.
References.
Literal Constants.
Named Constants.
Assignments and Expressions.
Arrays.
Useful Java Classes.
The Object Class.
String Classes.
String Classes.
Java Exceptions.
Catching Exceptions.
Throwing Exceptions.
Throwing Exceptions.
Text Input and Output.
Input
Output.
Output.
Selection Statements.
The if Statement.
The switch Statement.
The switch Statement.
Iteration Statements.
The while Statement.
The for Statement.
The do Statement.
The for Statement.
The do Statement.
File Input and Output.
Text Files.
Object Serialization.
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.
Supplements
Instructor Supplements
For more information about any of the supplements listed below, use our Rep. Locator to contact your Addison Wesley representative.
- Online Instructor's Manual with Solutions
