Elements of Algorithm Design and Analysis

Topics : Introduction, Complexity, Data structures, Divide-and-conquer strategy, Greedy method, Traversal and searching techniques, Dynamic programming technique, Backtracking method, Branch-and-bound method, Algebraic problems, NP-hard and NP-complete problems, Miscellaneous

Current Editor :
Dr. Animesh Adhikari

Book Preview

Editorial Board

Table of Contents

Salient Features :
The goal of learning computer science is to write efficient programs for the problems. The present module discusses how to design an efficient algorithm, if possible, for a given problem. Then we need to convert the algorithm into a computer program with the help of a computer language. This book discusses different techniques, such as divide-and-conquer strategy, greedy method, dynamic programming technique, branch-and-bound method, backtracking method and algebraic method, for designing an algorithm of a given problem. Current edition of the book contains 203 questions and answers. It contains 40 algorithms designed for different problems. Students will find the book helpful for their studies.





Year of Publication


No. of Pages



270 (India)
US 7 (Outside India)

Individual Online Access 1

270 (India)
US 6 (Outside India)

Institutional Online Access 2

65 (India)/ CS & IT student
US 2 (Outside India)/ CS & IT student

Printing Status


Online Status


Chronological Events

Important events are listed here


Contributors to e-magazine for the year 2022 : click here

Information Brochure