menu
{ "item_title" : "Algorithms", "item_author" : [" Sushil C. Dimri", "Preeti Malik", "Mangey Ram "], "item_description" : "Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects.From the Table of Contents:Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions.Chapter 2: Different Sorting Techniques and their analysis.Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics.Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms.Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap.Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/11/069/341/3110693410_b.jpg", "price_data" : { "retail_price" : "69.99", "online_price" : "69.99", "our_price" : "69.99", "club_price" : "69.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Algorithms|Sushil C. Dimri

Algorithms : Design and Analysis

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

Overview

Algorithms play a central role both in the theory and in the practice of computing. The goal of the authors was to write a textbook that would not trivialize the subject but would still be readable by most students on their own. The book contains over 120 exercises. Some of them are drills; others make important points about the material covered in the text or introduce new algorithms not covered there. The book also provides programming projects.

From the Table of Contents:

Chapter 1: Basic knowledge of Mathematics, Relations, Recurrence relation and Solution techniques, Function and Growth of functions.

Chapter 2: Different Sorting Techniques and their analysis.

Chapter 3: Greedy approach, Dynamic Programming, Branch and Bound techniques, Backtracking and Problems, Amortized analysis, and Order Statics.

Chapter 4: Graph algorithms, BFS, DFS, Spanning Tree, Flow Maximization Algorithms. Shortest Path Algorithms.

Chapter 5: Binary search tree, Red black Tree, Binomial heap, B-Tree and Fibonacci Heap.

Chapter 6: Approximation Algorithms, Sorting Networks, Matrix operations, Fast Fourier Transformation, Number theoretic Algorithm, Computational geometry Randomized Algorithms, String matching, NP-Hard, NP-Completeness, Cooks theorem.

Details

  • ISBN-13: 9783110693416
  • ISBN-10: 3110693410
  • Publisher: de Gruyter
  • Publish Date: March 2021
  • Dimensions: 9.61 x 6.69 x 0.38 inches
  • Shipping Weight: 0.65 pounds
  • Page Count: 178

Related Categories

You May Also Like...

    1

BAM Customer Reviews