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

Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|---|
![]() |
National University - Manila | LRC - Main General Circulation | Digital Forensic | GC QA 76.73 .G66 2014 (Browse shelf(Opens below)) | c.1 | Available | NULIB000011019 |
Includes 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 Text Processing -- 13 Sorting and Selection -- 14 Graph Algorithms -- 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.
There are no comments on this title.