Please Login To Continue
Tower of Hanoi problem
Lesson 15 of 15 • 5 upvotes • 8:04mins
Varsha Agarwal
(Hindi) Asymptotic Notation and Complexity of a Program: NTA-UGC NET CS
15 lessons • 1h 58m
1
Asymptotic Notation Part 1 - Big O (in Hindi)
8:21mins
2
Introduction of Course (in Hindi)
6:06mins
3
Solve Numericals Based on Big O (in Hindi)
8:26mins
4
Solve Big O Numerical Part 2 (in Hindi)
8:27mins
5
Solve Big O Numerical Part 3 (in Hindi)
8:20mins
6
Big omega analysis (in hindi)
8:02mins
7
Big omega numerical part 2(in hindi)
8:01mins
8
Theta analysis part 1(in Hindi)
8:05mins
9
Theta analysis part 2(in Hindi)
8:04mins
10
Little o notation (in Hindi)
8:04mins
11
Summary of asymptotic notation
8:35mins
12
Complexity part1(in Hindi)
8:11mins
13
Complexity of a algorithm part 2(in Hindi)
8:22mins
14
Complexity of an also part 3(in Hindi)
5:23mins
15
Tower of Hanoi problem
8:04mins
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
