
Algorithm Analysis & Design
Book Details
-
Publisher: S.K. Kataria & Sons
-
Author: Deepak Gupta
-
Language: English
-
Edition: Reprint 2013
-
ISBN: 9789350141182
-
Pages: 350
-
Cover: Paperback
-
Dimensions: 9.4 x 7.2 x 0.9 inches
About the Book
This English paperback book by Deepak Gupta is a useful academic resource for students studying data structures, algorithms, and computer science subjects. The book covers important topics such as introduction to algorithms, growth of functions, recurrences, divide and conquer, medians and order statistics, data structures for disjoint sets, dynamic programming, greedy algorithms, graphs, string matching, and NP-complete problems. It also includes an appendix, model test papers, examination papers, and an index, making it helpful for classroom learning, self-study, revision, and exam preparation. With its structured topic coverage and student-friendly approach, this book is suitable for engineering, computer science, and information technology students looking for a reliable reference on algorithms and problem-solving concepts.
Original: $4.51
-65%$4.51
$1.58Product Information
Product Information
Shipping & Returns
Shipping & Returns
Description
Book Details
-
Publisher: S.K. Kataria & Sons
-
Author: Deepak Gupta
-
Language: English
-
Edition: Reprint 2013
-
ISBN: 9789350141182
-
Pages: 350
-
Cover: Paperback
-
Dimensions: 9.4 x 7.2 x 0.9 inches
About the Book
This English paperback book by Deepak Gupta is a useful academic resource for students studying data structures, algorithms, and computer science subjects. The book covers important topics such as introduction to algorithms, growth of functions, recurrences, divide and conquer, medians and order statistics, data structures for disjoint sets, dynamic programming, greedy algorithms, graphs, string matching, and NP-complete problems. It also includes an appendix, model test papers, examination papers, and an index, making it helpful for classroom learning, self-study, revision, and exam preparation. With its structured topic coverage and student-friendly approach, this book is suitable for engineering, computer science, and information technology students looking for a reliable reference on algorithms and problem-solving concepts.


















