Book Details

Instructors may access teaching resources by clicking the ‘Request Instructor Resources’ tab next to the title.
Please note that you can subscribe to a maximum of 2 titles.

Data Structures and Algorithm Analysis in C++, 3/e


Data Structures and Algorithm Analysis in C++, 3/e
Author(s)  Mark Allen Weiss
ISBN  9788131714744
Imprint  Pearson Education
Copyright  2007
Pages  606
Binding  Paperback
List Price  Rs. 970.00
  
 
 

The C++ language is brought up-to-date and simplified, and the Standard Template Library is now fully incorporated throughout the text. Data Structures and Algorithm Analysis in C++ is logically organized to cover advanced data structures topics from binary heaps to sorting to NP-completeness. Figures and examples illustrating successive stages of algorithms contribute to Weiss' careful, rigorous and in-depth analysis of each type of algorithm.
  • Contents
  • Features
  • Downloadable Resources

  1. Introduction
  2. Algorithm Analysis
  3. Lists, Stacks, and Queues
  4. Trees
  5. Hashing
  6. Priority Queues (Heaps)
  7. Sorting
  8. The Disjoint Set Class
  9. Graph Algorithms
  10. Algorithm Design Techniques
  11. Amortized Analysis
  12. Advanced Data Structures and Implementation
 

  • Discussion of algorithm and design techniques covers greedy algorithms, divide and conquer algorithms, dynamic programming, randomized algorithms, and backtracking.

  • Covers topics and data structures such as Fibonacci heaps, skew heaps, binomial queue, skip lists and splay trees.
 
Instructor Resources
 


 
Username/ Email  
Password  
If you are new to this site, and you do not have a username and password, please register.