Data structures, algorithms, and applications in Java / Sartaj Sahni.
Material type:
TextPublication details: Boston : McGraw-Hill, c2000.Description: xxvi, 833 p. : ill. ; 24 cmISBN: - 007109217X (alk. paper)
- 9780071092173
- QA76.73.J38 .S24
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Books
|
Methodist University Library Main General Stacks | QA76.73.J38 .S24 (Browse shelf(Opens below)) | Available | 16014 |
Includes Index
pt. I. Preliminaries --
Ch. 1. Java Review --
Ch. 2. Performance Analysis of Programs --
Ch. 3. Asymptotic Notation --
Ch. 4. Performance Measurement of Programs --
pt. II. Data Structures --
Ch. 5. Linear Lists --
Array Representation --
Ch. 6. Linear Lists --
Linked Representation --
Ch. 7. Linear Lists --
Simulated Pointers --
Ch. 8. Arrays and Matrices --
Ch. 9. Stacks --
Ch. 10. Queues --
Ch. 11. Skip Lists and Hashing --
Ch. 12. Binary and Other Trees --
Ch. 13. Priority Queues --
Ch. 14. Tournament Trees --
Ch. 15. Binary Search Trees --
Ch. 16. Balanced Search Trees --
Ch. 17. Graphs --
pt. III. Algorithm-Design Methods --
Ch. 18. The Greedy Method --
Ch. 19. Divide and Conquer --
Ch. 20. Dynamic Programming --
Ch. 21. Backtracking (On the Web) --
Ch. 22. Branch and Bound (On the Web).
There are no comments on this title.