Data Structures and Abstractions with Java (5TH)

個数:

Data Structures and Abstractions with Java (5TH)

  • 在庫がございません。海外の書籍取次会社を通じて出版社等からお取り寄せいたします。
    通常6~9週間ほどで発送の見込みですが、商品によってはさらに時間がかかることもございます。
    重要ご説明事項
    1. 納期遅延や、ご入手不能となる場合がございます。
    2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
    3. 美品のご指定は承りかねます。

    ●3Dセキュア導入とクレジットカードによるお支払いについて
  • 【入荷遅延について】
    世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
    おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。
  • ◆画像の表紙や帯等は実物とは異なる場合があります。
  • ◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
    また、洋書販売価格は、ご注文確定時点での日本円価格となります。
    ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。
  • 製本 Hardcover:ハードカバー版/ページ数 960 p.
  • 言語 ENG
  • 商品コード 9780134831695
  • DDC分類 005.73

Full Description

A relatable and friendly introduction to data structures and their implementation

 

The 5th Edition of Data Structures and Abstractions with Java introduces readers to data structures (CS-2) in a supportive, reader-friendly way. The book's organization, sequencing, and pace of topic coverage make teaching and learning easier by:





Focusing the reader's attention on one concept at a time
Providing flexibility in the order in which one can cover topics
Clearly separating the specification of each abstract data type (ADT) from its implementation
Placing relevant coverage of Java into Java Interludes, which you can use as needed.



 

To increase readability and learning potential, the numbered segments and modular presentation provide a flexible, customizable pathway through the material and focus the reader's attention on one concept at a time. Numerous examples that mimic real-world situations provide a context for the new material and help to make it easier for audiences to learn and retain abstract concepts. The 5th Edition has a revamped structure and additional pedagogical tools to assist in mastering concepts.

Contents

Introduction: Organizing Data
Prelude: Designing Classes



Bags

Java Interlude 1 Generics

Bag Implementations That Use Arrays

Java Interlude 2 Exceptions

A Bag Implementation That Links Data
The Efficiency of Algorithms
Stacks
Stack Implementations

Java Interlude 3 More About Exceptions

Queues, Deques, and Priority Queues
Queue, Deque, and Priority Queue Implementations
Recursion
Lists
A List Implementation That Uses an Array
A List Implementation That Links Data

Java Interlude 4 Iterators

Iterators for the ADT List
Problem Solving With Recursion

Java Interlude 5 More About Generics

An Introduction to Sorting
Faster Sorting Methods

Java Interlude 6 Mutable and Immutable Objects

Sorted Lists

Java Interlude 7 Inheritance and Polymorphism

Inheritance and Lists
Searching

Java Interlude 8 Generics Once Again

Dictionaries
Dictionary Implementations
Introducing Hashing
Hashing as a Dictionary Implementation
Trees
Tree Implementations

Java Interlude 9 Cloning

A Binary Search Tree Implementation
A Heap Implementation
Balanced Search Trees
Graphs
Graph Implementations

Appendices

A. Documentation and Programming Style
B. Java Classes
C. Creating Classes from Other Classes

Online Supplements

Java Basics
File Input and Output
Glossary
Answers to Study Questions

最近チェックした商品