Please Login To Continue
Define Recurence Relation for NTA UGC NET CS (in Hindi)
Lesson 2 of 15 • 31 upvotes • 8:39mins
Varsha Agarwal
Discuss recurence relation in brief
(Hindi) Recurrence Relation for NTA UGC NET
15 lessons • 2h
1
Introduction of Course Recurrence Relation (in Hindi)
5:34mins
2
Define Recurence Relation for NTA UGC NET CS (in Hindi)
8:39mins
3
Define Backward Substitution Method Part 1 (in Hindi)
8:39mins
4
Tricks to Solve Backward Substitution (in Hindi)
8:12mins
5
Trick to Solve Backward Substitution Part 2 (in Hindi)
8:23mins
6
Recurrence tree method part 1(in Hindi)
9:02mins
7
Recurrence tree method part 2(in Hindi)
8:13mins
8
Recursion tree part 3 (in hindi)
8:10mins
9
Master theorem part 1(in hindi)
8:14mins
10
Master theorem numericals part 2(in hindi)
8:19mins
11
Master theorem part3(in hindi)
8:29mins
12
Master theorem with transformation part 4(in hindi)
8:07mins
13
Master theorem part 5(in hindi)
8:03mins
15
Master theorem part 6(in hindi)
6:20mins
16
Important Master theorem part 7(in hindi)
8:02mins
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
