Data Structures and Other Objects Using Java
Published on 30. November 1998
Book
Paperback/Softback
784 pages
978-0-201-35744-8 (ISBN)
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.
More details
Language
English
Place of publication
United States
Publishing group
Pearson Education (US)
Target group
College/higher education
Dimensions
Width: 232 mm
Thickness: 30 mm
Weight
1142 gr
ISBN-13
978-0-201-35744-8 (9780201357448)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
New editions
Book
10/2002
2nd Edition
Pearson
€81.70
Article exhausted; check for reprint
Person
Michael Main is an Associate Professor of Computer Science at the University of Colorado at Boulder. As a chairman of the undergraduate committee, he participated in the University's development and implementation of the Bachelor's of Science degree in Computer Science. Recognized as gifted teacher of undergraduates, he has incorporated many of his innovative teaching techniques into his Addison-Wesley textbooks.
0201357445AB04062001
0201357445AB04062001
Content
The Phases of Software Development.
Specification, Design, Implementation.
Running Time Analysis.
Testing and Debugging.
Abstract Data Types and Java Classes.
Classes and Their Members.
Using a Class.
Packages.
Parameters, Equals Methods, and Clones.
Collection Classes.
A Review of Java Arrays.
An ADT for a Bag of Integers.
Programming Project: The Sequence ADT.
Applets for Interactive Testing.
Linked Lists.
Fundamentals of 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.
Java's Object Type.
A Bag of Objects.
JCL Collections and Nodes of Objects.
Iterators.
Stacks.
Introduction to Stacks.
Stack Applications.
Implementations of the Stack ADT.
More Complex Stack Applications.
Queues.
Introduction to Queues.
Queue Applications.
Implementations of the Queue.
ADT.
Priority Queues.
Recursive Thinking.
Recursive Methods.
Studies of Recursion: Fractals and Mazes.
Reasoning about Recursion.
Trees.
Introduction to Trees.
Tree Representations.
A Class for Binary Tree Nodes.
Tree Traversals.
Binary Search Trees.
Tree Projects.
Heaps.
B-Trees.
Trees, Logs, and Time Analysis.
Searching.
Serial Search and Binary Search.
Open-Address Hashing.
Using Java's Hashtable Class.
Chained Hashing.
Time Analysis of Hashing.
Sorting.
Quadratic Sorting Algorithms.
Recursive Sorting Algorithms.
An O(N LOG N) Algorithm Using a Heap.
Software Reuse with Extended Classes.
Extended Classes.
Simulation of an Ecosystem.
Using Extended Classes for ADTs.
Graphs.
Graph Definitions.
Graph Implementations.
Graph Traversals.
Path Algorithms.
Appendices.
Java's Primitive Types and Arithmetic Overflow.
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
Specification, Design, Implementation.
Running Time Analysis.
Testing and Debugging.
Abstract Data Types and Java Classes.
Classes and Their Members.
Using a Class.
Packages.
Parameters, Equals Methods, and Clones.
Collection Classes.
A Review of Java Arrays.
An ADT for a Bag of Integers.
Programming Project: The Sequence ADT.
Applets for Interactive Testing.
Linked Lists.
Fundamentals of 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.
Java's Object Type.
A Bag of Objects.
JCL Collections and Nodes of Objects.
Iterators.
Stacks.
Introduction to Stacks.
Stack Applications.
Implementations of the Stack ADT.
More Complex Stack Applications.
Queues.
Introduction to Queues.
Queue Applications.
Implementations of the Queue.
ADT.
Priority Queues.
Recursive Thinking.
Recursive Methods.
Studies of Recursion: Fractals and Mazes.
Reasoning about Recursion.
Trees.
Introduction to Trees.
Tree Representations.
A Class for Binary Tree Nodes.
Tree Traversals.
Binary Search Trees.
Tree Projects.
Heaps.
B-Trees.
Trees, Logs, and Time Analysis.
Searching.
Serial Search and Binary Search.
Open-Address Hashing.
Using Java's Hashtable Class.
Chained Hashing.
Time Analysis of Hashing.
Sorting.
Quadratic Sorting Algorithms.
Recursive Sorting Algorithms.
An O(N LOG N) Algorithm Using a Heap.
Software Reuse with Extended Classes.
Extended Classes.
Simulation of an Ecosystem.
Using Extended Classes for ADTs.
Graphs.
Graph Definitions.
Graph Implementations.
Graph Traversals.
Path Algorithms.
Appendices.
Java's Primitive Types and Arithmetic Overflow.
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