Data structures and algorithms in C++ / Adam Drozdek.

By: Drozdek, AdamMaterial type: TextTextPublisher: Boston, Mass. : Thomson/Course Technology, �2005Edition: 3rd edDescription: xvi, 758 pages : illustrations ; 25 cmContent type: text Media type: unmediated Carrier type: volumeISBN: 0534491820; 9780534491826Subject(s): C++ (Computer program language) | Data structures (Computer science) | Computer algorithms | C++ (Langage de programmation) | Structures de donn�ees (Informatique) | Algorithmes (Informatique) | C++ (Computer program language) | Computer algorithms | Data structures (Computer science) | C++ | DatenstrukturAdditional physical formats: Online version:: Data structures and algorithms in C++.DDC classification: 005.13/3 LOC classification: QA76.73 | .J3 D35 2005Other classification: ST 250 C01 Also issued online.
Contents:
1. Object-oriented programming using C++ -- 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 -- Appendixes A-C -- Name index -- Subject index.
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 location Home library Shelving location Call number Status Notes Date due Barcode
Book Book AU LIBRARY
AU LIBRARY
Open Shelf QA76.73 .J3 D35 2005 (Browse shelf) Available SO 28001850

Includes bibliographical references and indexes.

1. Object-oriented programming using C++ -- 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 -- Appendixes A-C -- Name index -- Subject index.

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.

Also issued online.

There are no comments on this title.

to post a comment.

Powered by Koha