Data structures and algorithms in java / by Adam Drozdek

By: Dfrozdek, AdamMaterial type: TextTextPublication details: London : Brooks/cole Thomson Learning, 2005cEdition: 2nd edDescription: xvii, 752 p. : ill. ; 25 cmISBN: 0534492525 (hbk)Subject(s): Computer algorithmsDDC classification: 005.73
Contents:
1. Object-Oriented Programming Using Java 2. Complexity Analysis 3. Linked Lists 4. Stacks and Queues 5. Recursion 6. Binary Trees 7. Multiway Trees 8. Graphs 9. Sorting 10. Hashing 11. Data Compression 12. Memory Management 13. String Matching Appendix A: Computing BIG-O Appendix B: NP-Completene
Summary: Highlights three important aspects of data structures and algorithms. Overall, this practical and theoretical book prepares students with a solid foundation in data structures for future courses and work in design implementation, testing or maintenance of virtually any software system.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current library Call number Copy number Status Date due Barcode Item holds
Books Books Namal Library
Computer Science
005.73 DRO-D 2005 833 (Browse shelf (Opens below)) Available 833
Books Books Namal Library
Computer Science
005.73 DRO-D 2005 889 (Browse shelf (Opens below)) 2 Available 889
Total holds: 0
Browsing Namal Library shelves, Shelving location: Computer Science Close shelf browser (Hides shelf browser)
005.7262 DUF-H 2003 1065 How to do everything with JavaScript / 005.73 DAL-C 2013 3391 C++ Plus Data Structures. 005.73 DAL-C 2015 10141 C++ Plus Data Structures. 005.73 DRO-D 2005 889 Data structures and algorithms in java / 005.73 DRO-D 2005 833 Data structures and algorithms in java / 005.73 DRO-D 2013 4453 Data structures and algorithms in java / 005.73 GOO-D 2007 2823 Data structure and algorithm /

Index included

1. Object-Oriented Programming Using Java 2. Complexity Analysis 3. Linked Lists 4. Stacks and Queues 5. Recursion 6. Binary Trees 7. Multiway Trees 8. Graphs 9. Sorting 10. Hashing 11. Data Compression 12. Memory Management 13. String Matching Appendix A: Computing BIG-O Appendix B: NP-Completene

Highlights three important aspects of data structures and algorithms. Overall, this practical and theoretical book prepares students with a solid foundation in data structures for future courses and work in design implementation, testing or maintenance of virtually any software system.

There are no comments on this title.

to post a comment.