About the Book
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.
About the Author
Kaushal Kishor Rastogi, M.Tech ( Computer Science), is working as an assistant professor in the department of Computer Science and Engineering at HiTech Institute of Engineering and Technology, Ghaziabad. He has rich teaching and research experience of 9 years. His area of specialization includes design and analysis of algorithms, theory of automata, computer network and compiler design. His many papers have been published in reputed research journals and has participated and presented papers in various national and international conferences and seminars, on the subject of computer science.