Data Structures Using Java (Hardcover)
暫譯: 使用 Java 的資料結構 (精裝版)

Moshe J. Augenstein, Yedidyah Langsam, Aaron M. Tenenbaum

Data Structures Using Java (Hardcover)
  • 出版商: Prentice Hall
  • 出版日期: 2003-03-15
  • 售價: $980
  • 語言: 英文
  • 頁數: 688
  • 裝訂: Paperback
  • ISBN: 0130477214
  • ISBN-13: 9780130477217
  • 相關分類: Java 程式語言

    • 下單後立即進貨 (約5~7天)

買這商品的人也買了...

相關主題

商品描述

This book employs an object-oriented approach to teaching data structures using Java. Many worked examples and approximately 300 additional examples make this book easily accessible to the reader. Most of the concepts in the book are illustrated by several examples, allowing readers to visualize the processes being taught. KEY TOPICS: Introduces abstract concepts, shows how those concepts are useful in problem solving, and then shows the abstractions can be made concrete by using a programming language. Equal emphasis is placed on both the abstract and the concrete versions of a concept, so that the reader learns about the concept itself, its implementation, and its application. MARKET: For anyone with an interest in learning more about data structures.

Table of Contents

1. Introduction To Data Structures.

Information and Meaning. Arrays, Strings, and Vectors in Java. Classes and Objects in Java.


2. The Stack.

Definitions and Examples. Representing Stacks in Java. Example: Infix, Postfix and Prefix. Stack of Objects of Varying Types.


3. Recursion.

Recursive Definition and Processes. Recursion in Java. Writing Recursive Programs. Simulating Recursion. Efficiency of Recursion.


4. Queues and Lists.

The Queue and Its Sequential Representation. Linked Lists. Lists in Java. Lists in Java. An Example: Simulation Using Linked Lists. Other List Structures.


5. Trees.

Binary Trees. Binary Tree Representations. An Example: The Huffman Algorithm. Representing Lists as Binary Trees. Trees and Their Applications. Example: Game Trees.


6. Sorting.

General Background. Exchange Sorts. Selection and Tree Sorting. Insertion Sorts. Merge and Radix Sorts.


7. Searching.

Basic Search Techniques. Tree Searching. General Search Trees. Hashing.


8. Graphs and Their Applications.

Graphs. Flow Problem. Links Representation of Graphs. Graph Traversal and Spanning Forests.


9. Storage Management.

General Lists. Automatic List Management. Dynamic Memory Management.

商品描述(中文翻譯)

這本書採用物件導向的方法來教授資料結構，使用 Java 語言。書中包含許多實作範例和約 300 個額外範例，使讀者能輕鬆理解。書中的大多數概念都透過多個範例來說明，讓讀者能夠視覺化所教授的過程。關鍵主題：介紹抽象概念，展示這些概念在解決問題中的實用性，然後顯示如何透過程式語言將抽象具體化。對於概念的抽象和具體版本都給予同等重視，讓讀者了解概念本身、其實作及應用。市場：適合任何對學習資料結構有興趣的人。

目錄

1. 資料結構導論。

資訊與意義。Java 中的陣列、字串和向量。Java 中的類別和物件。



2. 堆疊。

定義和範例。在 Java 中表示堆疊。範例：中序、後序和前序。不同類型物件的堆疊。



3. 遞迴。

遞迴定義和過程。Java 中的遞迴。撰寫遞迴程式。模擬遞迴。遞迴的效率。



4. 隊列和列表。

隊列及其順序表示法。鏈結串列。Java 中的列表。範例：使用鏈結串列的模擬。其他列表結構。



5. 樹。

二元樹。二元樹的表示法。範例：霍夫曼演算法。將列表表示為二元樹。樹及其應用。範例：遊戲樹。



6. 排序。

一般背景。交換排序。選擇排序和樹排序。插入排序。合併排序和基數排序。



7. 搜尋。

基本搜尋技術。樹搜尋。一般搜尋樹。雜湊。



8. 圖形及其應用。

圖形。流量問題。圖形的鏈結表示法。圖形遍歷和生成樹。



9. 儲存管理。

一般列表。自動列表管理。動態記憶體管理。

類似商品