Design And Analysis Of Algorithms

By I. Chandra Mohan more
Selling Price : ₹138.94
MRP : ₹195.00
You will save : ₹56.06 after 29% Discount

Enter your email id to read this ebook

Save extra with 3 Offers

Get ₹ 50

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


Get Flat 35% Off on your First Order

Product Specifications

Publisher PHI Learning All Information Technology books by PHI Learning
ISBN 9788120345751
Author: I. Chandra Mohan
Number of Pages 199
Available in all digital devices
  • Snapshot
  • About the book
  • Sample book
Design And Analysis Of Algorithms - Page 1 Design And Analysis Of Algorithms - Page 2 Design And Analysis Of Algorithms - Page 3 Design And Analysis Of Algorithms - Page 4 Design And Analysis Of Algorithms - Page 5

Design And Analysis Of Algorithms by I. Chandra Mohan
Book Summary:

This book, on Design and Analysis of Algorithms, in its second edition, presents a detailed coverage of the time complexity of algorithms. In this edition, a number of chapters have been modified and updated with new material. It 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.

The book begins with an introduction to algorithm analysis and then presents different methods and techniques—divide and conquer methods, the greedy method, search and traversal techniques, backtracking methods, branch and bound methods—used in the design of algorithms. Each algorithm that is written in this book is followed first by a detailed explanation and then is supported by worked-out examples. The book contains a number of figures to illustrate the theoretical aspects and also provides chapter-end questions to enable students to gauge their understanding of the underlying concepts. What distinguishes the text is its compactness, which has been achieved without sacrificing essential subject matter.

This text is suitable for a course on “Design and Analysis of Algorithms”, which is offered to the students of B.Tech (Computer Science and Engineering) and undergraduate and postgraduate students of computer science and computer applications [BCA, MCA, B.Sc. (CS), M.Sc. (CS)] and other computer-related courses.

Audience of the Book :
This book Useful for Computer Science & MCA Student.
Table of Contents:

1. Fundamentals

2. Divide-And-Conquer Methods

3. The Greedy Method

4. Set Manipulation Algorithms

5. Dynamic Programming

6. Search And Traversal Techniques

7. Backtracking Methods

8. Branch And Bound Methods

9. Algebraic Simplification And Transformation

10. Lower Boundary Theory And Np-Hard And

Np-Complete Problems



Sold Just Now! 🔥

Ramesh Purchased Legal Aspects Of Business, just now!