NEW & KEY FEATURES OF THE SIXTH EDITION:
‧UPDATED-Updated with new C++11 features including range-based for loops and threads
‧NEW-Includes a new Chapter 10, Trees Plus, that emphasizes balancing of search trees by covering AVL Trees, Red-Black Trees, and B-Trees
‧NEW-Includes a new chapter on Sets, Maps, and Hashing
‧NEW-Chapter 12, Sorting, now includes practical performance issues and parallel merge sort
‧NEW-Chapters in the second half of the text are now easier to assign in alternate orders, supporting a wider range of course goals and organizations
‧NEW-Modern new design enhances the look and feel of the text
‧STUDENT FAVORITE-Pedagogical features include: chapter openers with goals, marginal definition boxes, algorithm boxes, C++ boxes, function boxes, case studies, chapter summary, and end of chapter exercises
| FindBook |
有 5 項符合
C++ PLUS DATA STRUCTURES 6/E的圖書 |
 |
C++ PLUS DATA STRUCTURES 6/E 作者：DALE、WEEMS、RICHARDS 出版社：JONES AND BARTLETT 出版日期：2017-07-04 語言：繁體書 |
| 圖書選購 |
| 型式 | 價格 | 供應商 | 所屬目錄 | $ 1596 |
 TAAZE 讀冊生活 |
程式語言 |
$ 1634 |
 全華網路書店 |
原文書 |
$ 1646 |
 iRead灰熊愛讀書 |
高等教育 |
$ 1720 |
 博客來 |
資訊 |
$ 9371 |
 金石堂 |
資訊學群 |
|---|
| 圖書館借閱 |
| 國家圖書館 | 全國圖書書目資訊網 | 國立公共資訊圖書館 | 電子書服務平台 | MetaCat 跨館整合查詢 |
| 臺北市立圖書館 | 新北市立圖書館 | 基隆市公共圖書館 | 桃園市立圖書館 | 新竹縣公共圖書館 |
| 苗栗縣立圖書館 | 臺中市立圖書館 | 彰化縣公共圖書館 | 南投縣文化局 | 雲林縣公共圖書館 |
| 嘉義縣圖書館 | 臺南市立圖書館 | 高雄市立圖書館 | 屏東縣公共圖書館 | 宜蘭縣公共圖書館 |
| 花蓮縣文化局 | 臺東縣文化處 |
|
|
圖書介紹 - 資料來源：TAAZE 讀冊生活 評分：
圖書名稱：C++ PLUS DATA STRUCTURES 6/E
C++ Plus Data Structures, Sixth Edition explores the specifications, applications, and implementations of abstract data types with unmatched accessibility. Topics such as modularization, data encapsulation, information hiding, object-oriented decomposition, algorithm analysis, life-cycle software verification models, and data abstraction are carefully presented to foster solid software engineering techniques.
TOP
章節試閱
NEW & KEY FEATURES OF THE SIXTH EDITION:
‧UPDATED-Updated with new C++11 features including range-based for loops and threads
‧NEW-Includes a new Chapter 10, Trees Plus, that emphasizes balancing of search trees by covering AVL Trees, Red-Black Trees, and B-Trees
‧NEW-Includes a new chapter on Sets, Maps, and Hashing
‧NEW-Chapter 12, Sorting, now includes practical performance issues and parallel merge sort
‧NEW-Chapters in the second half of the text are now easier to assign in alternate o...
‧UPDATED-Updated with new C++11 features including range-based for loops and threads
‧NEW-Includes a new Chapter 10, Trees Plus, that emphasizes balancing of search trees by covering AVL Trees, Red-Black Trees, and B-Trees
‧NEW-Includes a new chapter on Sets, Maps, and Hashing
‧NEW-Chapter 12, Sorting, now includes practical performance issues and parallel merge sort
‧NEW-Chapters in the second half of the text are now easier to assign in alternate o...
»看全部
TOP
目錄
Ch1: Software Engineering Principles
Ch2: Data Design and Implementation
Ch3: ADT Unsorted List
Ch4: ADT Sorted List
Ch5: ADTs Stack and Queue
Ch6: Lists Plus
Ch7: Programming with Recursion
Ch8: Binary Search Trees
Ch9: Heaps, Priority Queues, and Heap Sort
Ch10: Trees Plus
Ch11: Sets, Maps, and Hashing
Ch12: Sorting
Ch13: Graphs
Ch2: Data Design and Implementation
Ch3: ADT Unsorted List
Ch4: ADT Sorted List
Ch5: ADTs Stack and Queue
Ch6: Lists Plus
Ch7: Programming with Recursion
Ch8: Binary Search Trees
Ch9: Heaps, Priority Queues, and Heap Sort
Ch10: Trees Plus
Ch11: Sets, Maps, and Hashing
Ch12: Sorting
Ch13: Graphs
»看全部
TOP
商品資料
- 作者： DALE、WEEMS、RICHARDS
- 出版社： JONES AND BARTLETT 出版日期：2017-07-04 ISBN/ISSN：9781284089189
- 語言：繁體中文 裝訂方式：精裝 頁數：838頁 開數：18 K
- 類別： 中文書> 電腦> 程式語言
|
