TY  - BOOK
AU  - Sahni,Sartaj
TI  - Data structures, algorithms, and applications in Java 
SN  - 007109217X (alk. paper)
U1  - 005.73 
PY  - 2000///
CY  - Boston
PB  - McGraw-Hill
KW  - Java (Computer program language)
KW  - Data structures (Computer science)
KW  - Computer algorithms
KW  - Application software
N1  - 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
N2  - 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
ER  -