Data structures and algorithms / Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman.
Material type:
- 201000237
- QA 76.9.D35 .A46 1983

Item type | Current library | Home library | Collection | Call number | Copy number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|---|
![]() |
National University - Manila | LRC - Annex Relegation Room | Computer Science | GC QA 76.9.D35 .A46 1983 c.2 (Browse shelf(Opens below)) | c.2 | Available | NULIB000002781 | ||
![]() |
National University - Manila | LRC - Main General Circulation | Computer Science | GC QA 76.9.D35 .A46 1983 c.1 (Browse shelf(Opens below)) | c.1 | Available | NULIB000002221 |
Browsing LRC - Main shelves, Shelving location: General Circulation, Collection: Computer Science Close shelf browser (Hides shelf browser)
No cover image available | No cover image available |
![]() |
No cover image available | No cover image available |
![]() |
![]() |
||
GC QA 76.9.D32 .J66 1990 FoxPro made easy / | GC QA 76.9.D32 .L66 1992 dBASE IV 1.5 programming language / | GC QA 76.9.D33 .C37 2015 c.2 Data structures and abstractions with JavaTM / | GC QA 76.9.D35 .A46 1983 c.1 Data structures and algorithms / | GC QA 76.9.D35 .K78 1991 Data structures and program design in C / | GC QA 76.9.D35 .K78 1997 Data structures and program design in C / | GC QA 76.9.D35 .S53 1997 A Practical introduction to data structures and algorithm analysis / |
Includes bibliographical references and index.
Chapter 1. Design and analysis of algorithms -- Chapter 2. Basic data types -- Chapter 3. Trees -- Chapter 4. Basic operations on sets -- Chapter 5. Advanced set representation methods -- Chapter 6. Directed graphs -- Chapter 7. Undirected graphs -- Chapter 8. Sorting -- Chapter 9. Algorithm analysis techniques -- Chapter 10. Algorithm design technique -- Chapter 11. Data structures and algorithms for external storage -- Chapter 12. Memory management -- Bibliography -- Index.
The authors' treatment of data structures in Data Structures and Algorithms is unified by an informal notion of "abstract data types," allowing readers to compare different implementations of the same concept. Algorithm design techniques are also stressed and basic algorithm analysis is covered. Most of the programs are written in Pascal.
There are no comments on this title.