Course : Advanced Algorithms
Target Audience : 3rd Year UG Students in Computer Engineering
Domain : Computer
Instructor : Mrs. Lifna C.S
Institution : VES Institute of Technology
Affiliated to : University of Mumbai
Acknowledgements:
1. Cormen, Thomas H., and Thomas H. Cormen. Introduction to Algorithms. Cambridge, Mass: MIT Press, 2001.
2.Prof. Deepak B Phatak, course co-ordinator for Four week AICTE approved FDP by IIT Bombay on "Use of ICT in Education for Online and Blended Learning"
Learning Objective:
At the end of watching the videos student should be able to,
1. Compute the Time Complexity of Recursive Algorithms using Back Substitution & Recursive Tree (Apply Level)
Key Concepts covered :
To Compute the Time Complexity of Recursive Algorithms using
1. Back Substitution
2. Recursive Tree
