Please Login To Continue
Asymptotic Notation of Algorithm(in Hindi)
Lesson 2 of 14 • 164 upvotes • 11:00mins
Nisha Mittal
In this lesson we are going to discuss Asymptotic notation in algorithm. To find best case , average case , worst case. we represent upper bound and lower bounds with the help of asymptotic notations.
(Hindi) Analysis of Algorithm - NTA UGC NET Computer Science
14 lessons • 1h 54m
1
Overview of Course (in Hindi)
6:49mins
2
Asymptotic Notation of Algorithm(in Hindi)
11:00mins
3
Best Diagrams for Asymptotic Notation (in Hindi)
10:44mins
4
Easy way to understand Big O and Omega Notations (in Hindi )
11:11mins
5
Shortcut Tricks of Time Complexities (in Hindi)
8:16mins
6
Difference between notations in algorithm (in Hindi )
11:20mins
7
Last minute revision of Algorithm (in Hindi)
8:58mins
8
Properties of Asymptotic Notations (in Hindi )
10:07mins
9
Master theorem previous year Question( in Hindi )
7:22mins
10
Which of the following is ALWAYS TRUE? (In Hindi)
5:12mins
11
Which of the following is ALWAYS TRUE? (In Hindi)
5:12mins
11
Increasing order of asymptotic notation( In Hindi)
6:24mins
12
Complexity of algorithm related isro question (in Hindi )
6:03mins
13
Which of the following is false ? (In Hindi )
5:31mins
Crack NTA-UGC-NET & SET Exams with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
