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, 2/e


Data Structures and Algorithm Analysis in C, 2/e
Author(s)  Mark Allen Weiss
ISBN  9788177583588
Imprint  Pearson Education
Copyright  1997
Pages  528
Binding  Paperback
List Price  Rs. 890.00
  
 
 

In the second edition of this best-selling book, the author continues to refine and enhance his innovative approach to algorithms and data structures. Using a C implementation, he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time.
  • About the Authors
  • Contents
  • Features
  • Downloadable Resources

Mark Allen Weiss belongs to the Department of Computer Science at the Florida International University.
 

  • Introduction
  • Algorithms Analysis
  • Lists, Stacks, and Queues
  • Trees
  • Hashing
  • Priority Queues (Heaps)
  • Sorting
  • The Disjoint Set ADT
  • Graphs Algorithms
  • Algorithm Design Techniques
  • Amortized Analysis
  • Advanced Data Structures and Implementation
 

  • Includes a chapter on algorithm and design techniques that cover greedy algorithms, divide and conquer algorithms, dynamic programming, randomized algorithms and backtracking.
  • Presents current topics and newer data structures such as Fibonacci heaps, skew heaps, binomial queues, skip lists and splay trees.
  • Incorporates new results on the average case analysis of heapsort.
  • Offers source code from example programme via anonymous FTP.
 
Instructor Resources
 


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