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

Item type | Current library | Home library | Collection | Shelving location | Call number | Copy number | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|---|---|
![]() |
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 |
Browsing National University - Manila shelves, Shelving location: General Circulation, Collection: General Education Close shelf browser (Hides shelf browser)
No cover image available |
![]() |
No cover image available |
![]() |
![]() |
![]() |
No cover image available | ||
GC QA 76.9.S88 .K34 1983 The design of operating systems for small computer systems | GC QA 76.9.V5 .S56 2017 Next-Gen virtualization / | GC QA 76.64 .F34 1992 Borland C++ 3.1 object-oriented programming | GC QA 76.73.J38 .G66 2014 Data structures and algorithms in Java / | GC QA 76.73.J38 .W457 2012 Data structures and algorithm analysis in Java / | GC QA 76.73.J39 .P65 2010 Javascript : a beginner's guide | GC QA 76.73.P2 .H55 1987 Applied data structures using Pascal |
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.