Data structures, algorithms, and applications in C++ (Record no. 11483)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 01859cam a22002294a 4500 |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 0929306325 (alk. paper) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9780929306322 |
| 082 00 - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 005.133 |
| Item number | SAH |
| 100 1# - MAIN ENTRY--AUTHOR NAME | |
| Personal name | Sahni, Sartaj. |
| 245 10 - TITLE STATEMENT | |
| Title | Data structures, algorithms, and applications in C++ |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 2nd Edition. |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
| Place of publication | Summit, NJ : |
| Name of publisher | Silicon Press, |
| Year of publication | c2005. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | xxiv, 792, 11 p. : |
| Other physical details | illustrations ; |
| 500 ## - GENERAL NOTE | |
| General note | Included Index. |
| 505 ## - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Part I. Preliminaries --<br/>1. C++ 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. Arrays and matrices --<br/>8. Stacks --<br/>9. Queues --<br/>10. Skip lists and hashing --<br/>11. Binary and other trees --<br/>12. Priority queues --<br/>13. Tournament trees --<br/>14. Binary search trees --<br/>15. Balanced search trees --<br/>16. Graphs --<br/>Part III. Algorithm-design methods --<br/>17. The greedy method --<br/>18. Divide and conquer --<br/>19. Dynamic programming --<br/>20. Backtracking (on the Web) --<br/>21. Branch and bound (on the Web). |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | This text provides students with an introduction to data structures and algorithms. It emphasizes algorithm analysis and the development of efficient code, and includes important background material. Divided into three parts, the text features Data Structure Application sections at the end of each chapter in part two, Algorithm Application sections in each design method chapter in part three, and a gradual development of C++ features not found in C to help students with either a background in C or C++ to comprehend topics in the book. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical Term | C++ (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 | 24/07/2003 | Purchased | 17000.00 | 005.133 SAH | 013410 | Reference Books |