| |
This book is structured to cover the key aspects of the subject design and analysis of algorithms in 31 chapters. The book gives in-depth understanding of important topics like--algorithms, asymptotic notations, growth of function, recurrences, sorting in polynomial time, sorting in linear time, advanced data structure, advanced design and analysis techniques, graph algorithms, string matching, randomized algorithms, np-completeness and reduction, approximation algorithms, FFT and sorting network. The book would serve as an extremely useful text for B.Tech (CS/IT), M.Tech and MCA students, teachers, researchers and professionals and covers revised syllabus of all technical Indian universities.ISBN-9789381695203
|
| |
|