Data Structures & Other Objects Using Java
M. Main, Michael Main
- 出版商: Addison Wesley
- 出版日期: 1998-09-30
- 售價: $931
- 語言: 英文
- 頁數: 768
- 裝訂: Paperback
- ISBN: 0201357445
- ISBN-13: 9780201357448
-
相關分類:
Java 程式語言、Algorithms-data-structures
無法訂購
買這商品的人也買了...
-
$1,200$1,176 -
$580$458 -
$680$537 -
$920$727 -
$199$157 -
$1,860$1,767 -
$280$266 -
$650$553 -
$590$466 -
$280$221 -
$620$527 -
$690$538 -
$720$562 -
$780$616 -
$720$569 -
$560$442 -
$590$531 -
$280$218 -
$280$266 -
$750$675 -
$560$504 -
$750$593 -
$490$382 -
$890$703 -
$620$490
相關主題
商品描述
Description
This book takes a gentle approach to the data structures course in Java. It offers an early, self-contained review of object-oriented programming and Java to give students a firm grasp of key concepts, and allows those experienced in other languages to adjust easily. The book also offers a flexibility which allows professors such options as emphasizing object-oriented programming, covering recursion and sorting early or accelerating the pace of the course. This title meets the needs of professors searching for a book to balance the introduction of object-oriented programming and data structures with Java.
Features
- Includes five-step method for data types to ensure students have thorough knowledge of the topic.
- Teaches students to work with the Java Class Libraries and emphasizes software reuse.
Table Of Contents
The Phases of Software Development.Running Time Analysis.
Testing and Debugging.
Abstract Data Types and Java Classes.
Using a Class.
Packages.
Parameters, Equals Methods, and Clones.
Collection Classes.
An ADT for a Bag of Integers.
Programming Project: The Sequence ADT.
Applets for Interactive Testing.
Linked Lists.
Methods for Manipulating Nodes.
Manipulating an Entire Linked List.
The Bag ADT with a Linked List.
Programming Project: The Sequence ADT with a Linked List.
Arrays vs. Linked Lists vs. Doubly Linked Lists.
Java Objects and Iterators.
A Bag of Objects.
JCL Collections and Nodes of Objects.
Iterators.
Stacks.
Stack Applications.
Implementations of the Stack ADT.
More Complex Stack Applications.
Queues.
Queue Applications.
Implementations of the Queue.
ADT.
Recursive Thinking.
Studies of Recursion: Fractals and Mazes.
Reasoning about Recursion.
Trees.
Tree Representations.
A Class for Binary Tree Nodes.
Tree Traversals.
Binary Search Trees.
Tree Projects.
B-Trees.
Trees, Logs, and Time Analysis.
Searching.
Open-Address Hashing.
Using Java's Hashtable Class.
Chained Hashing.
Time Analysis of Hashing.
Sorting.
Recursive Sorting Algorithms.
An O(N LOG N) Algorithm Using a Heap.
Software Reuse with Extended Classes.
Simulation of an Ecosystem.
Using Extended Classes for ADTs.
Graphs.
Graph Implementations.
Graph Traversals.
Path Algorithms.
Appendices.
Java Input.
Throwing and Catching Java Exceptions.
Java's Vector and Hashtable.
A Class for Nodes in a Linked List.
A Class for a Bag of Objects.
Further Big-O Notation.
Javadoc. 0201357445T04062001
Supplements
Instructor Supplements
For more information about any of the supplements listed below, use our Rep. Locator to contact your Addison Wesley representative.
- Free Copy / 0-201-35758-5