Design And Analysis Of Algorithm

The book Design and Analysis of Algorithms has been written in a well organized and systematic manner. This book introduces-How to analyze algorithm?, designing technique of algorithm and helps the student to write useful, complex algorithm. This book covers the syllabus of all the universities which offer the B.Tech/M.Tech (Computer Science and Engineering/Information Technology), B.Sc/M.Sc (Information Technology) and is also useful for MCA student.

Salient Features of the Book

• This book has been written in a simple and easy language.
• Each chapter contains introduction, glossary of terminology and summary.
• It contains to-the point material for the benefit of the students.
• Adequate number of solved problems for real application are given.
• Unsolved problems have been given at the end of each chapter for practice.

Table Of Contents :
Chapter    1.  Role of Algorithm
Chapter    2.  Growth of Function
Chapter    3.  Recurrences
Chapter    4.  Heap Sort
Chapter    5.  Quick Sort
Chapter    6.  Sorting in Linear Time
Chapter    7.  Medians and Order Statistics
Chapter    8.  Elementary Data Structures
Chapter    9.  Hash Table
Chapter  10.  Binary Search Tree (BST)
Chapter  11.  Red-Black Trees
Chapter  12.  Augmenting Data Structures
Chapter  13.  Splay Trees
Chapter  14.  B-Trees
Chapter  15.  Binomial Heaps
Chapter  16.  Fibonacci Heaps
Chapter  17.  Data Structures for Disjoint Sets
Chapter  18.  Dynamic Programming
Chapter  19.  Greedy Algorithms
Chapter  20.  Amortized Analysis
Chapter  21.  Branch and Bound
Chapter  22.  Backtracking
Chapter  23.  Elementary Graph Algorithms
Chapter  24.  Minimum Spanning Tree
Chapter  25.  Single-Source Shortest Paths
Chapter  26.  All Pairs Shortest Paths
Chapter  27.  Maximum Flow
Chapter  28.  Sorting Networks
Chapter  29.  Matrix Operations
Chapter  30.  Polynomials and the FFT
Chapter  31.  Number-Theoretic Algorithms
Chapter  32.  String Matching
Chapter  33.  Computational Geometry
Chapter  34.  NP-Completeness
Chapter  35.  Approximation Algorithm
                      Model Question Paper
                      Question Bank
                      Previous Year Question Paper
                      Index
About Author :
Sachin Dev Goyal has done his Masters degree in Computer Application (MCA) from Krishna Institute of Technology, Ghaziabad, affiliated to U.P. Technical University, Lucknow (U.P.). His areas of interest include Programming Languages such as C, C++, JAVA, Algorithm and Theory of Automata.
At present he is working as a Senior Lecturer in the MCA department at Ideal Institute of Technology, Ghaziabad.UAD-9414