Data Structures and Algorithms in Java 5/e (絕)
- 20本以上，享 8.5折
售價
$
洽詢
- 一般書籍
- ISBN：9780470398807
- 作者：Michael T. Goodrich, Roberto Tamassia
- 版次：5
- 年份：2010
- 出版商：John Wiley
- 頁數/規格：710頁/平裝雙色
- 參考網頁：Data Structures and Algorithms in Java 5/e
書籍介紹
本書特色
目錄
Description
The design and analysis of efficient data structures has long been recognized as a key component of the Computer Science curriculum. Goodrich and Tomassia's approach to this classic topic is based on the object-oriented paradigm as the framework of choice for the design of data structures. For each ADT presented in the text, the authors provide an associated Java interface. Concrete data structures realizing the ADTs are provided as Java classes implementing the interfaces.
The Java code implementing fundamental data structures in this book is organized in a single Java package, net.datastructures. This package forms a coherent library of data structures and algorithms in Java specifically designed for educational purposes in a way that is complimentary with the Java Collections Framework.
The design and analysis of efficient data structures has long been recognized as a key component of the Computer Science curriculum. Goodrich and Tomassia's approach to this classic topic is based on the object-oriented paradigm as the framework of choice for the design of data structures. For each ADT presented in the text, the authors provide an associated Java interface. Concrete data structures realizing the ADTs are provided as Java classes implementing the interfaces.
The Java code implementing fundamental data structures in this book is organized in a single Java package, net.datastructures. This package forms a coherent library of data structures and algorithms in Java specifically designed for educational purposes in a way that is complimentary with the Java Collections Framework.
Features
New to this Edition
- Known for its clarity of presentation DSA Java presents even the most difficult mathematical concepts in terms students can understand.
- A robust set of end-of-chapter problems are arranged by purpose – reinforcement problems assess understanding; creativity problems require students to apply concepts to writing “classes” (portions of a program); projects require students to write entire programs.
- Java code examples are used extensively, with source code provided on the web site www.datastructures.net. Students learn to build data structures using a simple API which is very consistent with the Java Collections Framework. The authors describe the Java Collections Framework and point out how the API in use may differ from the Java Collections Framework.
-
Online animations and an effective in-text art program illustrate data structures and algorithms in a clear, visual manner. Visual proofs help students develop a better understanding of mathematical topics.
- Coverage of Internet-related topics including hashing and text processing.
- Discussion of object-oriented design and the Java programming language, including the Collections Framework and Design Patterns help students grasp both data structures and object-oriented design issues. The book presents several object-oriented design patterns and important Java language constructs, like iterators and generic types, as well as all the traditional data structures topics.
New to this Edition
- Additional Figures: Topics and their mathematical analysis are presented as visually as possible without sacrificing the rigor or content.
- Increased and Updated Examples: Student-motivating topics such as Internet, Biology, Medicine, Science and Engineering, Business and Finance, Sports, Entertainment and Community Service are used as examples to draw students into the material.
- Additional Exercises: The existing exercises have been throughly updated and new exercises added to this edition.
-
New Powerpoint Slides: Updated Powerpoint slides are provided to instructors free upon adoption.
Table of Contents
1. Java Programming Basics.
2. Object-Oriented Design.
3. Arrays, Linked Lists, and Recursion.
4. Mathematical Foundations.
5. Stacks and Queues.
6. Lists Abstractions.
7. Trees Structures.
8. Priority Queues.
9. Maps and Dictionaries.
10. Search Trees Structures.
11. Sorting and Selection.
12. Text Processing.
13. Graphs.
14. Memory.
1. Java Programming Basics.
2. Object-Oriented Design.
3. Arrays, Linked Lists, and Recursion.
4. Mathematical Foundations.
5. Stacks and Queues.
6. Lists Abstractions.
7. Trees Structures.
8. Priority Queues.
9. Maps and Dictionaries.
10. Search Trees Structures.
11. Sorting and Selection.
12. Text Processing.
13. Graphs.
14. Memory.
