Classic Data Structures in Java(絕)
- 20本以上，享 8.5折
售價
$
洽詢
- 一般書籍
- ISBN：9780201700022
- 作者：Timothy Budd
- 版次：1
- 年份：2001
- 出版商：Pearson Education
- 頁數/規格：593頁
- 參考網頁：Classic Data Structures in Java
書籍介紹
本書特色
目錄
作者介紹
Description
With this book, Tim Budd looks at data structures by providing a solid foundation on the ADT, and uses the graphical elements found in Java when possible.
The beginning chapters provide the foundation on which everything else will be built. These chapters define the essential concept of the abstract data type (ADT), and describe the tools used in the evaluation and analysis of data structures. The book moves on to provide a detailed description of the two most important fundamental data abstractions, the vector and the linked list, providing an explanation of some of the more common variations on these fundamental ideas.
Next, the material considers data structures applicable to problems in which the order that values are added to a collection is important, followed by a consideration of the various different ways in which binary trees are used in the creation of data structures. The last few chapters consider a sequence of more advanced data structures. Most are constructed as adaptors built on top of earlier abstractions. Hash tables are introduced first as a technique for implementing simple collections, and later as a tool for developing efficient maps. Lastly, the graph data type is considered. Here there are several alternative data structures presentations in common use, and the emphasis in this chapter is more on the development and analysis of useful algorithms than on any particular data structure.
With this book, Tim Budd looks at data structures by providing a solid foundation on the ADT, and uses the graphical elements found in Java when possible.
The beginning chapters provide the foundation on which everything else will be built. These chapters define the essential concept of the abstract data type (ADT), and describe the tools used in the evaluation and analysis of data structures. The book moves on to provide a detailed description of the two most important fundamental data abstractions, the vector and the linked list, providing an explanation of some of the more common variations on these fundamental ideas.
Next, the material considers data structures applicable to problems in which the order that values are added to a collection is important, followed by a consideration of the various different ways in which binary trees are used in the creation of data structures. The last few chapters consider a sequence of more advanced data structures. Most are constructed as adaptors built on top of earlier abstractions. Hash tables are introduced first as a technique for implementing simple collections, and later as a tool for developing efficient maps. Lastly, the graph data type is considered. Here there are several alternative data structures presentations in common use, and the emphasis in this chapter is more on the development and analysis of useful algorithms than on any particular data structure.
Features
- An object-oriented mindset is applied throughout.
- The clear separation between ADT (interface) and implementation is emphasized throughout.
- A rigorous approach to development in encouraged, with techniques for developing formal proofs of programs being presented, and proofs of programs appearing throughout the text.
- An explorational and visual approach is encouraged by providing tools that make it easy to create a visual record of execution time, and Experiments that will help see aspects of execution that may not be obvious from the code.
- Important software patterns are highlighted, and the use of patterns is emphasized from the beginning.
- Graphical elements, chosen to minimize the unnecessary detail and emphasize the important lessons of Java, are used to motivate the student's interest in the material.
- Sidebars are included throughout so that readers can then peruse additional information as they choose.
-
End of Chapter material is designed to aid students comprehension of the material just presented, including: a chapter summary, glossary of key terms, numerous basic study questions, a collection of thought-provoking exercises, and a series of programming projects.
An appendix with an overview of Java syntax makes this book appropriate for readers without a Java background. - Written by Tim Budd, author of numerous other successful texts, including Classic Data Structures in C++, Data Structures in C++ with the STL, Introduction to Object Oriented Programming, and C++ for Java Programmers.
Table of Contents
1. The Management of Complexity.
2. Abstract Data Types.
3. Algorithms.
4. Execution-Time Measurement.
5. Increasing Confidence in Correctness.
6. Vectors.
7. Sorting Vectors.
8. Linked Lists.
9. List Variations.
10. Stacks.
11. Deques.
12. Queues.
13. Trees.
14. Binary Search Trees.
15. Priority Queues.
16. Hash Tables.
17. Maps.
18. Sets.
19. Matrices.
20. Graphs.
Appendix A. Java Syntax.
Appendix B. Import Libraries.
Appendix C. Data Structures in the Java Standard Library.
Bibliography.
Index.
1. The Management of Complexity.
2. Abstract Data Types.
3. Algorithms.
4. Execution-Time Measurement.
5. Increasing Confidence in Correctness.
6. Vectors.
7. Sorting Vectors.
8. Linked Lists.
9. List Variations.
10. Stacks.
11. Deques.
12. Queues.
13. Trees.
14. Binary Search Trees.
15. Priority Queues.
16. Hash Tables.
17. Maps.
18. Sets.
19. Matrices.
20. Graphs.
Appendix A. Java Syntax.
Appendix B. Import Libraries.
Appendix C. Data Structures in the Java Standard Library.
Bibliography.
Index.
Timothy Budd, Oregon State University
