Data structures, algorithms, and applications in Java
Material type: TextPublication details: Boston : McGraw-Hill, c2000Description: xxvi, 833 p. : illustrationsISBN: 007109217X (alk. paper); 9780071092173 ; 0071169008 ; 9780071169004Subject(s): Java (Computer program language) | Data structures (Computer science) | Computer algorithms | Application softwareDDC classification: 005.73Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
Reference Books | Main Library Reference | Reference | 005.73 SAH (Browse shelf(Opens below)) | Available | 009109 |
Browsing Main Library shelves, Shelving location: Reference, Collection: Reference Close shelf browser (Hides shelf browser)
No cover image available | ||||||||
005.72 VAS XML and PHP / | 005.73 BER Data abstraction : the object-oriented approach using C++ | 005.73 FOR Data structures with C++ | 005.73 SAH Data structures, algorithms, and applications in Java | 005.73 SHI Elementary data structures with PASCAL | 005.73 TRE An Introduction to Data Structures with Applications | 005.73 WEI Data structures and algorithm analysis in Java / |
Included Index.
Part I. Preliminaries --
1. Java review --
2. Performance analysis --
3. Asymptotic notation --
4. Performance measurement --
Part II. Data structures --
5. Linear lists: Array representation --
6. Linear lists: Linked representation --
7. Linear lists: Simulated pointers --
8. Arrays and matrices --
9. Stacks --
10. Queues --
11. Skip lists and hashing --
12. Binary and other trees --
13. Priority queues --
14. Tournament trees --
15. Binary search trees --
16. Balanced search trees --
17. Graphs --
Part III. Algorithm-design methods --
18. The greedy method --
19. Divide and conquer --
20. Dynamic programming --
21. Backtracking (on the Web) --
22. Branch and bound (on the Web).
Index
Sahni's "Data Structures, Algorithms, and Applications in Java" is designed to be used in a second course in computer science (CS2). Using Java, this book provides comprehensive coverage of the fundamental data structures, making it an excellent choice for a CS2 course. The author has made this book student-friendly through intuitive discussion, real-world, applications and a gentle introduction. Sahni is unique in providing several real-world applications for each data structure presented in the book. These applications come from such areas as sorting, compression and coding, and image processing. These applications give students a flavor for the sorts of things they will be able to do with the data structures that they are learning. Almost 1,000 exercises in this text serve to reinforce concepts and get students applying what they are learning. Sahni's text is also accompanied by a web site containing all the programs in the book, as well as sample data, generated output, solutions to selected exercises, and enhanced discussion of selected material in the text.
There are no comments on this title.