Data structures and problem solving using Java / Mark Allen Weiss
Material type:
TextPublication details: USA : Addison Wesley, 1999Description: xxxii, 780 pISBN: - 9780201549911
- 005.73 W4361
Contents:
1. Primitive java
2. References
3. Objects and classes
4. Inheritance
5. Data structures
6. Recurison
7. Sorting algorithms
8. Ranomization
9. Stacks and compilers
10. Utilities
11. Simulation
12. Graphs and paths
13. Stacks and queues
14. Linked lists
15. Trees
16. Binary search trees
17. Hash tables
18. A priority queue: the binary heap
19. Splay trees
20. Meging priority queues
21. The disjoint set class
| Item type | Current library | Call number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|
Books
|
UE-Central Library | 005.73 W4361 (Browse shelf(Opens below)) | Available | T9703 |
Browsing UE-Central Library shelves Close shelf browser (Hides shelf browser)
| 005.73 L285 Data structures using C and C++ / | 005.73 R1269 Algorithm and data structures | 005.73 S1874 Classic data structures | 005.73 W4361 Data structures and problem solving using Java | 005.74 B535 Data warehousing, data mining, and OLAP | 005.74 B535 Data warehousing, data mining, and OLAP | 005.74 B572 Object-oriented modeling and design for database applications |
1. Primitive java
2. References
3. Objects and classes
4. Inheritance
5. Data structures
6. Recurison
7. Sorting algorithms
8. Ranomization
9. Stacks and compilers
10. Utilities
11. Simulation
12. Graphs and paths
13. Stacks and queues
14. Linked lists
15. Trees
16. Binary search trees
17. Hash tables
18. A priority queue: the binary heap
19. Splay trees
20. Meging priority queues
21. The disjoint set class
There are no comments on this title.
Log in to your account to post a comment.
