Search

Categories

    • categories-img Jacket, Women
    • categories-img Woolend Jacket
    • categories-img Western denim
    • categories-img Mini Dresss
    • categories-img Jacket, Women
    • categories-img Woolend Jacket
    • categories-img Western denim
    • categories-img Mini Dresss
    • categories-img Jacket, Women
    • categories-img Woolend Jacket
    • categories-img Western denim
    • categories-img Mini Dresss
    • categories-img Jacket, Women
    • categories-img Woolend Jacket
    • categories-img Western denim
    • categories-img Mini Dresss
    • categories-img Jacket, Women
    • categories-img Woolend Jacket
    • categories-img Western denim
    • categories-img Mini Dresss

Filter By Price

$
-
$

Dietary Needs

Top Rated Product

product-img product-img

Modern Chair

$165.00
product-img product-img

Plastic Chair

$165.00
product-img product-img

Design Rooms

$165.00

Brands

  • Wooden
  • Chair
  • Modern
  • Fabric
  • Shoulder
  • Winter
  • Accessories
  • Dress

Welcome and thank you for visiting us. For any query call us on 0799 626 359 or Email [email protected]

Offcanvas Menu Open

Shopping Cart

Africa largest book store

Sub Total:

Search for any Title

Algorithms : Design and Analysis

By: (Author) Mangey Ram , (Author) Preeti Malik , (Author) Sushil C. Dimri

Werezi Extended Catalogue
Delivery in 20 days

Ksh 9,550.00

Format: Paperback / Softback

ISBN-10: 3110693410

ISBN-13: 9783110693416

Series: De Gruyter Textbook

Publisher: De Gruyter

Imprint: De Gruyter

Country of Manufacture: GB

Country of Publication: GB

Publication Date: Mar 8th, 2021

Print length: 178 Pages

Weight: 320 grams

Dimensions (height x width x thickness): 17.40 x 24.40 x 1.70 cms

Choose your Location

Shipping & Delivery

Door Delivery

Delivery fee

Delivery in 20 days

  • Description

  • Reviews

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.

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.


Get Algorithms by at the best price and quality guranteed only at Werezi Africa largest book ecommerce store. The book was published by De Gruyter and it has pages. Enjoy Shopping Best Offers & Deals on books Online from Werezi - Receive at your doorstep - Fast Delivery - Secure mode of Payment

Customer Reviews

Based on 0 reviews

Mind, Body, & Spirit