Gate Smashers
► Link for Artificial Intelligence Syllabus for NTA UGC NET:
https://www.youtube.com/watch?v=uB3i-qV6VdM
► Schedule for NTA UGC NET Computer Science:
https://www.youtube.com/watch?v=_-UOsa2bkzQ&t=2s
► New Syllabus of NTA UGC NET Computer Science:
https://www.youtube.com/watch?v=tBRgI-oobOk&t=9s
► Analysis of NTA UGC NET Dec 2018 CS :
https://www.youtube.com/watch?v=oKJ1MsLvp1k
► Analysis of NTA UGC NET June-2018 :
https://www.youtube.com/watch?v=uTBdBOB7AME
► Previous year Questions Explanation of GATE, UGC-NET & PSUs:
https://www.youtube.com/playlist?list=PLxCzCOWd7aiG9x0zDA4heJ3TWLqTE3gE4
► NTA UGC-NET Data Structure Paper analysis and Previous year Questions Explanation:
https://www.youtube.com/watch?v=PZs7az8cxPQ&t=8s
► NTA UGC NET Algorithm & Data Structure Previous year Questions Explanation:
https://www.youtube.com/watch?v=akVtp2B9AnI&t=14s
► NTA UGC-NET C/C++ Paper analysis and previous year Questions Explanation
https://www.youtube.com/watch?v=bH7uT7lBMGg&t=50s
► Link for UGC-NET Mock Test Series Playlist:
https://www.youtube.com/playlist?list=PLxCzCOWd7aiEJtXNeIfxa5dqm6SnFJ9Oj
►MUST WATCH Before you start preparing for any competitive exam:
https://www.youtube.com/watch?v=KycO72Zgr0c&t=2s
► Link for Computer Networks Playlist- https://www.youtube.com/playlist?list=PLxCzCOWd7aiGFBD2-2joCpWOLUrDLvVV_
► Link for Operating System Playlist-
https://www.youtube.com/playlist?list=PLxCzCOWd7aiGz9donHRrE9I3Mwn6XdP8p
► Link for Database Management System Playlist-
https://www.youtube.com/playlist?list=PLxCzCOWd7aiFAN6I8CuViBuCdJgiOkT2Y
► Link for Graph Theory Playlist-
https://www.youtube.com/playlist?list=PLxCzCOWd7aiG0M5FqjyoqB20Edk0tyzVt
► Last Minutes Preparation for UGC NET and GATE Playlist-
https://www.youtube.com/playlist?list=PLxCzCOWd7aiE4LQMkIhAe9amWX_SPNMiZ
————————————————————————————————-
Our Social Links:
► Subscribe to our YouTube channel: https://www.youtube.com/gatesmashers
► Like Our page on Facebook – https://www.facebook.com/gatesmashers/
► Whatsapp: In order to receives updates about UGC NET Computer Science , Whatsapp your name to 9876444511. Save our number in your phonebook to receive updates on Whatsapp.
► For any Query and Suggestions-
gatesmashers2018@gmail.com
#BFS#ArtificialIntelligence
Source
You are the best teacher in youtube
Thank you so much Sir very informative video
Sir you are great no one can explain as you explain.
Teaching level damn high sir. And best thing is that your concepts are clear and you not leave any confusion in your lecture video. Keep going sir . Aese hi bachoo ka bhla karo
12:12 how can it be 9! For example, if G is under node D, then 3 searches of +3 searches of B + 3 searches of c + 3 searches of D=12 searches! Is this how it works or am I getting something wrong?? Please Help!
lpu's one of the best teacher.
Amazing, Much love from Pakistan
Sir, you are supper….
Aapka pdhane ka way like, direct mind m set kr Dena….
Thanks…
Allah Pak Kuxh Rakhe Sir G ap ko
is he speaking english? can't understand shit
Awesome sir
sir i have one question. jab ap formula ma vlaue put karty han or find karty han 12:00 time par tab answer atta hy 9 lakin hamary pass node han 7 2 zayada search karny pary gi jab hamy right answer mill jaye.
please clear that point sir.
sir u r one of the best faculty of lpu
thanks
I have no words….. Bet lectures
Very great lecture…
Your lectures are the best…
Sir u r supper teacher on u tube.
We are helping such students to get IoT and ML training for FREE* worth Rs.9,600/-. Use the discount code
FREEBEC9801
at checkout on http://boltiot.training/freebec9801
Sir suppose every node has three child and we want to find a node which is in level 2 and it is the last node of that level like i in your example then b^d =9 but we can't reach that node using 9 step.
while explaining please sir make video shorten by telling us only the related information , suppose when you explaining about uninformed just stick with it ,don't tell anything about informed … it makes a bit boring m sorry but for your goods only i am telling…and please make the full video cover all the basics also with a brief notes which already has to be written so, that even i could write it down in your lecture i couldn't figure out what to write . i mean i could't figure out what valid point i should write because i am very beginner and also make a kind of consecutive videos which all related with each other i mean i understand the algorithm but i couldn't figure out where to use and how to use , it a exam point of view but bit description will be help full
Awsm sir g
Thank you sir
SIR TIME COMPLEXBITY PR PROPER VIDEO BNAO. ( HOW TO FIND TIME COMPLEXBITY FOR ALGORITHM, ……..ETCC
Great sir. ……thnxxxxxxxxxxx…. Very very