Description

ABOUT THE BOOK

The present edition of this book is restructured the key aspects of the subject design and analysis of algorithms in 5 units which are further classified into 31 chapters. The text 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. Hope this edition will be extremely useful for Tech (CS/IT), M.Tech and MCA students, teachers, researchers and professionals. It 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.