Udemy
    •  
    •  
    •  
    •  
    •  
    •  
    •  
    •  
Subscribe
Turn what you know into an opportunity and reach millions around the world.
Learn More
Your cart is empty.
Keep shopping
Data Structures&Algorithms-Asymptotic Notation, Recurrences
Rating: 4.5 out of 5(36 ratings)
225 students

Data Structures&Algorithms-Asymptotic Notation, Recurrences

Learning Asymptotic Behaviour, detailed asymptotic notations Solving Recurrences
Created byVENKATACHALAM MAHESWARI
Last updated 7/2020
English

What you'll 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
  • Able to analyse the running time of an algorithm

Course content

3 sections • 20 lectures • 3h 6m total length

  • Introduction to the course2:08
  • Course Curriculum1:51

Requirements

  • Basic understanding of Algorithms
  • Fundamental Mathematical knowledge

Description

Asymptotic Notations are mathematical tools used to analyze the performance of algorithms by understanding how their efficiency changes as the input size grows. This course is mainly aimed to focus in detail about asymptotic analysis of algorithms.

To clearly understand the algorithms, understanding the behaviour of the different algorithms is very much essential. In order to make this part easier and keeping this as the focus the course has been designed. The three different  asymptotic notations namely the best,worst and average case are discussed in detail and their significance explained with appropriate examples. Detailed worked out examples are given.


The second part focus on solving the recurrences. The first method discussed is the iteration method wherein elaborate examples to the show the different scenarios are discussed. The second method discussed is the substitution method. The other subsequent methods discussed are methods discussed in detail are recursion tree method and Master method. Master method covers all the cases in detail with suitable example to give a clear understanding.Various examples are given for all types of recurrences.

Wherever needed additional practice exercise problems are given .

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.
  • Interested in analysing the asymptotic behavior of Algorithms

Report abuse