Computer Algorithms C++

Contents: Preface. Index. 1. Introduction. 2. Elementary Data Structures. 3. Divide-and-Conquer. 4. The Greedy Method. 5. Dynamic Programming. 6. Basic Traversal and Search Techniques. 7. Backtracking. 8. Branch and Bound. 9. Algebraic Problems. 10. Lower Bound Theory. 11. NP-Hard and NP-Complete Problems. 12. Approximation Algorithms. 13. PRAM Algorithms. 14. Mesh Algorithms. 15. Hypercube.

This is the thoroughly revised and updated edition of the text that helped establish computer algorithms as a discipline of computer science. Using the popular object-oriented language C++, the text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer science education. A major strength of this text is its focus on design techniques rather than on individual algorithms.

The second edition of Computer Algorithms/C++ emphasizes:

Design techniques: Divide and conquer, the greedy method, dynamic programming, backtracking, and branch and bound are illustrated with several examples. Each algorithm is completely analyzed.
Examples: A wide range of examples provides students with the actual implementation of the correct design.
The latest research: A thorough treatment of probabilistic and parallel algorithms is included.
Full integration of randomized algorithms: Performance with nonrandomized algorithms is thoroughly compared.
Computer Algorithms/C++ is appropriate as a core text for upper- and graduate-level courses in algorithms.

This edition of Computer Algorithms/C++ is distributed with a free lab manual containing solutions of the laboratory exercises prescribed by VTU for the paper titled Design and Analysis of Algorithms.

The lab manual is authored by Dr K Santhi Sree, Professor, School of Information Technology, Jawaharlal Nehru Technological University (JNTUH), Hyderabad.