Data Structures&Algorithms-Asymptotic Notation, Recurrences
What you'll learn
- At the end of my course , the students will have a clear understanding of what is asymptotic behaviour of algorithms and how asymptotic notations are used to analyse the algorithms. to analyse the performance of an algorithm design based on the appropriate data structures.
- The students will be to solve recurrence relations of algorithms and distinguish the significance among the methods used to solve it .
Course content
- Preview02:08
- Preview01:51
Requirements
- Basic understanding of Algorithms
- Fundamental Mathematical knowledge
Description
This course is mainly aimed to focus in detail about asymptotic analysis of algorithms.The different asymptotic notations are discussed in detail and their significance explained with appropriate examples.
The second part focus on solving the recurrences. The methods discussed in detail are iteration method, substitution method, recursion tree method and Master method.
In both parts practice exercise are covered and also solution to the practice exercise also explained.
Who this course is for:
- Any Computer Science student who wants to get a deep insight into Asymptotic Notations and Recurrences.
Instructor
![VENKATACHALAM MAHESWARI](data:image/svg+xml,%3Csvg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 64 64"%3E%3C/svg%3E){kind=avatar}
- 4.5 Instructor Rating
- 153 Reviews
- 1,004 Students
- 3 Courses
Dr.Maheswari has been in the field of teaching Technical Education for over 25 years. Has served in various Universities and also heading the department.
She holds doctoral degree in Computer Science and Engineering with specialization in Network Security. She is also Guest Faculty for Working Professionals.
Has a passion for teaching and a deep interest is sharing the subject with the students.
She has handled the subject Data structure and Algorithm for different category of students. On analysing the difficulty faced by the learners , she has created this course to be understood in a simplest manner.