Data Structures and Algorithm Analysis in Java (2nd Edition)

Description

Features

Features

• Up–to–date use of Java 5.0 including its use of generics.

 

•  Integrated coverage of the Java Collections Library.

 

• Discussion of algorithm and design techniques covers greedy algorithms, divide and conquer algorithms, dynamic programming, randomized algorithms, and backtracking.

 

• Covers topics and data structures such as Fibonacci heaps, skew heaps, binomial queue, skip lists and splay trees.

 

• A full chapter on amortized analysis examines the advanced data structures presented earlier in the book.

 

• Chapter on advanced data structures and their implementation covers red black trees, top down splay trees, treaps, k–d trees, pairing heaps, and more.

 

• End–of–chapter exercises, ranked by difficulty, reinforce the material from the chapter while providing readers an opportunity to put those concepts into practice.

 

• PowerPoint figures and solutions to exercises are available to qualified instructors.

 

New to this Edition

New To This Edition

• Revised Chapter 3, Lists, Stacks, and Queues, offers up–to–date coverage that emphasizes the use of ADTs and includes plenty of ideas for programming assignments.

 

• New material on trees in Chapter 4.

 

• The Java Collections Library has been integrated throughout the text.

 

• Enhanced interior design–including redesigned figures and examples––adds to the book’s readability. 

 

From the back cover:

Backcover Copy

Advanced Data Structures/Algorithms Java

 

Data Analysis and Algorithm Analysis in Java, 2/e

Mark Allen Weiss, Florida International University

ISBN : 0–321–37013–9

 

As the speed and power of computers increase, so does the need for effective programming and algorithm analysis. Mark Allen Weiss approaches these skills jointly to teach the development of well–constructed, maximally efficient programs in Java.

 

Readers benefit from the full language update to Java 5.0, including generics, and the integrated coverage of the Java Collections Library in this advanced study of data structures and algorithms. Weiss clearly explains his careful, rigorous and in–depth analysis of each type of algorithm.

 

This Second Edition features:

 

• Full integration of the new Java 5.0 programming language and the Java Collections Library

 

• Enhanced interior design, with figures and examples illustrating successive stages of algorithms

 

• Completely revised coverage of lists, stacks, and queues in Chapter 3

 

• Full chapter dedicated to the implementation of amortized analysis and advanced data structures

 

• End–of–chapter exercises, ranked by difficulty, reinforce key chapter concepts

 

 

 

Visit aw.com/computing for more information about Addison–Wesley computing books.

About the Author:

Mark Allen Weiss is Professor and Associate Director for the School of Computing and Information Sciences at Florida International University. He is also currently serving as both Director of Undergraduate Studies and Director of Graduate Studies. He received his Bachelor‘s Degree in Electrical Engineering from the Cooper Union in 1983, and his Ph.D. in Computer Science from Princeton University in 1987, working under Bob Sedgewick. He has been at FIU since 1987 and was promoted to Professor in 1996. His interests include data structures, algorithms, and education. He is most well–known for his highly–acclaimed Data Structures textbooks, which have been used for a generation by roughly a million students. Professor Weiss is the author of numerous publications in top–rated journals and was recipient of the University‘s Excellence in Research Award in 1994. In 1996 at FIU he was the first in the world to teach Data Structures using the Java programming language, which is now the de facto standard. From 1997–2004 he served as a member of the Advanced Placement Computer Science Development Committee, chairing the committee from 2000–2004. The committee designed the curriculum and wrote the AP exams that were taken by 20,000 high school students annually. In addition to his Research Award in 1994, Professor Weiss is also the recipient of the University‘s Excellence in Teaching Award in 1999 and the School of Computing and Information Science Excellence in Teaching Award (2005) and Excellence in Service Award (2007). ––This text refers to the Paperback edition.