Data structures and algorithms in Java / Michael T. Goodrich, Roberto Tamassia and Michael H. Goldwasser
Material type:
- 9781118771334
- QA 76.73.J38 .G66 2014

Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|---|
![]() |
National University - Manila | LRC - Graduate Studies General Circulation | General Education | GC QA 76.73.J38 .G66 2014 c.2 (Browse shelf(Opens below)) | c.2 | Available | NULIB000011345 |
Browsing LRC - Graduate Studies shelves, Shelving location: General Circulation, Collection: General Education Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
No cover image available | ||
GC QA 76.9 .G46 2015 Distributed systems : an algorithmic approach / | GC QA 76.9 .G65 2016 Practical machine learning / | GC QA 76.9 .R49 2016 Big data beginners : understanding smart big data, data mining and data analytics for improved business performance, life decisions and more! / | GC QA 76.73.J38 .G66 2014 c.2 Data structures and algorithms in Java / | GC QA 76.73.J38 .W457 2012 Data structures and algorithm analysis in Java / | GC RA 440.5 .L36 1998 The public health-human values connection / | GC RJ 501 .M67 1974 c.2 Movement experiences for the mentally retarded or emotionally disturbed child / |
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.