Skip To Page Navigation|Skip To Page Content

Addison-Wesley / Prentice Hall

Computer Science

My Instructor Resource Center : Log in or request access

Data Structures and Algorithm Analysis in Java
Mark Allen Weiss, Florida International University

ISBN-10: 0201357542
ISBN-13: 9780201357547

Publisher: Addison-Wesley
Copyright: 1999
Format: Cloth; 576 pp
Published: 10/20/1998

Mark Allen Weiss provides a proven approach to algorithms and data structures using the exciting Java programming language as the implementation tool. With Java he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. Dr. Weiss also distinguishes this text with a logical organization of topics, his engaging writing style and an extensive use of figures and examples showing the successive stages of an algorithm. Included are algorithm and design techniques and amortized analysis, plus a new chapter on advanced data structures and their implementation.

Contains extensive sample code using Java 1.2, which is available over the Internet.

Covers the Java Collections Library in an Appendix.

Includes a chapter on algorithm and design techniques that covers greedy algorithms, divide and conquer algorithms, dynamic programming, randomized algorithms, and backtracking.

Presents current topics and new data structures such as Fibonacci heaps, skew heaps, binomial queue, skip lists and splay trees.

Offers a chapter on amortized analysis that examines the advanced data structures presented earlier in the book.

Provides a chapter on advanced data structures and their implementation covering red black trees, top down splay trees, treaps, k-d trees, pairing heaps, and more.

Incorporates new results on the average case analysis of heapsort.

Introduction.

What's the Book About?

Mathematics Review.

A Brief Introduction to Recursion.

Generic Objects in Java.

Exceptions.

Input and Output.

Code Organization.

Algorithm Analysis.

Mathematical Background.

Model.

What to Analyze.

Running Time Calculations.

Lists, Stacks, and Queues.

Abstract Data Types (ADTs).

The List ADT.

The Stack ADT.

The Queue ADT.

Trees.

Preliminaries.

Binary Trees.

The Search Tree ADT: Binary Search Trees.

AVL Trees.

Splay Trees.

Tree Traversals (Revisited).

B-Trees.

Hashing.

General Idea.

Hash Function.

Separate Chaining.

Open Addressing.

Rehasing.

Extendible Hashing.

Priority Queues (Heaps).

Model.

Simple Implementations.

Binary Heap.

Applications of Priority Queues.

d-heaps.

Leftist Heaps.

Skew Heaps.

Binomial Queues.

Sorting.

Preliminaries.

Insertion Sort.

A Lower Bound for Simple Sorting Algorithms.

Shellsort.

Heapsort.

Mergesort.

Quicksort.

A General Lower Bound for Sorting.

Bucket Sort.

External Sorting.

The Disjoint Set ADT.

Equivalence Relations.

The Dynamic Equivalence Problem.

Basic Data Structure.

Smart Union Algorithms.

Path Compression.

Worst Case for Union-by Rank and Path Compression.

An Application.

Graph Algorithms.

Definitions.

Topological Sort.

Shortest-Path Algorithms.

Network Flow Problems.

Minimum Spanning Tree.

Applications of Depth-First Search.

Introduction to NP-Completeness.

Algorithm Design Techniques.

Greedy Algorithms.

Divide and Conquer.

Dynamic Programming.

Randomized Algorithms.

Backtracking Algorithms.

Amortized Analysis.

An Unrelated Puzzle.

Binomial Queues.

Skew Heaps.

Fibonacci Heaps.

Splay Trees.

Advanced Data Structures and Implementation.

Top-Down Splay Trees.

Red Black Trees.

Deterministic Skip Lists.

AA-Trees.

Treaps.

k-d Trees.

Pairing Heaps.

Appendix A: Some Library Routines.

Classes in Package java.lang.

Classes in Package java.io.

Classes in Package java.util.

Appendix B: The Collections Library.

Introduction.

Basic Classes.

Lists.

Sets.

Maps.

Example: Generating a Concordance.

Example: Shortest Path Calculation. 0201357442T04062001

Java--Algorithms/Advanced Data Structures (Computer Science)

Data Structures and Algorithm Analysis in Java, 2/E
Weiss
©2007 | Addison-Wesley | Paper; 576 pp | Instock
ISBN-10: 0321370139 | ISBN-13: 9780321370136
Net price: $91.50 (What's this?)Brief Description

As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs in Java.

A full language update to Java 5.0 throughout the text--particularly its use of generics–adds immeasurable value to this advanced study of data structures and algorithms. This Second Edition features integrated coverage of the Java Collections Library as well as a complete revision of lists, stacks, queues, and trees.

Weiss clearly explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss’ careful, rigorous and in-depth analysis of each type of algorithm. A logical organization of topics and full access to source code compliment the text’s coverage.

Author Bios
Backcover Copy

Mark Allen Weiss is a Professor in the School of Computer Science at Florida International University. He received his Ph.D. in Computer Science from Princeton University where he studied under Robert Sedgewick. Dr.Weiss has received FIU's Excellence in Research Award, as well as the Teaching Incentive Program Award, which was established by the Florida Legislature to recognize teaching excellence. Mark Allen Weiss is on the Advanced Placement Computer Science Development Committee. He is the successful author of Algorithms, Data Structures, and Problem Solving with C++ and the series Data Structures and Algorithm Analysis in Pascal, Ada, C, and C++, with Addison-Wesley.

0201357542AB04062001

Mark Allen Weiss provides a proven approach to algorithms and data structures using the exciting Java programming language as the implementation tool. With Java he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. Dr. Weiss also distinguishes this text with a logical organization of topics, his engaging writing style, and an extensive use of figures and examples showing the successive stages of an algorithm.

Features

Contains extensive sample code using Java 1.2, which is available over the Internet.
Covers the Java Collections Library in an appendix.
Includes a chapter on algorithm and design techniques that covers greedy algorithms, divide-and-conquer algorithms, dynamic programming,
randomized algorithms, and backtracking.
Presents current topics and new data structures such as Fibonacci heaps, skew heaps, binomial queues, skip lists, and splay trees.
Offers a chapter on amortized analysis that examines the advanced data structures presented earlier in the book.
Provides a chapter on advanced data structures and their implementation, covering red-black trees, top-down splay trees, treaps, k-d trees, pairing heaps, and more.

0201357542B04062001

Instructor Resources
Student Resources

Online Instructor's Manual
Weiss
©1999 | Addison-Wesley | On-line Supplement | Instock
ISBN-10: 0321341856 | ISBN-13: 9780321341853
View Downloadable Files

Online Solutions
Weiss
©1999 | Addison-Wesley | On-line Supplement | Instock
ISBN-10: 0321398238 | ISBN-13: 9780321398239

CS Support-Student Support Material
Addison-Wesley
©2008 | Addison-Wesley | On-line Supplement | Instock
ISBN-10: 0321446852 | ISBN-13: 9780321446855

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.