Data structures and problem solving using C++ / Mark Allen Weiss.
Material type:

Current library | Collection | Call number | Status | Notes | Date due | Barcode |
---|---|---|---|---|---|---|
Archives Centre | 005.133 WEI (Browse shelf(Opens below)) | Withdrawn Item | 2004-079 | |||
UMI Main Library | Seen During Stock-taking | 005.133 WEI (Browse shelf(Opens below)) | Available | Resource for Academic reference, Research and Development | 2004-077 | |
UMI Main Library | Seen During Stock-taking | 005.133 WEI (Browse shelf(Opens below)) | Available | Resource for Academic reference, Research and Development | 2004-078 |
Browsing UMI Main Library shelves, Collection: Seen During Stock-taking Close shelf browser (Hides shelf browser)
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
||
005.133 LIA Introduction to JAVA programming : | 005.133 LIA Introduction to JAVA programming : | 005.133 WEI Data structures and problem solving using C++ / | 005.133 WEI Data structures and problem solving using C++ / | 005.2 TAN Distributed systems : | 005.2 TAN Distributed systems : | 005.268 PET Linux programming : |
Table of Contents
I. OBJECTS AND C++.
1. Arrays, Pointers, and Structures.
2. Objects and Classes.
3. Templates.
4. Inheritance.
5. Design Patterns.
II. ALGORITHMS AND BUILDING BLOCKS.
6. Algorithm Analysis.
7. The Standard Template Library.
8. Recursion.
9. Sorting Algorithms.
10. Randomization.
III. APPLICATIONS.
11. Fun and Games.
12. Stacks and Compilers.
13. Utilities.
14. Simulation.
15. Graphs and Paths.
IV. IMPLEMENTATIONS.
16. Stacks and Queues.
17. Linked Lists.
18. Trees.
19. Binary Search Trees.
20. Hash Tables.
21. A Priority Queue: The Binary Heap.
V. ADVANCED DATA STRUCTURES.
22. Splay Trees.
23. Merging Priority Queues.
24. The Disjoint Set Class.
Includes bibliographical references and index.
There are no comments on this title.