Design Analysis and Algorithms - Softcover

Hari Mohan Pandey,Hari Mohan Pandey

9788131803349: Design Analysis and Algorithms

Softcover

ISBN 10: 8131803341 ISBN 13: 9788131803349

Publisher: Laxmi Publications, 2008

View all copies of this ISBN edition

0 Used

3 New

From US$ 20.22

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 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. Table Of Contents : Chapter 1:IntroductionChapter 2:Growth of FunctionsChapter 3:Recurrences : Master's TheoremChapter 4:Sorting and Sorting Methods : Heap SortChapter 5:Quick SortChapter 6:Divide and Conquer MethodsChapter 7:Sorting in Linear TimeChapter 8:Medians and Order StatisticsChapter 9:Red-Black TreesChapter 10;:Augmenting Data StructuresChapter 11;:B-TreesChapter 12;:Binomial HeapsChapter 13;:Fibonacci HeapsChapter 14;:Data Structure for Disjoint SetsChapter 15;:Dynamic ProgrammingChapter 16;:Greedy AlgorithmsChapter 17;:Amortized AnalysisChapter 18;:Back-TrackingChapter 19;:Branch and Bound TechniqueChapter 20;:Introduction to Assignment ProblemChapter 21;:String Matching : Patte

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