Amazon cover image
Image from Amazon.com

Data structures and algorithm analysis in Java / Mark Allen Weiss

By: Material type: TextTextPublication details: Boston, Massachusetts : Pearson Education, c2012Edition: Third editionDescription: 632 pages : illustrations ; 23 cmISBN:
  • 9780273752110
Subject(s): LOC classification:
  • QA 76.73.J38 .W457 2012
Contents:
1. Introduction -- 2. Algorithm analysis -- 3. Lists, stacks, and queues -- 4. Trees -- 5. Hashing -- 6. Priority queues (heaps) -- 7. Sorting -- 8. The disjoint set class -- 9. Graph algorithms -- 10. Algorithm design techniques -- 11. Amortized analysis -- 12. Advanced data structures and implementation.
Summary: Data Structures and Algorithm Analysis in Java is an “advanced algorithms” book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. 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. 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. 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 complement the text’s coverage.
Item type: Books
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Call number Copy number Status Date due Barcode
Books Books National University - Manila LRC - Graduate Studies General Circulation General Education GC QA 76.73.J38 .W457 2012 (Browse shelf(Opens below)) c.1 Available NULIB000009220

Includes bibliographical references and index.

1. Introduction -- 2. Algorithm analysis -- 3. Lists, stacks, and queues -- 4. Trees -- 5. Hashing -- 6. Priority queues (heaps) -- 7. Sorting -- 8. The disjoint set class -- 9. Graph algorithms -- 10. Algorithm design techniques -- 11. Amortized analysis -- 12. Advanced data structures and implementation.

Data Structures and Algorithm Analysis in Java is an “advanced algorithms” book that fits between traditional CS2 and Algorithms Analysis courses. In the old ACM Curriculum Guidelines, this course was known as CS7. 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. 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. 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 complement the text’s coverage.

There are no comments on this title.

to post a comment.