Data structures, algorithms, and applications in Java (Record no. 38787)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 02468cam a22002414a 4500 |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
ISBN | 007109217X (alk. paper) |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
ISBN | 9780071092173 |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
ISBN | 0071169008 |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
ISBN | 9780071169004 |
082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 005.73 |
Item number | SAH |
100 1# - MAIN ENTRY--AUTHOR NAME | |
Personal name | Sahni, Sartaj. |
245 10 - TITLE STATEMENT | |
Title | Data structures, algorithms, and applications in Java |
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
Place of publication | Boston : |
Name of publisher | McGraw-Hill, |
Year of publication | c2000. |
300 ## - PHYSICAL DESCRIPTION | |
Number of Pages | xxvi, 833 p. : |
Other physical details | illustrations ; |
500 ## - GENERAL NOTE | |
General note | Included Index. |
505 ## - FORMATTED CONTENTS NOTE | |
Formatted contents note | Part I. Preliminaries --<br/>1. Java review --<br/>2. Performance analysis --<br/>3. Asymptotic notation --<br/>4. Performance measurement --<br/>Part II. Data structures --<br/>5. Linear lists: Array representation --<br/>6. Linear lists: Linked representation --<br/>7. Linear lists: Simulated pointers --<br/>8. Arrays and matrices --<br/>9. Stacks --<br/>10. Queues --<br/>11. Skip lists and hashing --<br/>12. Binary and other trees --<br/>13. Priority queues --<br/>14. Tournament trees --<br/>15. Binary search trees --<br/>16. Balanced search trees --<br/>17. Graphs --<br/>Part III. Algorithm-design methods --<br/>18. The greedy method --<br/>19. Divide and conquer --<br/>20. Dynamic programming --<br/>21. Backtracking (on the Web) --<br/>22. Branch and bound (on the Web).<br/>Index |
520 ## - SUMMARY, ETC. | |
Summary, etc | 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. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Java (Computer program language) |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Data structures (Computer science) |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Computer algorithms. |
650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical Term | Application software |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Koha item type | Reference Books |
Collection code | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Cost, normal purchase price | Full call number | Accession Number | Koha item type |
---|---|---|---|---|---|---|---|---|---|
Reference | Main Library | Main Library | Reference | 09/11/2004 | Purchased | 2744.50 | 005.73 SAH | 009109 | Reference Books |