Mam we have exam on 14/07/2023 . so pls do videos on this Topics : 1) greedy method 2) dynamic programming 3) shortest path 4) job sequencing with deadlines 5) Back tracking.
We have machine learning exam tomorrow...please continues making videos on analytical learning, combining inductive and analytical learning for jntuh r18 syllabus
mam please upload videos of NP bais concepts and cook theorem. and dynamic programmimg please mam our exams are near.. you are really helping students a lot, you are our real teacher..
NP-Hard and NP-Complete problems: Basic concepts, non deterministic algorithms, NP - Hard and NP-Complete classes, Cook’s theorem. Please do these videos . exam on 14/07/2023
Itna simple kisi or n nhi smjaya ... thankyou so much ma'am ❤
Video on cooks theorem
Though it is simple , it is Very complicate to teach . But you pulled it soo smooth 🙌
Thanks a lot 😊
Mam we have exam on 14/07/2023 . so pls do videos on this
Topics :
1) greedy method
2) dynamic programming
3) shortest path
4) job sequencing with deadlines
5) Back tracking.
this is my favorite educational channel
Nice explanation. I prepared for a seminar class by seeing the perticular video. Thanks for you help. I will remember you.😅
We have machine learning exam tomorrow...please continues making videos on analytical learning, combining inductive and analytical learning for jntuh r18 syllabus
mam please upload videos of NP bais concepts and cook theorem. and dynamic programmimg please mam our exams are near.. you are really helping students a lot, you are our real teacher..
Thank you so much ma'am for your good explanation about the NP Problems.🥰
Ramro padhayeu ❤
Thank you so much Madam your videos are really helpful Madam.
Very good explanation... 👍
❤Good explanation mam easy to understand ✨
Please upload all the videos
We need the whole syllabus, we dependent on your playlist, please don't keep it incomplete Akka.
Will upload soon
Ap aa ts aah bro
@@lakshmiprasanna9470 haa ts
Beautifully explained ❤️
Nice Explaination, keep it up
❤ wow what a hand writing
NP-Hard and NP-Complete problems: Basic concepts, non deterministic algorithms, NP - Hard and
NP-Complete classes, Cook’s theorem. Please do these videos . exam on 14/07/2023
Exactly 10 days later for us
@@siddireddyvignesh tommorow for me
Iare ah broh
@@001merugushivakrishna3 means
Lub u mam....great explanation ❤
One day before exam 😅thank you somuchhh
superb explination ...lowed its
uour visa is cuta so munch!!
i pour inglis
It is applicable for jntugv
Your one help on me very useful
is it find solution for p2 or p1 in reducible algorithm?
good content and explanation
We Really love's you.❤🎉
maja he agaya 3 no toh pake h section A mai
Please continue this DAA important topics
Dynamic programming and strung maching algorithem ke bhi videos Lao na shravya
Best video mam
Made my life easy
Clear ❤
Thankyou so much
💌
Video Lao please video lao
Hii madam
I have DAA exam tomorrow , could you please explain the cook's thoerm mam
good explanation
Thank you mam❤
Thankyou So much
wao❤
Nice
Nice ❤❤❤❤❤
Make video of dynamic programming and string matching algorithm
Mam where is cook's theorem
One more concept is left,i.e, cookes theorem
sure, i will try to upload
Next vdo mam..plzz😢😢
Tq madam ❤
PLZ EXPLAIN OBST TOPIC !!
❤
Cooks theorem mam
3din pahle dala hota to Mai pahale se padh liya hota
tere liye todhi bana rhe hai course bhai
Thanks
super akka
Video on cook's theorem