Design Analysis and Algorithms

 
9788131803349: Design Analysis and Algorithms
View all copies of this ISBN edition:
 
 

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.

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

Top Search Results from the AbeBooks Marketplace

1.

Hari Mohan Pandey
Published by USP/Laxmi Publications (P) Ltd., New Delhi (2008)
ISBN 10: 8131803341 ISBN 13: 9788131803349
New First Edition Quantity Available: 1
Seller:
Books in my Basket
(New Delhi, India)
Rating
[?]

Book Description USP/Laxmi Publications (P) Ltd., New Delhi, 2008. N.A. Condition: New. First. 560pp. Seller Inventory # 285976

More information about this seller | Contact this seller

Buy New
US$ 6.80
Convert currency

Add to Basket

Shipping: US$ 6.14
From India to U.S.A.
Destination, rates & speeds

2.

Hari Mohan Pandey
Published by Laxmi Publications Pvt. Ltd (2008)
ISBN 10: 8131803341 ISBN 13: 9788131803349
New Softcover First Edition Quantity Available: > 20
Seller:
BookVistas
(New Delhi, India)
Rating
[?]

Book Description Laxmi Publications Pvt. Ltd, 2008. Softcover. Condition: New. First edition. 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. Seller Inventory # 55306

More information about this seller | Contact this seller

Buy New
US$ 8.50
Convert currency

Add to Basket

Shipping: US$ 9.55
From India to U.S.A.
Destination, rates & speeds

3.

Hari Mohan Pandey
ISBN 10: 8131803341 ISBN 13: 9788131803349
New Quantity Available: 2
Seller:
University Bookstore
(DELHI, DELHI, India)
Rating
[?]

Book Description Condition: New. This is Brand NEW. Seller Inventory # Laxmi-05102018-2158

More information about this seller | Contact this seller

Buy New
US$ 15.43
Convert currency

Add to Basket

Shipping: US$ 10.42
From India to U.S.A.
Destination, rates & speeds

4.

Hari Mohan Pandey
Published by Laxmi Publicationss Pvt. Ltd.
ISBN 10: 8131803341 ISBN 13: 9788131803349
New Quantity Available: 20
Seller:
BookVistas
(New Delhi, India)
Rating
[?]

Book Description Laxmi Publicationss Pvt. Ltd. Condition: New. Seller Inventory # LAXMI-9788131803349

More information about this seller | Contact this seller

Buy New
US$ 46.00
Convert currency

Add to Basket

Shipping: US$ 9.55
From India to U.S.A.
Destination, rates & speeds