Data structures, algorithms, and applications in C++

By: Sahni, SartajMaterial type: TextTextPublication details: Summit, NJ : Silicon Press, c2005Edition: 2nd EditionDescription: xxiv, 792, 11 p. : illustrationsISBN: 0929306325 (alk. paper); 9780929306322Subject(s): C++ (Computer program language) | Data structures (Computer science) | Computer algorithms | Application softwareDDC classification: 005.133
Contents:
Part I. Preliminaries -- 1. C++ 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. Arrays and matrices -- 8. Stacks -- 9. Queues -- 10. Skip lists and hashing -- 11. Binary and other trees -- 12. Priority queues -- 13. Tournament trees -- 14. Binary search trees -- 15. Balanced search trees -- 16. Graphs -- Part III. Algorithm-design methods -- 17. The greedy method -- 18. Divide and conquer -- 19. Dynamic programming -- 20. Backtracking (on the Web) -- 21. Branch and bound (on the Web).
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
Reference Books Reference Books Main Library
Reference 		Reference 005.133 SAH (Browse shelf(Opens below)) Available 013410
Total holds: 0

Included Index.

Part I. Preliminaries --
1. C++ 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. Arrays and matrices --
8. Stacks --
9. Queues --
10. Skip lists and hashing --
11. Binary and other trees --
12. Priority queues --
13. Tournament trees --
14. Binary search trees --
15. Balanced search trees --
16. Graphs --
Part III. Algorithm-design methods --
17. The greedy method --
18. Divide and conquer --
19. Dynamic programming --
20. Backtracking (on the Web) --
21. Branch and bound (on the Web).

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.

There are no comments on this title.

to post a comment.

© University of Vavuniya

---