Laxmi Design Analysis and Algorithm

Product Code : 9788131803349

Availability: In stock

Rs. 340

Quick Overview

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.


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
Questions for Review

Read more See more product details


Brand / Publisher Laxmi
Return Policy 30 Days
Edition First
ISBN 9788131803349
Author Hari Mohan Pandey
Language English
Subject Computer Science
Pages 560
Binding Paperback


Brand Information

Laxmi Publications is a privately held publishing company and is one of the leading publishers of Engineering, Computers, College, School (CBSE Board) and Children books in India and abroad. It has following subsidiaries and imprints through which it caters to different niches of educational and professional books market.

  1. Be the first to review this product

Write Your Own Review

Only registered users can write reviews. Please, log in or register