Design And Analysis Of Algorithms

By V V Muniswamy more
Selling Price : ₹265.50
MRP : ₹295.00
You will save : ₹29.50 after 10% Discount

Save extra with 3 Offers

Get ₹ 50

Instant Cashback on the purchase of ₹ 400 or above
SAVE10 Already Applied


Get Flat 35% Off on your First Order

Product Specifications

Publisher IK International All Computer Science books by IK International
ISBN 9789380026732
Author: V V Muniswamy
Number of Pages 270
Available in all digital devices

Frequently Brought Together

Design And Analysis Of Algorithms
Design And Analysis Of Algorithms
₹265.50 ₹295.00
Current Selection
Design And Analysis Of Algorithms
Design And Analysis Of Algorithms
₹236.25 ₹350.00
Selected items : 2
Offer Price : You Save :
  • Snapshot
  • About the book

Design And Analysis Of Algorithms by V V Muniswamy
Book Summary:

This book provides a coherent and pedagogically sound framework for learning and teaching. Its breadth of coverage insures that algorithms are carefully and comprehensively discussed with figures and tracing of algorithms. Carefully developing topics with sufficient detail, this text enables students to learn about concepts on their own, offering instructors’ flexibility and allowing them to use the text as lecture reinforcement.

Audience of the Book :
This book is designed for the way we learn and intended for one-semester course in “Design and Analysis of Algorithms”. This is a very useful guide for graduate and undergraduate students and teachers of computer science.
Key Features:

The main features of the book are as follows:

1.Focuses on simple explanations of techniques that can be applied to real-world problems.

2.Presents algorithms with self-explanatory pseudocode.

3.Covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers.

4.Includes chapter summary, self-test quiz and exercises at the end of each chapter. Key to quizzes and solutions to exercises are given in appendices.

Table of Contents:

1. Introduction to Algorithms

2. Disjoint Sets

3. Divide and Conquer

4. Greedy Method

5. Dynamic Programming

6. Backtracking

7. Branch and Bound

8. NP-Complete Problems