Goldman A Practical Guide to Data Structures and Algorithms using Java

1. Auflage 2007
ISBN: 978-1-4200-1033-6
Verlag: Taylor & Francis
Format: PDF
Kopierschutz: Adobe DRM (»Systemvoraussetzungen)

E-Book, Englisch, 1056 Seiten

Reihe: Chapman & Hall/CRC Applied Algorithms and Data Structures series

Although traditional texts present isolated algorithms and data structures, they do not provide a unifying structure and offer little guidance on how to appropriately select among them. Furthermore, these texts furnish little, if any, source code and leave many of the more difficult aspects of the implementation as exercises. A fresh alternative to conventional data structures and algorithms books, A Practical Guide to Data Structures and Algorithms using Java presents comprehensive coverage of fundamental data structures and algorithms in a unifying framework with full implementation details. Recognizing that software development is a top-down process, this applications-centered book provides careful guidance to students and practitioners. Complete and thoroughly integrated Java implementations expose key differences among a wide range of important data structures, including many useful abstract data types not provided in standard Java libraries. Fundamental algorithms appear within the context of their supporting data structures. Case studies, examples, decision trees, and comparison charts throughout the stylized presentation illustrate and support an efficient methodology for the careful selection and application of data structures and algorithms. Appendices summarize major features of the Java programming language, introduce asymptotic notation and complexity analysis, and discuss design patterns applied in the book. A true marriage of theory and practice, this book sets a new standard as a comprehensive practical guide to data structures and algorithms. Practitioners and students will reach for this book often to quickly identify the best data structure or algorithm for their applications.

Zielgruppe

Software developers and computer scientists, programmers, and students.

Autoren/Hrsg.

Goldman, Sally. A

Goldman, Kenneth. J

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen

Inhaltsverzeichnis

INTRODUCTION

Design Principles

Selecting an Abstract Data Type

How to Use This Book

PARITION ADT

Union-Find Data Structure

POSITIONAL COLLECTION ADT

Array (including quicksort, merge sort, insertion sort, heap sort, tree sort, radix sort, bucket sort, selection/median finding)

Circular Array

Dynamic Array

Dynamic Circular Array

Tracked Array

Singly Linked List

Doubly Linked List

Buffer

Queue

Stack

SET ADT

Direct Addressing

Separate Chaining

Open Addressing

PRIORITY QUEUE ADT

Binary Heap

Leftist Heap

Pairing Heap

Fibonacci Heap

ORDERED COLLECTION ADT

Sorted Array (including binary search)

Binary Search Tree

Red-Black Tree

Splay Tree

B-Tree

B+-Tree

Skip List

DIGITIZED ORDERED COLLECTION ADT

Trie

Compact Trie

Compressed Trie

Patricia Trie

Ternary Search Trie

SPATIAL COLLECTION ADT

KD-Tree

Quad Tree

TAGGED COLLECTION ADT

Tagged Collection Wrapper (supports using arbitrary collections for tag/key-based insertion and lookup)

TAGGED BUCKET COLLECTION ADT

Tagged Bucket Collection Wrapper (supports grouping elements with the same tag)

GRAPH REPRESENTATIONS

Adjacency Matrix

Adjacency List

GRAPH ADT

Breadth-First Search

Depth-First Search

Connected Components

Topological Sort

Strongly Connected Components

WEIGHTED GRAPH

Dijkstra’s and Bellman–Ford’s Single-Source Shortest Path Algorithms

Floyd–Warshall All-Pairs Shortest Path

Prim’s and Kruskal’s Minimum Spanning Tree Algorithms

Edmonds–Karp Maximum Flow Algorithm

APPENDICES

Java Fundamentals

Complexity Analysis

Design Patterns

References

INDEX