Gate Smashers
►Link for BFS: https://www.youtube.com/watch?v=qul0f79gxGs&t=379s
► 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
#DFS#ArtificialIntelligence
Source
Very useful video
Thanks Sir ji
Sir dfs timestamp pe bhi video bnaiye….
Anyone from galgotias university watching this tutorial.
Hey Sir, thanku for your best teaching. Plz upload videos for TOC also.. If possible..!!
Thanks.
Nice explaination sir
amazing Sir g… Love it
thnq
Thnku ☺☺
sir i need all lec AI
plzzz help:(
Ur way of teaching good
Plzz sir can u read assembly languages
Sir Kindly share Informed search video ….
thank you sir…..a very gorgeous method of teaching you have …..from pakistan..
Thanku so much sir ….u have explained it very well
Thanku sir
Sir make new video on means ends analysis
Great brother ..keep it up. from BD
thanks sir
Great teaching way
CU valo padlo sahi se
Bhai B kyu aya yr
Thanks sir
Kya mast padate ho 😊😊
Implementation of dfs in prolog and implementation of bfs in prolog
Sir is ka program sent kr dain.
please
M from Pakistan Bhai ap ka jawab nh out standing teaching experience
if it had english subtitles it would be great !
overall still understood some thanks mate
Awesome explanation sir 👍👍
thank u D/r
Itte cute h ap..or utna hi acha explain krte hai.. ❣️tq sir🤗
Good explanation
Thank you sir
Thank you sir plzzz ap design and analysis of algorithm ka sorting aur Amorized analysis ke upar vdo banaenge
Thanks sir g….💓
😊👍
This is amazing Sir
sir can you plz describe the depth limited algoritum…your way of explanation is soo much impressive…plz can u explain depth limited algo and itreative deepning algo….
Sir….
Aapke wjh se hi OS mera fav. Paper bn gya tha or ab ye v
Thanku sir…
informative
Nice sir… ap operating system k jo algo hn un py b vidios bnaen like..FCFS…SJF.SRTF.HRRN.. etc
apne dfs ki time complexity galat likhi hai
After watching your videos always my problems are solved thanku so much sir u r great 😍😍
Sir plzz give it's algorithm or pseudp code
y did u push B before C at starting ..like y did u push both B and C together ,.we can only go in depth ..so we should first follow either B or C but not both right??
It's explanation is excellent
Thanks
Its certainly dfs but not dfs in AI.
Can you please find Time Complexity for Node G in above same example?
We also want playlists on machine learning and deep learning with python.