Library Logo
Normal view MARC view ISBD view

Data structures, algorithms, and applications in Java /

by Sahni, Sartaj.
Material type: materialTypeLabelBookPublisher: Boston : McGraw-Hill, c2000Description: xxvi, 833 p. : ill. ; 24 cm. + 1 computer optical disc (4 3/4 in.).ISBN: 007109217X (alk. paper); 0071169008.Subject(s): Java (Computer program language) | Data structures (Computer science) | Computer algorithms | Application software -- Development
Contents:
Preliminaries. Java Review. Performance Analysis of Programs. Asymptotic Notation. Performance Measurement of Programs -- Data Structures. Linear Lists - Array Representation. Linear Lists - Linked Representation. Linear Lists - Simulated Pointers. Arrays and Matrices. Stacks. Queues. Skip Lists and Hashing. Binary and Other Trees. Priority Queues. Tournament Trees. Binary Search Trees. Balanced Search Trees. Graphs -- Algorithm-Design Methods. The Greedy Method. Divide and Conquer. Dynamic Programming. Backtracking (On the Web). Branch and Bound (On the Web).
Review: "Data Structures, Algorithms, and Applications in Java provides comprehensive coverage of fundamental data structures, making it ideal for use in a CS2 course. Sahni has made this text the most student friendly of all his text-books by using a gentle introduction, providing intuitive discussions, and including real-world applications."--BOOK JACKET.
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
Item type Current location Collection Call number Copy number Status Date due Barcode
Books Books Dhaka University Science Library
General Stacks
Non Fiction 005.74 SAD (Browse shelf) 1 Available 391927
Books Books Dhaka University Science Library
General Stacks
Non Fiction 005.74 SAD (Browse shelf) 2 Available 391928

Includes bibliographical references and index.

Pt. I. Preliminaries. Ch. 1. Java Review. Ch. 2. Performance Analysis of Programs. Ch. 3. Asymptotic Notation. Ch. 4. Performance Measurement of Programs -- Pt. II. Data Structures. Ch. 5. Linear Lists - Array Representation. Ch. 6. Linear Lists - Linked Representation. Ch. 7. Linear Lists - Simulated Pointers. Ch. 8. Arrays and Matrices. Ch. 9. Stacks. Ch. 10. Queues. Ch. 11. Skip Lists and Hashing. Ch. 12. Binary and Other Trees. Ch. 13. Priority Queues. Ch. 14. Tournament Trees. Ch. 15. Binary Search Trees. Ch. 16. Balanced Search Trees. Ch. 17. Graphs -- Pt. III. Algorithm-Design Methods. Ch. 18. The Greedy Method. Ch. 19. Divide and Conquer. Ch. 20. Dynamic Programming. Ch. 21. Backtracking (On the Web). Ch. 22. Branch and Bound (On the Web).

"Data Structures, Algorithms, and Applications in Java provides comprehensive coverage of fundamental data structures, making it ideal for use in a CS2 course. Sahni has made this text the most student friendly of all his text-books by using a gentle introduction, providing intuitive discussions, and including real-world applications."--BOOK JACKET.

There are no comments for this item.

Log in to your account to post a comment.
Last Updated on September 15, 2019
© Dhaka University Library. All Rights Reserved|Staff Login