注冊 | 登錄讀書好,好讀書,讀好書!
讀書網(wǎng)-DuShu.com
當(dāng)前位置: 首頁出版圖書科學(xué)技術(shù)計(jì)算機(jī)/網(wǎng)絡(luò)軟件與程序設(shè)計(jì)JAVA及其相關(guān)數(shù)據(jù)結(jié)構(gòu)-Java語言描述(英文版,第三版)

數(shù)據(jù)結(jié)構(gòu)-Java語言描述(英文版,第三版)

數(shù)據(jù)結(jié)構(gòu)-Java語言描述(英文版,第三版)

定 價(jià):¥79.00

作 者: (美)梅因
出版社: 機(jī)械工業(yè)出版社
叢編項(xiàng): 經(jīng)典原版書庫
標(biāo) 簽: 入門教程

ISBN: 9787111196105 出版時(shí)間: 2006-08-01 包裝: 平裝
開本: 16開 頁數(shù): 806 字?jǐn)?shù):  

內(nèi)容簡介

  本書系統(tǒng)地講述了各種常用的數(shù)據(jù)結(jié)構(gòu),對基本概念、基本原理和基本方法進(jìn)行了深入淺出的介紹,同時(shí)對相關(guān)的算法設(shè)計(jì)也進(jìn)行了詳細(xì)的講解。本書的一大特點(diǎn)就是采用非常流行的面向?qū)ο蟪绦蛟O(shè)計(jì)語言Java作為算法描述語言,將傳統(tǒng)的數(shù)據(jù)結(jié)構(gòu)與面向?qū)ο蠹夹g(shù)完美結(jié)合,更加自然貼切,易于理解。 本書第3版結(jié)合Java5.0進(jìn)行了改進(jìn),增加了一些新內(nèi)容,包括:泛型和枚舉數(shù)據(jù)類型,數(shù)組、集合以及枚舉類型中使用的for循環(huán)的新形式,用于原始值與封裝器之間轉(zhuǎn)換的autoboxing和unboxing,帶有可變參數(shù)的方法,輸入/輸出特性,Java子類型和協(xié)變返回值。本書特色 各個(gè)主題的順序非常靈活,教師可以根據(jù)課程需要自行選擇。 講述如何基于Java類庫規(guī)范,設(shè)計(jì)、實(shí)現(xiàn)和使用類。 討論編程技巧、陷阱警告和錯誤警告,突出Java的細(xì)微之處。 使用一致的五步方法介紹數(shù)據(jù)類型:抽象理解數(shù)據(jù)類型,編寫規(guī)格說明,使用數(shù)據(jù)類型,設(shè)計(jì)和實(shí)現(xiàn)數(shù)據(jù)類型,分析實(shí)現(xiàn)。 介紹如何編寫Java Applet來測試新實(shí)現(xiàn)的數(shù)據(jù)結(jié)構(gòu)。

作者簡介

  MichaelMain于華盛頓州立大學(xué)獲得博士學(xué)位,目前為科羅拉多大學(xué)計(jì)算機(jī)科學(xué)系副教授。

圖書目錄

CHAPTER 1 The Phases of Software Development
1.1    Specification,Design,Implementation
1.2    Running Time Analysis
1.3    Testing and Debugging
CHAPTER 2 Java Classes and Information Hiding
2.1    Classes and Their Members
2.2    Using a Class
2.3    Packages
2.4    Parameters,Equals Methods,and Clones
CHAPTER 3 Collection Classes
3.1    A Review of Java Arrays
3.2    An ADT for a Bag of Integers
3.3    Programming Project:The Sequence ADT
3.4    Programming Project:The Polynomial
CHAPTER 4 Linked Lists
4.1    Fundamentals of Linked Lists
4.2    Methods for Manipulating Nodes
4.3    Manipulating and Entire Linked List
4.4    The Bag ADT with a Linked List
4.5    Programming Project:The Sequence ADT with a Linked List
4.6    Beyond Simple Linked Lists
CHAPTER 5 Generic Programming
5.1    Java's Object Type
5.2    Object Methods and Generic Methods
5.3    Generic Classes
5.4    Generic Nodes
5.5    Interfaces and Iterators
5.6    A Generic Bag Class That Implements the Interface
5.7    Introduction to the Java Colletion and Map Interfaces
CHAPTER 6 Stacks
6.1    Introduction to Stacks
6.2    Stack Applications
6.3    Implementations of the Stack ADT
6.4    More Complex Stack Applications
CHAPTER 7 Queues
7.1    Introduction to Queues
7.2    Queues Applications
7.3    Implementations of the Queue ADT
7.4    Priority Queues
CHAPTER 8 Recursive Thinking
8.1    Recursive Methods
8.2    Studies of Recursion
8.3    Reasoning about Recursion
CHAPTER 9 Trees
9.1    Introduction to Trees
9.2    Tree Representations
9.3    A Class for Binary Tree Nodes
9.4    Tree Traversals
9.5    Binary Search Trees
CHAPTER 10 Projects
10.1    Heaps
10.2    B-Trees
10.3    Java Support for Trees
10.4    Trees,Logs,and Time Analysis
CHAPTER 11 Searching
11.1    Serial Search and Binary Search
11.2    Open-Address Hashing
11.3    Using Java's Hashtable Class
11.4    Chained Hashing
11.5    Time Analysis of Hashing
CHAPTER 12 Sorting
12.1    Quadratic Sorting Algorithms
12.2    Recursive Sorting Algorithms
12.3    An O Algorithm Using a Heap
CHAPTER 13 Software Reuse with Extended Classes
13.1    Extended Classes
13.2    Generic Type Parameters and Inheritance
13.3    Simulation of an Ecosystem
13.4    Abstract Classes and a Game Class
CHAPTER 14 Graphs
14.1    Graph Definitions
14.2    Graph Implementations
14.3    Graph Traversals
14.4    Path Algorithms
APPENDIXES  
INDEX

本目錄推薦

掃描二維碼
Copyright ? 讀書網(wǎng) www.afriseller.com 2005-2020, All Rights Reserved.
鄂ICP備15019699號 鄂公網(wǎng)安備 42010302001612號