menu
{ "item_title" : "Analysis and Design of Algorithms", "item_author" : [" Anuradha A. Puntambekar "], "item_description" : "This well-organized textbook provides the design techniques of algorithms in a simple and straight forward manner.The book begins with a description of the fundamental concepts such as algorithm, functions and relations, vectors and matrices. Then it focuses on efficiency analysis of algorithms. In this unit, the technique of computing time complexity of the algorithm is discussed along with illustrative examples.Gradually, the text discusses various algorithmic strategies such as divide and conquer, dynamic programming, Greedy algorithm, backtracking and branch and bound. Finally the string matching algorithms and introduction to NP completeness is discussed. Each algorithmic strategy is explained in stepwise manner, followed by examples and pseudo code.Thus this book helps the reader to learn the analysis and design of algorithms in the most lucid way.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/9/33/322/386/933322386X_b.jpg", "price_data" : { "retail_price" : "110.73", "online_price" : "110.73", "our_price" : "110.73", "club_price" : "110.73", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Analysis and Design of Algorithms|Anuradha A. Puntambekar

Analysis and Design of Algorithms : Conceptual Approach

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

This well-organized textbook provides the design techniques of algorithms in a simple and straight forward manner.The book begins with a description of the fundamental concepts such as algorithm, functions and relations, vectors and matrices. Then it focuses on efficiency analysis of algorithms. In this unit, the technique of computing time complexity of the algorithm is discussed along with illustrative examples.Gradually, the text discusses various algorithmic strategies such as divide and conquer, dynamic programming, Greedy algorithm, backtracking and branch and bound. Finally the string matching algorithms and introduction to NP completeness is discussed. Each algorithmic strategy is explained in stepwise manner, followed by examples and pseudo code.Thus this book helps the reader to learn the analysis and design of algorithms in the most lucid way.

This item is Non-Returnable

Details

  • ISBN-13: 9789333223867
  • ISBN-10: 933322386X
  • Publisher: Amazon Digital Services LLC - KDP Print US
  • Publish Date: December 2020
  • Dimensions: 9.69 x 7.44 x 1.38 inches
  • Shipping Weight: 2.67 pounds
  • Page Count: 690

Related Categories

You May Also Like...

    1

BAM Customer Reviews