Design and Analysis of Algorithms

Sorting, Searching and Divide and Conquer Approach

Contact the Author

Please sign in to contact this author

What you'll learn

  • Develop an efficient algorithm to reduce space and time complexity
  • Solve problems using divide and conquer approaches
  • Apply dynamic programming type’s techniques to solve polynomial time problems
  • Apply greedy programming type’s techniques to solve polynomial time problems

U. Sakthi received B.E in Computer Science and Engineering from Madras University, Chennai, India, in 2001 and M.E in Computer Science and Engineering from Anna University, Chennai, India, in 2007. She received Ph.D in Computer Science and Engineering from Anna University, India, in 2011. She has completed Post-Doctoral Fellowship from City, University of Londn, UK, in 2024. She is working as an Assistant Professor in U Sakthi, Department of Computational Intelligence, School of Computing, SRM Institute of Science and Technology, Kattankulathur, Chengalpattu, Chennai, TN, India. Her research interests include Machine Learning, Image Classification, Data Mining and Deep learning. She has published more than 45 research papers in referred journals and conferences. She is a life member of ISTE and ACM.

 

Related Products

Top