Depth First Search (DFS) with example | Uninformed Search | Artificial Intelligence
Вставка
- Опубліковано 1 жов 2024
- 👉Subscribe to our new channel: / @varunainashots
►Link for BFS: • Breadth First Search w...
► Artificial Intelligence (Complete Playlist):
• Artificial Intelligenc...
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
• Operating System (Comp...
►Database Management System:
• DBMS (Database Managem...
► Theory of Computation
• TOC(Theory of Computat...
►Data Structure :
• Data Structure
►Computer Networks (Complete Playlist):
• Computer Networks (Com...
►Computer Architecture (Complete Playlist):
• Computer Organization ...
►Structured Query Language (SQL):
• Structured Query Langu...
►Discrete Mathematics:
• Discrete Mathematics
►Compiler Design:
• Compiler Design (Compl...
►Number System:
• Number system
►Cloud Computing & BIG Data:
• Cloud Computing & BIG ...
►Software Engineering:
• Software Engineering
►Design and Analysis of algorithms (DAA) (Complete Playlist):
• Design and Analysis of...
►Graph Theory:
• Graph Theory
►Programming in C:
• C Programming
►Digital Logic:
• Digital Logic (Complet...
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on UA-cam: / gatesmashers
►Subscribe to our new channel: / @varunainashots
► Like our page on Facebook: / gatesmashers
► Follow us on Instagram: / gate.smashers
► Follow us on Instagram: / varunainashots
► Follow us on Telegram: t.me/gatesmash...
► Follow us on Threads: www.threads.ne...
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com
Tomorrow is my exam
And tomorrow is mine 😂
Me too @@aviraj2978
Today is my exam
Acha kia bata dia muje nhi pta tha😊
@@haseebazam751 🗿
Today within 3 hrs is my exam
15 mn before exam 😢
Am an AI student, when I took admission in this subject for pg I was little nervous but now your building my confidence that I can do it. Am a first-year student from A.bad , Maharashtra want to thank you...thank you.
I'm from a.good
@@tanishkarora 🤣😂😂
Thank you so much, very well explained, I am from Pakistan. Your way of teaching is excellent and wonderful. I appreciate your efforts and devotion Sir. Please keep making such beneficial videos for students.
I'm also from PAKISTAN 😇
@@ramizurrahmankhan1835 sale padhai karle id mang raha hai.
@@mugambo5505 I am sorry sir 😞😞
@@mugambo5505 Please show Respect !
Abe Tu ja ke bomb phod padh likh kya raha hai
Thank you for your efforts. But sir after A both B and C entered the stack, which is a feature of BFS not DFS. Its either C or B. Right?
yes didi you are right
Tomorrow will my exam 😊
Take an English course as well.
When you are studying in parul university and when you watch this video the add come parul university the best place for study :) sed lyf
We also want playlists on machine learning and deep learning with python.
Last u told about the b^d= 2^2= 4. But did we got the element G within 4 search . Please explain
It must be b^m
M is depth of path
2^2=4
Watch it on 2x❤️😊
😂✅
😅😅
Always 😂
Me also 😂
Where are video lectures of other logic and reasoning types?? Please make videos on them.
amaging u sir , the way u teach is very simple and interesting , i shared your chanel to my class they found very ineresting . May god bless u sir, from hyderabad Pakistan .
🥺🥺TQ for everything you are doing
Thanq You so much Sir Please explain this topic with Some different examples please.........
That moment what the light hits the board(6.00 ) .. i thought my display's had a problem 😂😂. Lol but good explaination though i watch your videos at 1.5x speed.. it's better to teach slow anyway 😌😌
Sir I can't define your effort in words....I have no words to say something about you...Excellent Sir
After watching your videos always my problems are solved thanku so much sir u r great 😍😍
Ohoo
arrey re re
not clear about why bfs is complete and dfs is incomplete, they both could be considered incomplete is the graph is very big in both cases?
BFS is complete because BFS eliminates node after node in the graph. BFS doesn't leave any node behind unvisited ,but DFS is incomplete because it goes into the depth of the node and then backtracks if that particular node is infinite then it would trap us in that loop That is why DFS is incomplete
You and your teaching techniques both are awesome sir 👏
Sir can you recommend which book to refer for the AI subject?
SHORT NOTE ON BFS:
1. Breadth First Search (BFS) is an uninformed or blind searching strategy.
2. BFS utilizes a queue data structure with a First-In-First-Out (FIFO) approach.
3. In BFS, searching progresses level by level, ensuring that the nearest nodes are explored first.
4. It is a complete searching technique, traversing through every possible node to determine if a particular node is the goal node.
5. Additionally, BFS is an optimal strategy for finding the goal node or ending node.
again an awesome and lucid explanation of the depth-first search algorithm. thank you so much
M from Pakistan Bhai ap ka jawab nh out standing teaching experience
jay shree ram
As you say that it will go into deeper into one direction so there should be result like ACGFBDE instead of ACGFBED Am i right ????
Thank God I found today lecture in this channel 🥰🥰 this lecture in data structure but I found in artificial intelligence 👍❤️🌹🥀♥️
Thank you Sir, keep going.. from Pakistan 🇵🇰
Sir plz, take a example of DFS & BFS with directed graph
Thanku so much sir ....u have explained it very well
1 second ago
Ayo wtf. Jaydev Unadkat teaching DFS (Deep Fast Swing Bowling). 😂
actually i dnt knw hindi language. but your teaching is fabulous... language is not a factor for u... your way of teaching is superb..
thankyou so much sir
may god bless you..
Which language do you know then apart from the English?
@@xiaomichina5884 malayalam
Thanks u sir ji please provide all topics on artificial intelligence for net
Great brother ..keep it up. from BD
Vrygrt video sir very useful honestly sir you are hope for lotof students a grt guide n superb mentor .thanxusoomuch sir
sir plz make video on forward and backward chaining & also on first order logic
after watching ur videos my problems are solved thanku sir u are a great ❤
Day after tomorrow is my exam.
And you explain very well. I m complety prepared for my exam.
Thank you sir plzzz ap design and analysis of algorithm ka sorting aur Amorized analysis ke upar vdo banaenge
your new subscriber 🙂
Your videos are great sir had lot of help but in case of cycle how it will go in loop as we are maintaining the stack we also keep track of the nodes traverse and visited. There might be a correction. Please Verify
I also have the same doubt. Kindly explain.
i tried with pen and paper , we get trapped. I have assumed a tree
his whole AI playlist saved my life. Love from Canada
sir please ur way of teaching is awesome i really liked soo much mtlb sabkuch bhot easily smjh ata hai...its my humble request ki ap DAA and python par complete course video bnaye. abhi engineering clg me dono subject bhot trend me hai..really need your help
Hey Sir, thanku for your best teaching. Plz upload videos for TOC also.. If possible..!!
Thanks.
Pure Magic!!
But time complexity is wrong, it is O(b^m) where m is max depth
@@Nerolover33 b to the power d can be possible if d is maximum depth
So time complexity is same in both bfs and dfs?
Well teacher 🙏🏻🙏🏻
Thank you sir for this ground level explanation
Lots of love from umbc
very clear and easily understandable. Salute sir.
Hate those people who dislike your videos.....there is nothing to dislike in such useful videos still some crack minded people have disliked it .
Amazing ❤️
Excellent presentation gentleman lots and lots of love and hugs from Pakistan.
Have you made a video on Iterative deepening search ?
finally I understood thank you Sir XD
thank you sir.....a very gorgeous method of teaching you have .....from pakistan..
Can you please post a video of applying DFS and BFS on graphs?
kyun kal exam h na?
if it had english subtitles it would be great !
overall still understood some thanks mate
yeaaa it would be awesome
Just watching before 4 hours of exam😅
I am watching before an hour 😂😂😂
Is there any video about fuzzy logic???
Sir DFS and BFS both are same in AI and DS?
SIR UR TEACHING IS EXCELLENT WAY OF EXPLANATION IS IN VERY DETAIL
Sir please upload all videos of AI... your teaching way is superb
Is this all syllabus covered for TYBSCIT?
Can you make one video how to prepare for gate 2020.
Which books, which course and which test series.
Pls make.
Sir aap left side se kiun nhee gye bhrwe
Sir....
Aapke wjh se hi OS mera fav. Paper bn gya tha or ab ye v
Thanku sir...
Implementation of dfs in prolog and implementation of bfs in prolog
Sir is ka program sent kr dain.
please
Anyone from galgotias university watching this tutorial.
Such a clear explanation 👍👍
Ty sir
I wish you were speaking in English, we too in Africa we are doing computer science , we need help. we are left out with such UA-cam videos when you are not speaking English
thank you sir
very very nice video
because you are teaching fabulous.
end main thankyou bol k dil jeet lete ho
Sir, aapke voice itane clear ha ke aap jo bolte ha vo sab samaj aata
You are great 👩🏫teacher😊
Why you consider infinite state while explaining DFS if you consider infinite state in BFS then it will also be an incomplete for in a case our branching factor is infinite but our goal will be exist on second level fir node then BFS is also become an incomplete.
Sir, what if the branching factor is different at each node? for instance, A has 3 branches B,C,D and further B C D has 2 branch each. In such case what should be 'b'. Same for 'd', if depth is uneven.
Excellent explanation sir👍
Thank you sir, love from Nepal 💖
Visit nepal 2020!!!😂
Oh you mean from universe 😜
Apny kaha k uninformed approach mai optimality Guaranteed hai , lekin yahan phr dfs optimal q ni hai ?
Hi. Sir obiee 12 c pe lecture start karye plez apka teaching style superb hai..
Which one is faster bfs or dfs. Can you explain this with Same example please... 🙏🏼🙏🏼🙏🏼
Sir can you share us a proper material of this topic like all the dfs bfs in traversal algorithms we are very thankful to you
ua-cam.com/channels/VPts3oDzNFCxB6eCvgaJqQ.html
Watching from *NIT SRINAGAR*
🍆✊💦💦
Sir time complexity par ek full video bna dijiye please kese nikalti hai ye abhi tak samaj nhi 2 saal ho gye ratte ratte please 🙏🙏🙏🙏🙏
Wow sir..aap hamari saari demands fullfil kar re..thank you
thank you so much sir😇 order matter first B node then C node because of recursion , recursion always traverse left to right
Thoda complex question liya kariye sir easy bahut h
Bahut badhiya sir g
Sir last ki baat clear nhi hui 4 search m kaise complete hoga ydi m a to b, b to d, d to b and b to e then again reverse ye bhut jyada search lega plz make it clear
You teach very well. No one tells you as good and understood as you.
True words...pls teach me grammar 🥺🥺
@@arpitpandeyofc 🤣🤣😂😂
@@arpitpandeyofcbro💀
Itte cute h ap..or utna hi acha explain krte hai.. ❣️tq sir🤗
not to be rude or something but , dont make an english title when u'r not going to talk in english
or atleast add ( hindi )
Thanks love from Russia ❤
😂
Great sir everyone is watching before 1 day before exam
After watching 10 videos I found your video and understood it easily, thanks brother
Today i hv internal of ai
Sir tomorrow we have exams sir I prepared by this video sirr I need your blessings for my exams
When I will Visit India I will Meet you to thanks Love From Pakistan ❤
Beautiful explanation!
ua-cam.com/channels/VPts3oDzNFCxB6eCvgaJqQ.html
I can't believe how great this is! I recently read a similar book, and it was absolutely incredible. "Game Theory and the Pursuit of Algorithmic Fairness" by Jack Frostwell
Sir iski time complexity me doubt hai jaruri thodi hai ki har node ke child same ho to ham kaise declare karemge depth or branch