數(shù)據(jù)結(jié)構(gòu)與Java類集框架

內(nèi)容概要

本書著重闡述數(shù)據(jù)結(jié)構(gòu)的基礎(chǔ)知識及其Java語言實現(xiàn)。學(xué)生通過對書中編程項目和實驗的實踐和訓(xùn)練，可加深對基本概念和方法的理解和掌握，并可直接了解實際當(dāng)中的應(yīng)用。    本書的主要特點包括：全面涵蓋了數(shù)據(jù)結(jié)構(gòu)與Java類集框架的內(nèi)容，尤其介紹了重要數(shù)據(jù)結(jié)構(gòu)的實現(xiàn)，如表、樹和Hash表等；運用簡單的圖形用戶接口作為輸入/輸出，以使學(xué)生能更好地理解在實際當(dāng)中普遍應(yīng)用的事件驅(qū)動程序設(shè)計方法；本書含有大量的例題和練習(xí)、應(yīng)用案例和實例，以加強學(xué)生的實際訓(xùn)練。

作者簡介

作者William J.Collins現(xiàn)在美國Lafayette學(xué)院計算機系從事數(shù)據(jù)結(jié)構(gòu)課程的教學(xué)。

書籍目錄

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

圖書封面

圖書標(biāo)簽Tags

無

評論、評分、閱讀與下載

---

    數(shù)據(jù)結(jié)構(gòu)與Java類集框架 PDF格式下載

---