Sir, you're awesome. I generally don't comment, I think it's the first time I'm commenting. I warned your DBMS and OS lectures, they helped me a lot. Also bring a series on Design and Analysis of Algorithms. It will be extremely helpful
Geat video Sir. You explain things in a very simple manner. I couldn't understand what my professor said and hence came to your channel and I think I did the right thing.
Sir thank you for providing useful content for gate/ugc net etc. I have a suggestion that when you upload or create a series of videos regarding a topic please mention the number so that It can't be confusing. I was watching your dbms videos and got confused. Sir please treat this as a request. Thank you Sir for sharing your knowledge with us. Subscribed and told my friends about your channel.
Sir i really like yur method of explanation and easy briefing. You r the best and yur real life example take yur teaching to next level. seriously sir i was studying for more than 6 hrs. Continuously then i started watching yur lectures. That's why sir you are "MY CRUSH" Thanku so much sir ❤
Great explanation sir 😇😇 I don't think no one can better explain this concepts of Artificial intelligence easier than you do. Thank you so much 😊😊keep going ♾️
I'm so grateful to you sir ...I usually don't comment on any video but your videos are osum I couldn't stop myself from thanking you through this comment
i have one doubt that is.aap ne staring me kaha ki best utility leni hai (leaf node=8) but last me humne C ko choose karke utility(leaf node=2) kam kardi ? however video is very good.
Sir can u make 1video on 1 question. Difference between Hash based indexing and tree based indexing its much imp topic but i didnt found proper answers in utube or in google to
best explantion sir... every doubt is cleared now...sir help chaheye HPSE(HARYANA) RPSE(RAJASTHAN) AND PUNJAB k Assistant professor k previous year paper arrange ho skte hai kya...
You yourself said its done in depth first manner, and then solving it in breath first way, which is creates confusion. Its better to solve in depth first manner, even in these simple problems so that we are not confused in alpha beta pruning
Sir, i have a doubt, in this (Minimax) algorithm, do we have to start from the A node or from the highest value given in the leaf node. i.e 8. Because if we start from the root node (A), Max will obviously choose the B node, so after reaching the B node, the Min might choose the E node instead of D node. jaisa aapne kahan (4:44 pe) ki turn by turn game khelenge toh, Min has the option to choose E node as well. because -1 toh D & E node dono me hai.
Banda sahi padhata hai👍👍
Very understanding hindi
Off curse
correct but wrong sentence
bandaa sabh! kuch padha leta hai👍👍
Thank you so much sir......I qualified UGC NET JUNE 2019, your videos helped me so much......thank you for that.
Gud congrats mujhe bhi bta do paper 1 ki preparation konsi book se ki and paper 2 ki bhi
Congrats mujhe bhi bta dena paper 1 ki preparation konsi book se ki and paper 2 ki preparation bhi
@@namitsharma3449 KVS Madaan is best book for paper 1.
Which book is gud for papar1 Mr Rajendra plz tl me
Bhai aapke kitne bacche ho chuke hain
Sir, you're awesome. I generally don't comment, I think it's the first time I'm commenting. I warned your DBMS and OS lectures, they helped me a lot.
Also bring a series on Design and Analysis of Algorithms. It will be extremely helpful
I have my exam tomorrow and this wonderful video helped alot thank you so much 🙌
Are you doing BTech ? I am in 5th sem BTech I have exam on 20
Geat video Sir. You explain things in a very simple manner. I couldn't understand what my professor said and hence came to your channel and I think I did the right thing.
With such clear explanation anyone can clear the subject
Thank you so much sir!
Sir, your lectures are amazing and easily understandable rather than our AI professor teaches us.
best teacher for all subjects ..............sir aap khudka website khol lijiye log site visit karenge ...............
Thank You Aditya.. I need some students for that..You can help me if you are interested
Becoz of you Sir my concepts gets cleared amazing explanation .
I started watching your videos from Operating system and from then fan of ur videos .
Because of u sir my concepts gets cleared amazing explation 😊
Sir thank you for providing useful content for gate/ugc net etc.
I have a suggestion that when you upload or create a series of videos regarding a topic please mention the number so that It can't be confusing. I was watching your dbms videos and got confused. Sir please treat this as a request. Thank you Sir for sharing your knowledge with us. Subscribed and told my friends about your channel.
Thanks for your suggestion.. soon we complete the series with sequence no..
@@GateSmashers
Branching factor is not clear for this example...
Branches factor is 2 , depth 4 I think.. plz make it clear
Amazing Sir You Really helped me a lot . No need to open books . You really taught awesome. Thanks a billion Sir❣❣
Your vedios are a boon to students during lockdown. ♥
Vedios are really backbone to your backbone of studies
Sir I am in my btech 5th Semester. I have been watching your videos since 1st semester. You are really a great teacher to me at hard times ❤
Amazing explanation, jo harvard course se nahi seekh paya aap ne sikha diya.
mind blowing sir g !pray for us kal hamara exam ha
All the best
Explained in very easy way , thanks
Outstanding.... I was waiting for Ur video...
his way teaching is very good thank you sir
sir your teaching is just awesome,great job keep going on
this is only choice for us (last benchers)pls dont stop
My all logical subject clear sir lecture
Sir i really like yur method of explanation and easy briefing. You r the best and yur real life example take yur teaching to next level. seriously sir i was studying for more than 6 hrs. Continuously then i started watching yur lectures. That's why sir you are "MY CRUSH"
Thanku so much sir ❤
Good
Subha sawaere exam hai guys ,Duaa karna ! ❤
2 ghanty bad paper hai😢😊
15 min baad🙂
Mera kal hai 😂
1 ghante baad
@@omkale1495 best of luck 🤞
Hope it went well
Honestly bhai tabahi samjaya kudos
best explanation of game tree and the algorithm perse, watching from tamil nadu
according to branch factor b^d it should be 2^3=8 instead of 9 i think so
Yeah same
Yes I was thinking the same
He said we got number of childer 3 and depth is 2 therefore we got 9
But in this example number of children is 2 and depth is 3
You are wrong bro. Its 3^2
Bari zabardast video hae G... preparing for papers currently...
One of the best explanation. Amazing.
Best teacher with best voice❤❤❤
Excellent representation ...
My all doubt are cleared after watching your video...
Thank u so much sir
I suggested your channel to all of my friends because you deserve the best .
Superb explanation 💕
Sir pls make videos on alpha beta pruning & previous years question on AI
Your all videos r super,I cleared UGC NET . mostly I referred Ur videos only
Thank you so much
Sir please add water-jug problem & goal stack planning with example , urgently needed for sem exam .
DM me
Really explained well Sir👍
Amazing teaching method❤❤❤
simple & effective teaching. Great sir
Sir you are great 🎉❤thank u sir
8:33 min's turn is confusing me :(
As max is choosing maximum value to win .. shouldn't min also choose maximum value to block max from winning!?
i have premium account of you tube so i never face add and without add we can understand better ..thanks so much sir
Kya?
@Jason Roy haha
Sir you deserve more views & SUBSCRIBER .....👌👌🖒
Awesome explanation..it works 😊
Oo ji...maine chess ni khela h kvi..aap chess wali example na lo..😂😂
Bt awesome teaching guruji..🙏
Great explanation sir 😇😇 I don't think no one can better explain this concepts of Artificial intelligence easier than you do. Thank you so much 😊😊keep going ♾️
Thank you so much sir because you are teaching better than our lectures
I'm so grateful to you sir ...I usually don't comment on any video but your videos are osum I couldn't stop myself from thanking you through this comment
Sir, please also upload videos on computer architecture
Thankyou so much Sir. Very nicely explained.
Watching 15 minutes before the exam ..feeling excited 🫸🙂🫷
i have one doubt that is.aap ne staring me kaha ki best utility leni hai (leaf node=8) but last me humne C ko choose karke utility(leaf node=2) kam kardi ? however video is very good.
Sir can u make 1video on 1 question.
Difference between Hash based indexing and tree based indexing
its much imp topic but i didnt found proper answers in utube or in google to
very nice explanation varun sir....thankyou
Ache se samajh aa Gaya sir
Amazing teaching skill sir 👌👌
you are like my brother bhaiyyaa . thanksss💌
Nice explaination sir👍Now clear with concept:)
best explantion sir... every doubt is cleared now...sir help chaheye HPSE(HARYANA) RPSE(RAJASTHAN) AND PUNJAB k Assistant professor k previous year paper arrange ho skte hai kya...
Explain with very easily nice sir
You are awesome sir
Ai ko intresting bnadiya Thankyou sir
Well explained sir 👌👌.....
aap kya pdhate ho sir 👏
frst time watching your video and very impressed ...
Chalo thank u sir pura clear ho gaya
Wonderful explanation sir. Commenting is not my usual practice. But I couldn't avoid appreciating you. Hats off sir👏
sir u r gud ur expnt is mind blwng.thnku so much sir
Thank You for your appreciation. Keep learning and sharing
Excellent explanation sir
so great that virat kolhi is explaining concepts to me
Loved your teaching style❤️❤️
thank you
Nice explanation sir 😀❤️
Sir v nice.. Explanation. Plz make vídeos in English also..
thanks bhai, bahut help kiye.
Thank u so much sir for all your videos of CS
You yourself said its done in depth first manner, and then solving it in breath first way, which is creates confusion. Its better to solve in depth first manner, even in these simple problems so that we are not confused in alpha beta pruning
Ech n evry vdo of u is simply awsm sir..
Better than college teacher concept clear ❤🎉
Superb teacher ever
Your teaching style is simply amazing 👍
Sir.. Your way Of Teaching... 👌👌👌👌👌
Understood clearly 😊
You are my favourite teacher ❤️
Sir, i have a doubt, in this (Minimax) algorithm, do we have to start from the A node or from the highest value given in the leaf node. i.e 8. Because if we start from the root node (A), Max will obviously choose the B node, so after reaching the B node, the Min might choose the E node instead of D node. jaisa aapne kahan (4:44 pe) ki turn by turn game khelenge toh, Min has the option to choose E node as well. because -1 toh D & E node dono me hai.
that is the why MAX will choose node C to ensure it's win
Where are video lectures of other logic and reasoning types?? Please make videos on them.
Best Bhaiya 🌝💕
v informative and simplest method to understand AI.. Thanks Sir
👍💓 great teaching method
..
Guru ji pranam 🙏🙏
Thank u so much sir. God bless u.
Thanks bro. At last I have understood.
explained well like always.
you really explain well sir...!!!!! you are amzing sir....!!!!
Love you hogyaThank you for explanation
best explanation.
Thx u sir
(State space Representtion of problems )
Es topic pe video Bana do....
Computer be like Chaal chal tu apni meh tujhe haradunga🤣
ধ্যান বাদ 👍👍👍👍🙏🙏🙏🙏🙏🙏😎😎😎😎😎😎😎😎😎😀💐💐💐💐💐
Talented sir
Hello, Very good explanation. You made it very easy to follow. Thank you!
sir, you're the great ❤
best video understanding ever... Thanks
Amazing 😍
Thank u sir your the only person who save me from my father belt 😢
Nice explanation sir