| |
This well-organized text provides the design techniques of algorithms in a simple and straightforward manner. It describes the complete development of various algorithms along with their pseudo-codes in order to have an understanding of their applications.
The book begins with a description of the fundamental concepts and basic design techniques of algorithms. Gradually, it introduces more complex and advanced topics such as dynamic programming, backtracking and various algorithms related to graph data structure. Finally, the text elaborates on NP-hard, matrix operations and sorting network.
KEY FEATURES
• Gives a thorough analysis of the fundamental and advanced concepts of algorithms.
• Provides many solved examples to enhance students’ ability to grasp the concepts discussed.
• Supplies well-graded exercises to test students’ understanding of the subject.
Primarily designed as a text for undergraduate students of Computer Science and Engineering and Information Technology (B.Tech., Computer Science/B.Tech., IT) and postgraduate students of Computer Applications (MCA), the book would also be quite useful to postgraduate students of Computer Science and IT (M.Sc., Computer Science; M.Sc., IT).ISBN : 9788120334212
|
| |
Pages : 384
|