We specialize in hard to find items
(1)
Data Structures and Algorithm Analysis in Java (2nd Edition)
Share Tweet
*Price and Stocks may change without prior notice
*Packaging of actual item may differ from photo shown
- Electrical items MAY be 110 volts.
- 7 Day Return Policy
- All products are genuine and original
About Data Structures And Algorithm Analysis In Java
Product Description In this text, readers are able to look at specific problems and see how careful implementations can reduce the time constraint for large amounts of data from several years to less than a second. This new edition contains all the enhancements of the new Java 5.0 code including detailed examples and an implementation of a large subset of the Java 5.0 Collections API. This text is for readers who want to learn good programming and algorithm analysis skills simultaneously so that they can develop such programs with the maximum amount of efficiency. Readers should have some knowledge of intermediate programming, including topics as object-based programming and recursion, and some background in discrete math. 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.
