Stock Image

Design Analysis and Algorithms

Hari Mohan Pandey

ISBN 10: 8131803341 / ISBN 13: 9788131803349
Published by Laxmi Publications Pvt. Ltd, 2008
New Condition: New Soft cover
From BookVistas (New Delhi, DELHI, India)

AbeBooks Seller Since November 24, 2010

Quantity Available: > 20

Buy New
Price: US$ 8.50 Convert Currency
Shipping: US$ 4.90 From India to U.S.A. Destination, Rates & Speeds
Add to basket

30 Day Return Policy

About this Item

The basic aim of this book is to help the student understand the designing procedure of algorithms, how to analyze algorithms and how to implement the algorithms. This book provides comprehensive and completely up-to-date coverage of ?Design and Analysis of Algorithms? It meets student?s needs by addressing both the designing principle as well as the critical role of performance in driving the algorithm. This book covers the syllabus of all the universities which offer the B.E./B.Tech (Computer Science & Engg./ Information Technology), B.Sc. (Computer Science/ Information Technology), and M.Sc. (Computer Science/ Information Technology) and it is also useful for MCA students. This has been written in a very simple and lucid language. Salient Features of the Book Easily understandable, step by step description of each algorithm. Plenty of illustrations supporting the theoretical concepts. Large number of solved problems for real situation applications. A simple formal descriptive language used throughout the book. Step by step description of Red Black Tree (insertion and deletion). Effective description of Sorting (Quick Sort, Heap Sort, Counting Sort etc.) A simple description of Graphs Algorithms. Numerous unsolved problems for practice in each chapter. Contents: Chapter 1 :Introduction Chapter 2 :Growth of Functions Chapter 3 :Recurrences : Master`s Theorem Chapter 4 :Sorting and Sorting Methods : Heap Sort Chapter 5 :Quick Sort Chapter 6 :Divide and Conquer Methods Chapter 7 :Sorting in Linear Time Chapter 8 :Medians and Order Statistics Chapter 9 :Red-Black Trees Chapter 10; :Augmenting Data Structures Chapter 11; :B-Trees Chapter 12; :Binomial Heaps Chapter 13; :Fibonacci Heaps Chapter 14; :Data Structure for Disjoint Sets Chapter 15; :Dynamic Programming Chapter 16; :Greedy Algorithms Chapter 17; :Amortized Analysis Chapter 18; :Back-Tracking Chapter 19; :Branch and Bound Technique Chapter 20; :Introduction to Assignment Problem Chapter 21; :String Matching : Pattern Matching Algorithm Chapter 22; :Elmentary Graph Algorithms Chapter 23; :Minimum Spanning Tree Chapter 24; :Single Source Shortest Path Algorithm Chapter 25; :All Pairs Shortest Paths Algorithm Chapter 26; :Maximum Flow Chapter 27; :Randomized Algorithms Chapter 28; :NP-Completeness Chapter 29; :Approximation Algorithm Appendix Questions for Review Index Printed Pages: 560. Bookseller Inventory # 55306

Ask Seller a Question

Bibliographic Details

Title: Design Analysis and Algorithms

Publisher: Laxmi Publications Pvt. Ltd

Publication Date: 2008

Binding: Softcover

Book Condition:New

Edition: First edition.

About this title

Synopsis:

This book provides comprehensive and completely up-to-date coverage of ?Design and Analysis of Algorithms?. It meets student?s needs by addressing both the designing principle as well as the critical role of performance in driving the algorithm. This book covers the syllabus of all the universities which offer the B.E./B.Tech (Computer Science & Engg./ Information Technology), B.Sc. (Computer Science/ Information Technology), and M.Sc. (Computer Science/ Information Technology) and it is also useful for MCA students. This has been written in a very simple and lucid language.Salient Features of the BookEasily understandable, step by step description of each algorithm.Plenty of illustrations supporting the theoretical concepts.Large number of solved problems for real situation applications.A simple formal descriptive language used throughout the book.Step by step description of Red Black Tree (insertion and deletion).Effective description of Sorting (Quick Sort, Heap Sort, Counting Sort etc.)A simple description of Graphs Algorithms.Numerous unsolved problems for practice in each chapter.

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

Store Description

Visit Seller's Storefront

Terms of Sale:

All books are new. We accept payments by the following methods:

  1. Credit Card: Visa, MasterCard, or American Express.
  2. PayPal: sales@bookvistas.com
  3. Bank Draft or Banker's Cheque.
  4. Bank/Wire Transfer.

Cheques may be made payable to BookVistas.

Books are shipped by DHL, FedEx, Aramex, Registered Air Mail, or Registered SAL (Surface Air
Lifted).


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