Lesson 3 of 14 • 94 upvotes • 10:44mins
In this lesson we are going to cover asymptotic notations 1. big O 2. Omega notation 3. Theta notation with diagramattical representations . Also we will do some examples related to topics .
14 lessons • 1h 54m
Overview of Course (in Hindi)
6:49mins
Asymptotic Notation of Algorithm(in Hindi)
11:00mins
Best Diagrams for Asymptotic Notation (in Hindi)
10:44mins
Easy way to understand Big O and Omega Notations (in Hindi )
11:11mins
Shortcut Tricks of Time Complexities (in Hindi)
8:16mins
Difference between notations in algorithm (in Hindi )
11:20mins
Last minute revision of Algorithm (in Hindi)
8:58mins
Properties of Asymptotic Notations (in Hindi )
10:07mins
Master theorem previous year Question( in Hindi )
7:22mins
Which of the following is ALWAYS TRUE? (In Hindi)
5:12mins
Which of the following is ALWAYS TRUE? (In Hindi)
5:12mins
Increasing order of asymptotic notation( In Hindi)
6:24mins
Complexity of algorithm related isro question (in Hindi )
6:03mins
Which of the following is false ? (In Hindi )
5:31mins