Items related to Data Structures and Algorithm Analysis in Java
Synopsis
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.
"synopsis" may belong to another edition of this title.
From the Back Cover
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 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
"About this title" may belong to another edition of this title.
- PublisherAddison Wesley
- Publication date2003
- ISBN 10 0321223500
- ISBN 13 9780321223500
- BindingPaperback
- LanguageEnglish
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want
