DAA12: Recursion Tree Method for Solving Recurrences| Rules and Examples in Hindi

Download Notes from the Website:
www.university...
Or universityacad...
Download DAA Hand Written Notes: imojo.in/335py6y
Join our official Telegram Channel by the Following Link:
t.me/universit...
Join WhatsApp Group by Link: chat.whatsapp....
Topics: Design and Analysis of Algorithm, Advanced Data Structures, Divide and Conquer, Greedy Methods, Dynamic Programming, Backtracking, Branch and Bound, Selected Topics.
Faculty: Sandeep Vishwakarma
University Academy is India’s first and largest platform for professional students of various streams that were started in 2017. University Academy comprises of a committed band of highly experienced faculties from various top universities or colleges of India.
……………………………………………………………………………………………………………………………………………………………
#DAA #SandeepSir #OnlineCourses #AcademicSubject
……………………………………………………………………………………………………………………………………………………………
Complete Playlist :
1. • Programming For Proble...
2. • C Programming For Begi...
3. • Basic Electrical Engin...
4. • Fundamentals of Electr...
5. • PPS Lab(KCS151P / KCS2...
6. • Engineering Physics
7. • Fundamentals of Mechan...
8. • Artificial Intelligenc...
9. • Emerging Domain in Ele...
10. • Data Structure Lecture...
11. • Theory of Automata and...
12. • Operating System Tutor...
12. • Python Programming A P...
14. • Software Engineering
15. • Computer Organization ...
16. • Discrete Structures an...
17. • Design and Analysis of...
18 • Compiler Design Tutori...
19. • Principle of Programmi...
20. • Web Technology In Hindi
21. • Data Warehousing and D...
22. • Database Management Sy...
23. • Cyber Security Tutoria...
24. • Computer Network Tutor...
25. • Distributed System Tut...
26. • Cloud Computing Tutorial
27. • Manufacturing Processes
28. • Network Analysis & Syn...
29. • Class 10 Maths(NCERT |...
30. • Control System Lectures
31. • Microprocessor Lecture...
32. • Digital System Design ...
33. • Signals & Systems Lect...
34. • Transportation Enginee...
36. • Android Studio 3.0 (Mo...
36. • C Programming : Practi...
37. • JavaScript in Hindi
38. • Java Programming in Hindi
39. • JFLAP/TAFL Lab(Theory ...
40. • Tech News
41. Other: • Other
-------------------------------------------------------------------------------------------------------------
Regards
University Academy
WhatsApp: [phone]
Email: [e-mail]
Website:
www.university...
www.university...

[@akshaybarve8042]

Sir aapko or detail me batana chahiye jo samjh aaye

[@ManojGupta-mk3uk]

Sir one prblm to recurrences tree
Question- T(n) =T(n/2) +T(n/4) +T(n/8) +n

[@raghavendrakumarsingh4646]

Very Nice Explanation

[@NISHANTKUMAR-rr5ut]

Sir how u take the value of k in the 2nd part....plz tell us....we didn't understand that portion... logn = klog2 how tha value k = logn?

[@sanandapodder5027]

when T(1) means n/2^k = 1 so n = 2^k take logarithm base 2 on both sides you will get k = logn i.e [log base 2 (n)] hope i make it clear

[@aniruddhasaha1091]

Sir how u take the value of k in the 2nd part....plz tell us....we didn't understand that portion...

[@amalmathew7011]

me too

[@sanandapodder5027]

when T(1) means n/2^k = 1 so n = 2^k take logarithm base 2 on both sides you will get k = logn i.e [log base 2 (n)] hope i make it clear

[@sanandapodder5027]

@@amalmathew7011 when T(1) means n/2^k = 1 so n = 2^k take logarithm base 2 on both sides you will get k = logn i.e [log base 2 (n)] hope i make it clear

[@ManojGupta-mk3uk]

Please 🙏🙏🙏🙏help me sir

[@ishaanjoshi8527]

Sir how to create this pattern like in this ques it is n(n+1)/2

[@nitinsingh3694]

Same doubt

[@sam-ht4uu]

Me too🤚

[@surajmaity6194]

Thank you very much sir

[@karantripathi5203]

Group limit full.

[@dhruvpatel5072]

Thanks

[@nikitasinha8181]

Thank u so much

[@growwithaman9085]

sir apka whatsap group full ho gya hai

[@chitranjankumar9100]

1 kaise aa jayega sir

[@Mnssh564]

Very helpful video 👍👍

[@sanandapodder5027]

Thank you very much sir for your beautiful explanation. Sir how to prepare for gate exam? what questions comes from Algorithm part?

[@nitinsingh3694]

Bro I got it.....take s=1+2+3.........(n-1)+n
Write it backwards
S=n+(n-1)+(n-2)...........+2+1
Add both equation
2S=(n+1)+(n+1)+(n+1)......+(n+1)
2S=n(n+1)
S=n(n+1)/2

[@kidstoon780]

Sir this videos explanation in not clear