Please Login To Continue
T (n)= T (n/3) +cn solve this recurrence relation( in Hindi)
Lesson 11 of 12 • 28 upvotes • 4:32mins
Nisha Mittal
(Hindi) Utmost Important Course on Algorithm for NTA NET Computer Science Examination
12 lessons • 1h 4m
1
Overview of the Course (in Hindi)
1:56mins
2
Solve this Recurrence Relation (in Hindi)
5:38mins
3
Which Statement is False (in Hindi)
5:50mins
4
Logarithms and Functions (in Hindi)
6:35mins
5
Which one of the following statements is FALSE? (In Hindi )
6:22mins
6
The asymptotic behaviour( in Hindi)
6:49mins
7
Which of these claims are correct?( In Hindi )
4:50mins
8
Let f(n) = n2log n and g(n) = n(log)10be without positive functions of n.( In Hindi )
5:47mins
9
Solve reccurence relation T(n) = 5T(n/2) + Θ(n)( in Hindi )
5:20mins
10
Solve recurrence relation( in Hindi )
5:39mins
11
T (n)= T (n/3) +cn solve this recurrence relation( in Hindi)
4:32mins
12
T(n) = 9T(n/3) + T(n^ 2 ) Solve by master theorem( in Hindi)
4:53mins
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
