Name: Analysis and Design of Algorithms- A Beginner's Hope
Price: 19.95 USD
ISBN: 9789386551894

BPB Online LLP

Shefali Singhal, Neha Garg

Analysis and Design of Algorithms- A Beginner's Hope

US$ 19.95

Buy eBook Now Gift eBook

The publisher has enabled DRM protection, which means that you need to use the BookFusion iOS, Android or Web app to read this eBook. This eBook cannot be used outside of the BookFusion platform.

Description

Contents

Reviews

A process or set of rules to be followed in calculations or other problem-solving operations, especially by a computer

Key Features
This book is especially designed for beginners and explains all aspects of algorithm and its analysis in a simple and systematic manner.
Algorithms and their working are explained in detail with the help of several illustrative examples.
Important features like greedy algorithm, dynamic algorithm, string matching algorithm, branch and bound algorithm, NP hard and NP complete problems are suitably highlighted.
Solved and frequently asked questions in the various competitive examinations, sample papers of the past examinations are provided which will serve as a useful reference source.

Description
The book has been written in such a way that the concepts and working of algorithms are explained in detail, with adequate examples. To make clarity on the topic, diagrams, calculation of complexity, algorithms are given extensively throughout. Many examples are provided which are helpful in understanding the algorithms by various strategies. This content is user-focused and has been highly updated including algorithms and their real-world examples.

What You Will Learn
Algorithm & Algorithmic Strategy, Complexity of Algorithms
Divide-and-Conquer, Greedy, Backtracking, String-Matching Algorithm
Dynamic Programming, P and NP Problems
Graph Theory, Complexity of Algorithms

Who This Book is For
The book would serve as an extremely useful text for BCA, MCA, M. Sc. (Computer Science), PGDCA, BE (Information Technology) and B. Tech. and M. Tech. students.

Table of Contents
1. Algorithm & Algorithmic Strategy
2. Complexity of Algorithms
3. Divide-and-Conquer Algorithms
4. Greedy Algorithm
5. Dynamic Programming
6. Graph Theory
7. Backtracking Algorithms
8. Complexity of Algorithms
9. String-Matching Algorithms
10. P and NP Problems

About the Author
Shefali Singhal is working as an Assistant professor in Computer science and Engineering department, Manav Rachna International University. She has completed her MTech. form YMCA University in Computer Engineering. Her research interest includes Programming Languages, Computer Network, Data mining, and Theory of computation.

Neha Garg is working as an Assistant professor in in Computer science and Engineering department, Manav Rachna International University. She has completed her MTech. Form Banasthali University, Rajasthan in Information Technology. Her research interest includes Programming Languages, Data Structure, Operating System, Database Management Systems.

Language

English

ISBN

9789386551894

complexity of algorithm

divide and conquer algorithms

backtracking algorithms

string-matching algorithms

p and np problems

matrix chain multiplication

huffman code

n queen problem

knapsack problem

Cover Page

Title Page

Preface

Dedication

Acknowledgement

Table of Contents

Chapter 1: Algorithm & Algorithmic Strategy

1.1 Algorithm

1.2 History

1.3 Scope of Algorithms in different fields

1.4 Classification Of Algorithms

1.5 Pseudo Code

1.6 How to design an algorithm?

Review exercise

Solution of review exercise

Chapter 2: Complexity of Algorithms

2.1 Analysis of algorithm

2.2 Complexity

2.3 The Asymptotic Notations

2.4 Relational Properties to be applied on Asymptotic Notations

2.5 Standard notations and common functions

2.6 Basic Efficiency Classes

2.7 Logarithmic Rules

2.8 Recurrence Relation

2.9 Sorting Techniques

Review exercise

Multiple choice questions & answers

Solution of review exercise

Chapter 3: Divide-and-Conquer Algorithms

3.1 Introduction

3.2 General Divide & Conquer Recurrence

3.3 Median and Order Statistics

3.4 Binary Search

3.5 Finding Maximum and Minimum

3.6 Merge Sort

3.7 Quick Sort

3.8 Select Kth Smallest Element

3.9 Strassen's Matrix Multiplication

3.10 Convex Hull

3.11 Summary

Review exercise

Multiple choice questions & answers

Chapter 4: Greedy Algorithm

4.1 Optimization Problem

4.2 Greedy Algorithm

4.3 Coin change problem

4.4 Activity selection problem

4.5 Knapsack Problem

4.6 Job sequencing problem with deadlines (task scheduling algorithm)

Review Exercise

Multiple choice questions & answers

Chapter 5: Dynamic Programming

5.1 Dynamic Programming

5.2 Matrix Chain Multiplication

5.3 Longest Common Subsequence

5.4 Optimal Binary Search Tree

5.5 0/1 Knapsack Problem

5.6 Travelling Salesman Problem

Review exercise

Multiple choice questions & answers

Chapter 6: Graph Theory

6.1 Binary Tree

6.2 Binary Search Tree

6.3 Huffman Code

6.4 Graph

6.5 Minimum Spanning Tree

6.6. Single Source Shortest Path

6.7 Shortest Paths and Matrix Multiplication (All Pair Shortest Path Problem)

6.8 The Floyd-Warshall Algorithm

Review exercise

Multiple choice questions & answers

Chapter 7: Backtracking Algorithms

7.1 Backtracking Algorithm

7.2 N Queen Problem

7.3 Sum of subsets

7.4 Graph Coloring

7.5 Hamiltonian Cycle

Review Exercise

Multiple choice questions & answers

Chapter 8: Branch and Bound

8.1 Branch and Bound

8.2 The Knapsack Problem

8.3 Travelling Salesman Problem

Review Exercise

Multiple choice questions & answers

Chapter 9: String-Matching Algorithms

9.1 String Matching

9.2 Notations and Terminology

9.3 Lemma: (Overlapping and Suffix Lemma)

9.4 Classification Of String Matching Algorithm

Review exercise

Chapter 10: P And NP Problems

10.1 Introduction

10.2 Polynomial (P) Problems

10.3 Nondeterministic Polynomial(NP) Problems

10.4 Optimization Problems and Decision Problems

10.5 Reduction

10.6 NP Hard Problems

10.7 Cook's Theorem

10.8 Bounded Halting

Review exercise

Appendix

The book hasn't received reviews yet.