Computer Science

This product accompanies:
Weiss,  Data Structures and Algorithm Analysis in Java, 2/E

• 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.

Algorithm Analysis.

Lists, Stacks, and Queues.

Trees.

Hashing.

Priority Queues (Heaps).

Sorting.

The Disjoint Set ADT.

Graph Algorithms.

Algorithm Design Techniques.

Amortized Analysis.

Advanced Data Structures and Implementation.

Appendix A: Some Library Routines.

Appendix B: The Collections Library.

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

• 
  Data Structures and Algorithm Analysis in Java, 2/E
  Weiss
  ©2007 | Addison-Wesley | Paper; 576 pp | Out of Stock
  ISBN-10: 0321370139 | ISBN-13: 9780321370136
  Suggested retail price: $122.00  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.

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

Online Instructor's Manual
Weiss
©1999 | Addison-Wesley | On-line Supplement | Instock
ISBN-10: 0321341856 | ISBN-13: 9780321341853
This online resource is available at no cost.     View Downloadable Files

Online Solutions
Weiss
©1999 | Addison-Wesley | On-line Supplement | Instock
ISBN-10: 0321398238 | ISBN-13: 9780321398239
This online resource is available at no cost.

CS Support-Student Support Material
Addison-Wesley
©2008 | Addison-Wesley | On-line Supplement | Instock
ISBN-10: 0321446852 | ISBN-13: 9780321446855
This online resource is available at no cost at http://www.aw.com/cssupport.

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.