Data structures and algorithms in JavaTM / Michael T. Goodrich
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 - Main General Circulation | Gen. Ed. - CCIT | GC QA 76.73.J38 .G66 2014 c.1 (Browse shelf(Opens below)) | c.1 | Available | NULIB000009647 |
Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Gen. Ed. - CCIT Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
GC QA 76.73.J38 .D45 2012 Java : how to program / | GC QA 76.73.J38 .F37 1999 Java programming with microsoft visual J++ 6.0: Introductory / | GC QA 76.73.J38 .F37 2016 Java programming / | GC QA 76.73.J38 .G66 2014 c.1 Data structures and algorithms in JavaTM / | GC QA 76.73.J38 .H8 2019 Easy learning data structures algorithms java practice / | GC QA 76.73.J38 .H67 2013 vol.1 Core Java volume 1 -- Fundamentals / | GC QA 76.73.J38 .H67 2019 Core Java : volume II-advanced features / |
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 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.