Stock Image

Design and Analysis of Algorithms

V.V. Muniswamy

0 ratings by Goodreads
ISBN 10: 9380026730 / ISBN 13: 9789380026732
Published by I.K. International Publishing House Pvt. Ltd., 2009
New Condition: New Soft cover
From A - Z Books (New Delhi, DELHI, India)

AbeBooks Seller Since June 26, 2015

Quantity Available: > 20

Buy New
List Price: US$ 26.00
Price: US$ 5.77 Convert Currency
Shipping: US$ 5.86 From India to U.S.A. Destination, Rates & Speeds
Add to basket

30 Day Return Policy

About this Item

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. 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. Key Features: Focuses on simple explanations of techniques that can be applied to real-world problems, Presents algorithms with self-explanatory pseudocode, Covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers, 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. Bookseller Inventory # IK-9789380026732

Ask Seller a Question

Bibliographic Details

Title: Design and Analysis of Algorithms

Publisher: I.K. International Publishing House Pvt. Ltd.

Publication Date: 2009

Binding: Paperback

Book Condition:New

About this title

Synopsis:

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. 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.

Key Features:
Focuses on simple explanations of techniques that can be applied to real-world problems.
Presents algorithms with self-explanatory pseudocode.
Covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers.
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.

Contents:
Preface
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
Appendices
References
Index

"About this title" may belong to another edition of this title.

Store Description

Visit Seller's Storefront

Terms of Sale:

All books are new. Books are shipped by DHL or Air Mail.


Shipping Terms:

Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

List this Seller's Books

Payment Methods
accepted by seller

Visa Mastercard American Express

PayPal Bank Draft Bank/Wire Transfer