×







We sell 100% Genuine & New Books only!

Design And Analysis Of Algorithms 2013 Edition at Meripustak

Design And Analysis Of Algorithms 2013 Edition by Manas Ranjan Kabat , PHI Learning

Books from same Author: Manas Ranjan Kabat

Books from same Publisher: PHI Learning

Related Category: Author List / Publisher List


  • Price: ₹ 295.00/- [ 0.00% off ]

    Seller Price: ₹ 295.00

Estimated Delivery Time : 4-5 Business Days

Shipping Charge : Rs. 100.00

Sold By: Meripustak      Click for Bulk Order

Free Shipping (for orders above ₹ 499) *T&C apply.

In Stock

We deliver across all postal codes in India

Orders Outside India


Add To Cart


Outside India Order Estimated Delivery Time
7-10 Business Days


  • We Deliver Across 100+ Countries

  • MeriPustak’s Books are 100% New & Original
  • General Information  
    Author(s)Manas Ranjan Kabat
    PublisherPHI Learning
    ISBN9788120348066
    Pages356
    BindingPaperback
    LanguageEnglish
    Publish YearDecember 2013

    Description

    PHI Learning Design And Analysis Of Algorithms 2013 Edition by Manas Ranjan Kabat

    Primarily designed as a text for undergraduate students of computer science and engineering and information technology, and postgraduate students of computer applications, the book would also be useful to postgraduate students of computer science and IT (M.Sc., Computer Science; M.Sc., IT). The objective of this book is to expose students to basic techniques in algorithm design and analysis.This well organized text provides the design techniques of algorithms in a simple and straightforward manner. Each concept is explained with an example that helps students to remember the algorithm devising techniques and analysis. The text describes the complete development of various algorithms along with their pseudo-codes in order to have an understanding of their applications. It also discusses the various design factors that make one algorithm more efficient than others, and explains how to devise the new algorithms or modify the existing ones.Key FeaturesRandomized and approximation algorithms are explained well to reinforce the understanding of the subject matter.Various methods for solving recurrences are well explained with examples.NP-completeness of various problems are proved with simple explanation.



    Book Successfully Added To Your Cart