Analysis of Algorithms

2 Jun , 2018  

  • Basic knowledge of Mathematics is required.

This course is well-structured into a curriculum of 20+ video lectures, a wide variety of practice examples, quizzespractice worksheets to test your understanding.

The curriculum focuses on the following topics:

  1. Basics of Algorithms: All you need to know about algorithms before learning to analyse them.
  2. Time and Space Complexity: These are the major factors on which the efficiency of your algorithm depends.
  3. Types of Analysis: Different situations while analysing an algorithm which are Worst Case, Average Case & the Best Case.
  4. Asymptotic Notations: The industry standard adopted worldwide for notifying algorithms majorly Big-O Notation, Omega Notation & the Theta Notation.
  5. Important Algorithmic paradigms such as Recursion, Divide & Conquer which you will come across heavily while solving a coding problem whether in your academic curriculum or in your Interview.
  6. Recurrence Relations and all types of recurrence relations you will come across in all recursive problems.
  7. Solving Recurrence Relations: using Substitution, Recursive Tree & Master theorem method.

Taking this course will also help you in your upcoming coding interview.

Who is the target audience?
  • If you are studying/undertaking Computer Science in Undergrad school.
  • If you are preparing for a Coding Interview.
  • If you are planning to learn Data Structures and Algorithms.
  • If you desire to contribute to the open source community.

Best Related Posts

, , ,