数据结构与Java类集框架

出版时间：2002-7  出版社：高等教育  作者：[美]WilliamJ.Col  页数：716  字数：1000000  
Tag标签：无  

内容概要

本书着重阐述数据结构的基础知识及其Java语言实现。学生通过对书中编程项目和实验的实践和训练，可加深对基本概念和方法的理解和掌握，并可直接了解实际当中的应用。    本书的主要特点包括：全面涵盖了数据结构与Java类集框架的内容，尤其介绍了重要数据结构的实现，如表、树和Hash表等；运用简单的图形用户接口作为输入/输出，以使学生能更好地理解在实际当中普遍应用的事件驱动程序设计方法；本书含有大量的例题和练习、应用案例和实例，以加强学生的实际训练。

作者简介

作者William J.Collins现在美国Lafayette学院计算机系从事数据结构课程的教学。

书籍目录

PrefaceCHAPTER 1 Important Features of JavaChapter Objectives 1.1 Classes Summary Exercises Programming Project 1.1:Developing and Using a Sequence ClassCHAPTER 2 Interfaces and Collection ClassesChapter Object 2.1 Abstract Methods and Abstract Classes 2.2 Interfaces 2.3 Arrays 2.4 Collection Classes 2.5 Storage Structures for Collection Classes Summary Exercises Programming Project 2.1:Expanding the LinkedCollection ClassCHAPTER 3 Introduction to Software EngineeringChapter Objectives 3.1 The Software Development Life Cycle 3.2 Problem Analysis 3.3 Program Design 3.4 Program Implementation 3.5 Program Maintenance Summary Exercises Programming Project 3.1:Further Expansion of the LinkedCollection ClassCHAPTER 4 RecursionChapter Objectives 4.1 Introduction 4.2 Factorials 4.3 Decimal to Binary 4.4 Towers of Hanoi 4.5 Backtracking 4.6 Binary Search 4.7 Indirect Recursion 4.8 The Cost of Recursion Summary Exercises Programming Project 4.1:Iterative Version of Towers of Hanoi Programming Project 4.2:Eight Queens Programming Project 4.3:A Knight's TourCHAPTER 5 Array ListsChapter Objectives 5.1 The List Interface 5.2 The ArrayList Class 5.3 The ArrayList Implementation 5.4 Application:High-Precision Arithmetic 5.5 The Vector Class Summary Exercises Programming Project 5.1:Extending the VeryLongInt Class Programming Project 5.2:The Deque ClassCHAPTER 6 Linked ListsChapter Objectives 6.1 The LinkedList Class 6.2 Application:A Line Editor Summary Exercises Programming Project 6.1:Extending the Line Editor Programming Project 6.2:alternative Design and Implementation of the LinkedList ClassCHAPTER 7 Queues and StacksCHAPTER 8 Binary Trees and Binary Search TreesCHAPTER 9 Balanced Binary Search TreesCHAPTER 10 Tree Maps and Tree SetsCHAPTER 11 Priority QueuesCHAPTER 12 SortingCHAPTER 13 Searching and the Hash ClassesCHAPTER 14 Graphs,Trees,and NetworksAPPENDIX 1 Mathematical BackgroundAPPENDIX 2 The GUI and GUIListener ClassesAPPENDIX 3 The Java Collections FrameworkBibliographyIndex