Data structures and algorithms in Java / Michael T. Goodrich, Roberto Tamassia and Michael H. Goldwasser

By: Goodrich, Michael T [author]Contributor(s): Tammassia, Roberto [co-author ] | Michael H. Goldwasser [co-author ]Material type: TextTextPublication details: Hoboken, NJ : John Wiley & Sons, c2014Edition: SIXTH EDITIONDescription: xvi, 720 pages : illustrations ; 23 cmISBN: 9781118771334Subject(s): COMPUTER ALGORITHMS | DATA STRUCTURES (COMPUTER SCIENCE) | JAVA (COMPUTER PROGRAM LANGUAGE)LOC classification: QA 76.73.J38 .G66 2014
Contents:
1. Java primer -- 2. Object-oriented design -- 3. Fundamental data structures -- 4. Algorithm analysis -- 5. Recursion -- 6. Stacks, queues and deques -- 7. List and iterator ADTs -- 8.Trees -- 9. Priority queues -- 10. Maps, hash tables and skip lists -- 11. Search trees -- 12. Sorting and selection -- 13. Text processing -- 14. Graph algorithm -- 15.Memory management and B-Trees.
Summary: The design and analysis of efficient data structures has long been recognized as a key component of the Computer Science curriculum. Goodrich and Tomassia's approach to this classic topic is based on the object-oriented paradigm as the framework of choice for the design of data structures. For each ADT presented in the text, the authors provide an associated Java interface. Concrete data structures realizing the ADTs are provided as Java classes implementing the interfaces. The Java code implementing fundamental data structures in this book is organized in a single Java package, net.datastructures. This package forms a coherent library of data structures and algorithms in Java specifically designed for educational purposes in a way that is complimentary with the Java Collections Framework.
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)
Item type Current library Home library Collection Shelving location Call number Copy number Status Date due Barcode
Books Books LRC - Graduate Studies
National University - Manila
General Education General Circulation GC QA 76.73.J38 .G66 2014 (Browse shelf (Opens below)) c.1 Available NULIB000011345

Includes bibliographical references and index.

1. Java primer -- 2. Object-oriented design -- 3. Fundamental data structures -- 4. Algorithm analysis -- 5. Recursion -- 6. Stacks, queues and deques -- 7. List and iterator ADTs -- 8.Trees -- 9. Priority queues -- 10. Maps, hash tables and skip lists -- 11. Search trees -- 12. Sorting and selection -- 13. Text processing -- 14. Graph algorithm -- 15.Memory management and B-Trees.

The design and analysis of efficient data structures has long been recognized as a key component of the Computer Science curriculum. Goodrich and Tomassia's approach to this classic topic is based on the object-oriented paradigm as the framework of choice for the design of data structures. For each ADT presented in the text, the authors provide an associated Java interface. Concrete data structures realizing the ADTs are provided as Java classes implementing the interfaces. The Java code implementing fundamental data structures in this book is organized in a single Java package, net.datastructures. This package forms a coherent library of data structures and algorithms in Java specifically designed for educational purposes in a way that is complimentary with the Java Collections Framework.

There are no comments on this title.

to post a comment.

© 2021 NU LRC. All rights reserved.Privacy Policy I Powered by: KOHA