Design & Analysis of Algorithms

Short Description:-
In Stock
ISBN978-93-5014-091-8
AuthorVinod K. Rajput
PublisherS.K. Kataria & Sons
Edition2nd 2011
Reprint2017
Publish Year2010
Total Pages625
BookTypePrint
Availablity In Stock
Rs 375.00Rs 338.00

CONTENTS

• Introduction • Growth of Functions • Recurrence • Sorting Algorithms • Divide and Conquer • Heapsort • Quicksort • Sorting in Linear Time • Median and Order Statistics • Red Black Tree • Augmenting Data Structures • Dynamic Programming • Greedy Algorithms • Amortized Analysis • B-tree • Binomial Heaps • Fibonacci Heaps • Data Structures for Disjoint Sets • Backtracking • Branch and Bound • Elementary Graph Algorithms • Minimum Spanning Tree • Single Source Shortest Paths • All Pairs Shortest Paths • Maximum Flow • Sorting Networks • Matrix Operations • Polynomials and the FFT • Number Theoretic Algorithms • String Matching • NP-Completeness • Approximation Algorithms • Previous Year Question Papers • Bibliography • Index.


  • Author : Vinod K. Rajput
  • Publisher : S.K. Kataria & Sons
  • Edition : 2nd 2011
  • Reprint : 2017
  • Publishing Year : 2010
  • Total Pages : 625

Customer Reviews

  • Be the first one to give review to this Book.

You're reviewing :

Design & Analysis of Algorithms

SIMILAR PRODUCTS

Related Products

My Wish List

Please login to access Wishltist

   Economy Delivery(Print Book Only):
in 7 - 10 Working Days.

 Express Delivery(Print Book Only) :
in 5 -7 Working Days

Subject to availability.