What a Great Explanation Sir. You have a Gift of God i.e you can Simplify any Tricky Concept and Explain it in such a way that , it seems to us as a cakewalk . Want Many More Marathon Session. I am a Go classes Student
Thank you, Sir, for the session. It was incredibly helpful. I used to be afraid of recurrence relations in algorithms, but now I feel much more confident in the topic.😊😊
Thank you so much sir. I never understood the logic behind the master's theorem , just tried to remember ,but now I can understand .This session helped me a lot .
Sir please upload practice questions if possible from other topics like tree, hashing And from divide & conquer, graph algo, dynamic programming, greedy algorithms Thankyou so much sir for all your efforts ❤
Sir it would be great help if you could upload this lecture notes last lecture notes were great help ... And this class is truly amazing this 3 hrs has more quality than those 12hr classes ❤❤❤❤
Session Annotated Notes - shorturl.at/fHKMR
0:02:52 Intro to Rec Rel-N
0:11:10 Substitution Method
0:58:45 Tree Method
1:40:09 derivation to Masters theorem
1:54:40 Masters theorem
2:16:25 Generalized Masters theorem
2:19:56 Extended Masters theorem
2:45:34 Failure of Masters theorem
2:47:13 Cute Method
3:25:43 to 3:36:13 Break
3:58:15 Take Care Bye Bye :)
3:13:48 almost same question in gate cse 2024.💯 great session
I was searching for this comment only
3:06:53
Q42 : T(n) = Θ((logn)^3)
Q43 : T(n) = Θ((logn)^2 loglogn)
Q44 : T(n) = Θ((logn)^log312)
This revision series is far more better than any coaching classes paid courses
Your feedback & comments motivate us to bring as much content as possible on UA-cam.
@@GOClassesforGATECS❤
Just One Word 'WOW'. Quality of lectures are toooooooooooooo Good. I'm just regretting why didn't i join GO Classes earlier. 😭😭😭😭
Most of my doubts are gone now thank you so much for such a wonderful class
BEST Session to revise recurrence relation!!🎉
42:42 same question in gate 2024 .
Amazing session ❤
What a Great Explanation Sir. You have a Gift of God i.e you can Simplify any Tricky Concept and Explain it in such a way that , it seems to us as a cakewalk . Want Many More Marathon Session. I am a Go classes Student
@2:31:39 n^2 log n .
59:40 ❤top class content from go classes thankyou 🩷🩷♥️
1:06:11 ❤
1:14:21 🩷🩷🩷
1:21:28 ❤❤❤
1:31:57 ❤
Thank you, Sir, for the session. It was incredibly helpful. I used to be afraid of recurrence relations in algorithms, but now I feel much more confident in the topic.😊😊
What a solid lecture seriously all mine concepts are crystal clear for the first time thank you go classes , sachin sir.
The. Way you teach the master theorem was just amazing and similar kind of question with gate pattern plz start offline courses guyz❤❤
58:42 tree Method start❤ 1:21:36 important 1:28:03 important
you are the best sir ❤
i really regret for not taking paid course but i will recommend GO CLASSES for all my juniors 🙌🏻
Thank you so much.
@3:07:26 Q43 : T(n) = O ((log n)^2 log log n)
Q44 : T(n) = O( (log n)^log 12)
Thank you so much sir. I never understood the logic behind the master's theorem , just tried to remember ,but now I can understand .This session helped me a lot .
Yes 🖐️ i agree same with me as well 😅
Masters theorem is lit🎉
Question no.50 3:16:16 was same to same appeared in GATE CS 2024 Set1🙌
Great session sir, explained Master theorem in very detailed and intuitive way
Cleared all my doubts 😊😊
And masters theorem 🤩🤩
It was a great session sir as usual i dont think it need to be even mentioned, u r the best in the in these industry
love the session
Awesome lecture so helpful to recall all concepts at once
Best revision ever...
Love this session.. really that brushes my concepts.
Great session to revise recurrence relations❤
Outstanding please provide these type of revision videos of all subjects and all topics
Minor correction In Question 32 at 2:31:30 answer will be Θ(n^2logn),as f(n) & n^logb a will became equal.
Q42
T(n)=2T(√n) + (logn)^3
2^m=n
T(2^m)=2T(2^m/2) + m^3
T(2^m)=S(m)
S(m)=2S(m/2) + m^3
S(m)=Θ(m^3)
T(2^m)=Θ(m^3)
T(n)=Θ((logn)^3)
Q43
T(n)=4T(√n) + (logn)^2
2^m=n
T(2^m)=4T(2^m/2) + (m)^2
T(2^m)=S(m)
S(m)=4S(m/2) + m^2
S(m)=Θ(m^2.logm)
T(2^m)=Θ(logn^2.loglogn)
Q44
T(n)=12T(n^(1/3)) + (logn)^2
2^m=n
T(2^m)=12T(2^(m/3)) + (m)^2
T(2^m)=S(m)
S(m)=12S(m/3) + (m)^2
S(m)=Θ(m^log3 12)
T(n)=Θ((logn)^log3 12)
great session as always
Amazing session. Really helpful!! Thank you sir. ❤
best revision session ever, Saching sir's teaching style is unmatched; eagerly waiting for Deepak sir's revision sessions too ❤
amazingly lectured.
It was really a great session.
Best session ❤❤❤ LOVED IT
give intuition as always, behind each concept as usually do.. 💯💯
thank you for this awesome session!
loved it sir
Brilliant session. Top notch content from Go Classes 😀
Thank you so much Guruji 🙏❤
great session sir
please make revision video on binary avl heap
For Heap and Hashing: ua-cam.com/video/Bc138b8Z_OM/v-deo.html
For AVL Tree: ua-cam.com/video/9QSN62vo-l0/v-deo.html
good effort by sachin sir❤
very useful session
Srly amazing lecture
Thanks for this session sir❤...
Sir one request please do marathon on d&c and greedy method 🙏
Loved it!
thankyou soooo sooo much for these sessions! brain me saare capacitors refresh ho gaye XD!!
please continue taking these classes regularly!!
this is really helpfull
thank you sir
please make this type of video on trees and heap
in data structure
For Heap and Hashing: ua-cam.com/video/Bc138b8Z_OM/v-deo.html
@3:07:19 T(n) = O((logn)^3)
@2:31:32 I think it should be n2logn as n^log4 (16) is n^2 not n^4
Ryt
Sir please upload practice questions if possible from other topics like tree, hashing
And from divide & conquer, graph algo, dynamic programming, greedy algorithms
Thankyou so much sir for all your efforts ❤
necessary and sufficent for recurrence realtion
Life saver❤
Q42 : Theta((logn)^3))
Q43 : Theta((logn)^2)log.logn)
Q44 : Theta((logn base3)^2.26)
Please verify sir...are these right or wrong
I think its base 2 in Q44
Sir it would be great help if you could upload this lecture notes last lecture notes were great help ... And this class is truly amazing this 3 hrs has more quality than those 12hr classes ❤❤❤❤
Session Annotated Notes - shorturl.at/fHKMR
We already have in pinned comment too.
Thanks for your appreciation
3:07:16 ---> Theta((log n)^3)
superb class
❤ want more sessions sir
Love it
At 03:09:16 Q's f how can the theta(m)
It should be theta(mlogm)
2:46:38 change variable
Sir make all subjects PYQ'S sir solving session on UA-cam...
The quality of lectures are tooo good
So beautiful, so elegant, just looking like a WOW 🔥
Wow, thank you for your constant feedback & encouragement Akash.
sir discrete mathematics ka bhi revision sesion kara d jiya🙏🙏🙏
Sir Please make the revision session for every important topics of gate cse
@2:31:37 the answer is correct? I feel it could be checked.
Log n levels, each levels n² work. So answer should be n²lgn. Isn't it?
Thankyou
Yes it should be n²log(n).
1:28:03 important
Sir will there be similar type of Revision for other Topics in Algorithms
Yes, We will do a Session tomorrow.
42:02 . Same question as it is asked in GATE 2024 SET 1
Could you please provide notes here
Please check pinned comment
50:00
1:40:00
1:55:00
2:47:00
question
42 theta( (logn)^3)
43 : theta ( (logn)^2 log logn )
44 : theta (logn)^logbase3 12)
verify sir .......
I am not sir, but u r ryt .
42)Theta((logn)^3)
43) Theta((logn)^2 log(logn))
44) Theta((logn)^(log12 base 3))
Thank you guruji... Bass IO organisation interrupt driven aise kara dijiye apki bohot bohot meherbani❤
Bilkul.....We will make it available on youtube soon.
May god bless you all❤@@GOClassesforGATECS
sir is extented master theorem is important like we have to remeber the conditions of it or not?
2:32:39 gate 2021 set2 cs
maza avi gyo
58:00
3:38:23 important