Data Structures and Abstractions with Java 2/e (絕)
- 20本以上，享 8.5折
售價
$
洽詢
- 一般書籍
- ISBN：9780132043670
- 作者：Frank M. Carrano
- 版次：2
- 年份：2007
- 出版商：Pearson Education
書籍介紹
本書特色
目錄
作者介紹
Description
This is the most student-friendly data structures text available that introduces ADTs in individual, brief chapters - each with pedagogical tools to help students master each concept. Using the latest features of Java 5, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility.
This is the most student-friendly data structures text available that introduces ADTs in individual, brief chapters - each with pedagogical tools to help students master each concept. Using the latest features of Java 5, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility.
Features
- Thorough, up-to-date Java coverage - Includes more features of Java, including generic data types, assertions, enumeration, for-each loops, and aspects of the Java Class Library, with extensive support within the text and appendices. Program comments use the javadoc style.
- Approachable format and content organization - Organizes material into small segments that focus a reader's attention and provide greater instructional flexibility.
- Each ADT is introduced in its own chapter, including examples or applications - Provides for instructor flexibility while retaining the advantage of separation of specification and implementation.
- Flexible and extensive assignments - Features a variety of exercises and programming projects that can be used in- class or assigned as homework, as well as self-test questions throughout each chapter.
- Visually appealing - Attractive design includes many figures to aid student comprehension.
- Complete support package - Includes Solutions Manuals, CD-ROM with animations of various data structures, Lab Manual,and PowerPoint slides.
- Companion Web site - Provides all the Java code from the text, PowerPoint slides, and animations.
Table of Contents
Introduction
Chapter 1 Java Classes
Chapter 2 Creating Classes from Other Classes
Chapter 3 Designing Classes
Chapter 4 Lists
Chapter 5 List Implementations That Use Arrays
Chapter 6 A List Implementation That Links Data
Chapter 7 Completing the Linked Implementation of a List
Chapter 8 Iterators
Chapter 9 The Efficiency of Algorithms
Chapter 10 Recursion
Chapter 11 An Introduction to Sorting
Chapter 12 Faster Sorting Methods
Chapter 13 Sorted Lists
Chapter 14 Inheritance and Lists
Chapter 15 Mutable, Immutable, and Cloneable Objects
Chapter 16 Searching
Chapter 17 Dictionaries
Chapter 18 Dictionary Implementations
Chapter 19 Introducing Hashing
Chapter 20 Hashing as a Dictionary Implementation
Chapter 21 Stacks
Chapter 22 Stack Implementations
Chapter 23 Queues, Deques, and Priority Queues
Chapter 24 Queue, Deque, and Priority Queue Implementations
Chapter 25 Trees
Chapter 26 Tree Implementations
Chapter 27 A Binary Search Tree Implementation
Chapter 28 A Heap Implementation
Chapter 29 Balanced Search Trees
Chapter 30 Graphs
Chapter 31 Graph Implementations
Introduction
Chapter 1 Java Classes
Chapter 2 Creating Classes from Other Classes
Chapter 3 Designing Classes
Chapter 4 Lists
Chapter 5 List Implementations That Use Arrays
Chapter 6 A List Implementation That Links Data
Chapter 7 Completing the Linked Implementation of a List
Chapter 8 Iterators
Chapter 9 The Efficiency of Algorithms
Chapter 10 Recursion
Chapter 11 An Introduction to Sorting
Chapter 12 Faster Sorting Methods
Chapter 13 Sorted Lists
Chapter 14 Inheritance and Lists
Chapter 15 Mutable, Immutable, and Cloneable Objects
Chapter 16 Searching
Chapter 17 Dictionaries
Chapter 18 Dictionary Implementations
Chapter 19 Introducing Hashing
Chapter 20 Hashing as a Dictionary Implementation
Chapter 21 Stacks
Chapter 22 Stack Implementations
Chapter 23 Queues, Deques, and Priority Queues
Chapter 24 Queue, Deque, and Priority Queue Implementations
Chapter 25 Trees
Chapter 26 Tree Implementations
Chapter 27 A Binary Search Tree Implementation
Chapter 28 A Heap Implementation
Chapter 29 Balanced Search Trees
Chapter 30 Graphs
Chapter 31 Graph Implementations
Frank M. Carrano is a professor emeritus of computer science at the University of Rhode Island. He received the Ph.D. degree in computer science from Syracuse University in 1969. His interests include data structures, computer science education, social issues in computing, and numerical computation. Professor Carrano is particularly interested in the design and delivery of undergraduate courses in computer science. He has authored several well-known computer science textbooks for undergraduates.
