Data Structures&Algorithms-Asymptotic Notation, Recurrences

Data Structures&Algorithms-Asymptotic Notation, Recurrences

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.

Learning Asymptotic Behaviour, Solving Recurrences

Url: View Details

What you will learn

• Learning this course will give a clear understanding about Asymptotic Behavior of Algortihms
• The students will be to solve recurrence relations of algorithms and distinguish the significance among the methods used to solve it .
• Get an insight about the different asymptotic notations

Rating: 4.7

Level: Intermediate Level

Duration: 3 hours

Instructor: VENKATACHALAM MAHESWARI