Data Structures, Algorithms, And Applications In Java, 2/e (Paperback)

Sartaj Sahni

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

商品描述

Description 

Data Structures, Algorithms, and Applications in Java (2/E) is the new version of the very popular first edition. It provides a comprehensive coverage of fundamental data structures, making it ideal for use in a CS2 course. The author, Professor Sartaj Sahni has made the book very user friendly by starting with a gentle introduction, providing intuitive discussions, and including real-world applications.

Real-world applications are a unique feature of this text. Dr. Sahni provides several applications for each data structure and algorithm design method discussed, taking examples from topics such as sorting, compression and coding, and image processing. These applications motivate and interest students by connecting concepts with their use. Dr. Sahni does an excellent job of balancing theoretical and practical information, resulting in learned concepts and interested students.

The market-developed pedagogy in this book reinforces concepts and gives students plenty of practice. There are almost 1,000 exercises, including comprehension and simple programming problems, and projects. Additionally, the book has an associated Web site that contains all the programs in the book, animations, sample data, generated output, solutions to selected exercises, and sample tests with answers.

 

Table of Contents

  • PART I PRELIMINARIES
  • Chapter 1 Java Review
  • Chapter 2 Performance Analysis of Programs
  • Chapter 3 Asymptotic Notation
  • Chapter 4 Performance Measurement of Programs

 

  • PART II DATA STRUCTURES
  • Chapter 5 Linear Lists - Array Representation
  • Chapter 6 Linear Lists - Linked Representation
  • Chapter 7 Linear Lists - Simulated Pointers
  • Chapter 8 Arrays and Matrices
  • Chapter 9 Stacks
  • Chapter 10 Queues
  • Chapter 11 Skip Lists and Hashing
  • Chapter 12 Binary and Other Trees
  • Chapter 13 Priority Queues
  • Chapter 14 Tournament Trees
  • Chapter 15 Binary Search Trees
  • Chapter 16 Balanced Search Trees
  • Chapter 17 Graphs

 

  • PART III ALGORITHM-DESIGN METHODS
  • Chapter 18 The Greedy Method
  • Chapter 19 Divide and Conquer
  • Chapter 20 Dynamic Programming
  • Chapter 21 Backtracking (On the Web)
  • Chapter 22 Branch and Bound (On the Web)

商品描述(中文翻譯)

《Java中的資料結構、演算法和應用》(第二版)是非常受歡迎的第一版的新版本。它全面涵蓋了基本的資料結構,非常適合在CS2課程中使用。作者Sartaj Sahni教授通過溫和的介紹、直觀的討論和實際應用使書籍非常易於使用。

實際應用是本書的獨特特點。Sahni博士為每個討論的資料結構和演算法設計方法提供了多個應用實例,包括排序、壓縮和編碼以及圖像處理等主題。這些應用通過將概念與實際使用相連,激發並吸引學生的興趣。Sahni博士在平衡理論和實際信息方面做得非常出色,使學生能夠學到概念並保持興趣。

本書中的市場開發教學法強化了概念並為學生提供了充分的練習。書中包含近1000個練習題,包括理解和簡單的編程問題以及項目。此外,本書還附帶了一個網站,其中包含書中的所有程序、動畫、樣本數據、生成的輸出、選定練習的解答以及帶答案的樣本測試。

目錄:
第一部分:前言
第1章 Java回顧
第2章 程序性能分析
第3章 渐近符号
第4章 程序性能測量

第二部分:資料結構
第5章 線性列表-數組表示
第6章 線性列表-鏈接表示
第7章 線性列表-模擬指針
第8章 數組和矩陣
第9章 堆疊
第10章 佇列
第11章 跳躍表和哈希
第12章 二叉樹和其他樹
第13章 優先佇列
第14章 比賽樹
第15章 二分搜索樹
第16章 平衡搜索樹
第17章 圖形