Data Structures and Abstractions with Java™ 3/e (絕)
- 20本以上，享 8.5折
售價
$
洽詢
- 一般書籍
- ISBN：9780273764762
- 作者：Carrano
- 版次：3
- 年份：2012
- 出版商：Pearson Education
- 頁數/規格：1008頁/平裝雙色
書籍介紹
本書特色
目錄
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, 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, this unique object-oriented presentation makes a clear distinction between specification and implementation to simplify learning, while providing maximum classroom flexibility.
Features
New to This Edition
Reorganization:
- 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, 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.
New to This Edition
- Updated to Java 7
- Chapters 1 - 3 introduce and implement the ADT bag
- Design Decisions.
- A Problem Solved element
- VideoNotes
- Additional use of exceptions and external files
- Coverage of the standard interface Deque and the class ArrayDeque
- Additional Programming Projects
Reorganization:
- Earlier introduction to ADTs, resizable arrays, and linked data
- More gradual coverage of linked data
- Algorithm efficiency, stacks, recursion, sorting, and queues are covered after bags but before lists
- Mutable, immutable, and cloneable objects, as well as iterators, are covered last
- Review material that was in Chapters 1 - 3 of the second edition is now in the appendix
- Answers to Self-Test Questions appear at the end of each chapter instead of the appendix
- Coverage of the standard interface Serializable is deleted
Table of Contents
Chapter 1 Bags
Chapter 2 Bag Implementations That Use Arrays
Chapter 3 A Bag Implementation That Links Data
Chapter 4 The Efficiency of Algorithms
Chapter 5 Stacks
Chapter 6 Stack Implementations
Chapter 7 Recursion
Chapter 8 An Introduction to Sorting
Chapter 9 Faster Sorting Methods
Chapter 10 Queues, Deques, and Priority Queues
Chapter 11 Queue, Deque, and Priority Queue Implementations
Chapter 12 Lists
Chapter 13 List Implementations That Use Arrays
Chapter 14 A List Implementation That Links Data
Chapter 15 Iterators
Chapter 16 Sorted Lists
Chapter 17 Inheritance and Lists
Chapter 18 Searching
Chapter 19 Dictionaries
Chapter 20 Dictionary Implementations
Chapter 21 Introducing Hashing
Chapter 22 Hashing as a Dictionary Implementation
Chapter 23 Trees
Chapter 24 Tree Implementations
Chapter 25 A Binary Search Tree Implementation
Chapter 26 A Heap Implementation
Chapter 27 Balanced Search Trees
Chapter 28 Graphs
Chapter 29 Graph Implementations
Chapter 1 Bags
Chapter 2 Bag Implementations That Use Arrays
Chapter 3 A Bag Implementation That Links Data
Chapter 4 The Efficiency of Algorithms
Chapter 5 Stacks
Chapter 6 Stack Implementations
Chapter 7 Recursion
Chapter 8 An Introduction to Sorting
Chapter 9 Faster Sorting Methods
Chapter 10 Queues, Deques, and Priority Queues
Chapter 11 Queue, Deque, and Priority Queue Implementations
Chapter 12 Lists
Chapter 13 List Implementations That Use Arrays
Chapter 14 A List Implementation That Links Data
Chapter 15 Iterators
Chapter 16 Sorted Lists
Chapter 17 Inheritance and Lists
Chapter 18 Searching
Chapter 19 Dictionaries
Chapter 20 Dictionary Implementations
Chapter 21 Introducing Hashing
Chapter 22 Hashing as a Dictionary Implementation
Chapter 23 Trees
Chapter 24 Tree Implementations
Chapter 25 A Binary Search Tree Implementation
Chapter 26 A Heap Implementation
Chapter 27 Balanced Search Trees
Chapter 28 Graphs
Chapter 29 Graph Implementations
