This book provides a complete information to the modern study of computer algorithms. It presents many algorithms and covers every concept in a considerable depth, so that it can be understand by all levels of readers. Each and every concept is explained by a suitable examples. This text book is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Because it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for self-study by technical professionals.

• Chapter 1: This chapter deals with basic concepts in a step-by-step manner.
• Chapter 2: In this chapter discussed about Divide and Conquer method with examples.
• Chapter 3: This chapter deals with Greedy methods and various problems related to greedy method.
• Chapter 4: This chapter deals with Dynamic Programming, different types of graphs related problems.
• Chapter 5: Various types of traversal and searching techniques are discussed in this chapter.
• Chapter 6: This chapter deals with backtracking methods, queens problem, Hamiltonian cycles, knapsack problems.
• Chapter 7: This chapter deals with Branch and Bound algorithms, Travelling salesman problems, 15-puzzle problems.
• Chapter 8: This chapter deals with NP hard and NP complete problems.