NU Learning Resource Center OPAC catalog › Details for: Data structures and algorithm analysis in Java /

Normal view MARC view ISBD view

Data structures and algorithm analysis in Java / Mark Allen Weiss

By: Weiss, Mark Allen [author]Material type: Text

TextPublication details: Upper Saddle River, NJ : Pearson Education, c2012Edition: THIRD EDITIONDescription: xx, 614 pages : illustrations ; 24 cmISBN: 9780132576277Subject(s): DATA STRUCTURES (COMPUTER SCIENCE) | | COMPUTER ALGORITHMS | ALGORITHMSLOC classification: GC QA 76.73.J38 .W45 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: 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 7 code including diamonds. This book 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. 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.

Item type:

Books

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 3 )
Comments ( 0 )

Item type	Current library	Home library	Collection	Shelving location	Call number	Copy number	Status	Date due	Barcode
Books	LRC - Graduate Studies	National University - Manila	Gen. Ed. - CCIT	General Circulation	GC QA 76.73.J38 .W45 2012 (Browse shelf (Opens below))	c.1	Available		NULIB000011013

Includes bibliographical references and index.

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 7 code including diamonds. This book 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.

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.

There are no comments on this title.

to post a comment.