Asymptotic Notations #1 - Big Oh

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. Significance of Asymptotic Notations. (Recall Level)
2. Definition of Big Oh Notation. (Recall Level)
3. Derive the Upper Bound of a given Time Function.(Apply Level)

Key Concepts covered :
1. Asymptotic Notations
2. Definition of Big Oh
3. Derive the upper Bound for a given Time Function