Object of Data Abstraction and Structures (using Java), The
ISBN-10: 0201713594
ISBN-13: 9780201713596
Publisher: Addison-Wesley
Copyright: 2003
Format: Paper; 688 pp
Published: 10/03/2002
Status: Out of Print
We're sorry, this product is no longer available.
Description
The Object of Data Abstraction and Structures is for readers who are looking for a second computer science course that focuses on a modern object-oriented approach in Java. It covers the traditional data structures topics of a CS2 course, with special attention to sound software engineering practice, using an object-oriented approach.
The presentation is divided into two parts to provide instructors maximum flexibility to tailor the material to their particular needs. The main body of the textbook consists of Chapters 1-10 with general topics that are common to most CS2 courses, but with a distinctly O-O flavor. The Foundations section of the book, consisting of chapters F1 through F5, is a collection of foundational material that are assumed within the main body. These topics include an introduction object-oriented programming, software specifications, inheritance, exceptions and recursion. Most CS2 courses expect some, but not all, of this Foundations material as prerequisite, but there are considerable differences. The inclusion of these Foundations chapters allows the faculty member to choose how to use these topics. If a Foundations topic is new to students, then it may be fully covered at the beginning of the course, or inserted within the course at the instructor's discretion. If the Foundations topic is covered in prior curricula, then the Foundations material may be ignored or covered lightly using spiral pedagogy. It is even possible to pick and choose individual sections of the Foundations chapters.
Chapter 1 begins with the concept of abstraction (ADTs) and how it is used in software design. UML class diagrams are used to display high-level design and abstract preconditions and postconditions provide a notation to express detailed design. The Template Design Pattern is also introduced. Chapter 2 examines the concept of a data container from an abstract (ADT) perspective. Design issues, such as genericity, boundedness, iterators and mutability are explored. Chapter 3 is a brief aside to introduce performance issues, and Chapter 4 is an initial examination of ADT implementation using structures that are somewhat familiar to the student - arrays. Chapter 5 covers files and streams, including the O-O concept of persistence. Chapters 6 is a substantial exploration of lists that ranges from list/sequence ADTs to list applications to list implementation strategies to standard Java list classes. Chapter 7 presents stacks and queues, including both implementations and applications. Chapter 8 includes a presentation of the increasingly popular Map ADT and typical implementations from simple arrays to hash tables. Chapter 9 covers trees and Chapter 10 presents various searching and sorting algorithms.
Features
Table of Contents
SECTION 1.
SECTION 2. CORE CONCEPTS: REVIEW AND REFERENCE.
Author Bios
David D. Riley is chairman of the Department of Computer Science at University of Wisconsin-LaCrosse, where he teaches programming for beginners and for experienced programmers. His areas of specialty include object-oriented software development, software engineering, and computer architecture. He holds a Ph.D. in Computer Science from the University of Iowa.
Professor Riley is the author of four other programming books, including Data Abstraction and Structures using C++ with Mark Headington.
Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.