Bidirectional Search Algorithm in Artificial Intelligence in Hindi with Real Life Examples
ฝัง
- เผยแพร่เมื่อ 25 ธ.ค. 2019
- 👉Subscribe to our new channel: / @varunainashots
Bidirectional search is a graph search where unlike Breadth First search and Depth First Search, the search begins simultaneously from Source vertex and Goal vertex and ends when the two searches meet somewhere in between in the graph.
►Breadth first search: • Breadth First Search w...
►Depth first search: • Depth First Search (DF...
►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 TH-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/gatesmashersofficial
► Follow us on Threads: www.threads.net/@gate.smashers
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com
#bidirectionalSearch#AI
May God bless u respected sir
Your hardwork will give fruitful results to everyone poor students who r not able to pay fee for competitive exams.
THANK YOU SIR
ap ki wajha se aj phlye dfa mary exam ki preparation achy hoi.
You are the saviour of corona batches sir . Thanks a lot . This AI playlist helped me a lot .
00:00 Bidirectional search is a special technique where two simultaneous searches are conducted from initial to goal and backward from goal to initial.
01:14 Bidirectional search involves searching from both directions simultaneously.
02:20 Bidirectional search is more efficient than breadth first or depth first search
03:26 Optimizing time complexity of searching algorithm
04:28 Bidirectional search reduces time complexity compared to BFS and DFS.
05:40 Time complexity of BFS/DFS in worst case is O(b^d)
06:44 Depth first search algorithm explained with an analogy
07:40 Bidirectional search guarantees optimal solution and completeness with less time complexity compared to BFS and DFS
WoW!🤩🤩 How beautifully you have explained with such amazing examples💯. Thank you so much ✨🙏
Sirji aapka video dekhnese pehle hi like button apne aap active laagbaagh sare log karte honge jinhone aapke 2-3hi video kyu na dekhe ho, aapki mahanat sarahniya hai 👍
Aapka hr EK video bahut easily understand hojata h sir..... thank you sir🙏🏼
I can play whole semester because I know at last this man is going to pass me my exams on last day
allah apko salamat rakein sir lots of thanks from pakistan
Very good content. I've watched your full playlist on DBMS and Computer Architecture and now this and liked each and every video. Thankyou!
PS: Please make a video on Iterative Deepening DFS too :)
I'm a working Student it's really helpful for me.Thanks for explaining sir.
what a describe wow wow just wow sir! Radheya Radheya❤❤
You are superb men....Your teaching skills kamal h bro...Plz continue GATE series 🙏💗
Thank you...
Thank u sir🤗🤗your explanation is too good😊😊thank u so much
Ky behtareen tareeke se samjhaya hai aapne sr ❤
Awesome you are such a great teacher ☺️
Easy explanation great sir👍💯
Excellent explanation sir keep it ❤️
me always used BFS while searching my GF
😂😂😂
😂😂
🤣🤣🤣
You have a. Gf 😉😥
@@mimis.5139😜😜
the aim was to find the Goal node, in this, we already know about the Goal node, then why perform the search?
It's like you know the school location and your home location but you want to find path...
Here you know goal also but searching for path
Gurujee shandar jabardast zindabad
amazing sir. really splendid examples
Amazing explanation sir.
Awesome way to teach very easy to understand.Thank You Guru ji🙏
Thank u so much Sir 😍😍😍
Ur videos are very helpful for us,,....
Keep uploading plz...
Big Love and respect from Pakistan❤❤❤
Helo sir ..mein ny 2 saal bd ppsc test ki preparation krna start ki han aur apki videos bht helpful ho rhi han ..jo subject during study boring lgty thy smj ni aty thy bs ab wo b smj aa rhy han ..thank you
From Pakistan ...you are the best teacher .
Apko Pakistan mein hona chye tha
ho gya test clear?
Your explanation so good
Really,,,,this is the best...I like it...
sir your explanation is very great...
sir is 2(b^d) will be the time complexity for Bi-Directional DFS ...?
Literally my 3hrs are being wasted every week in university! Your channel is legit
hii zehra
Sir for each search it is b^d/2. BUT both the searches are operating simultaneously,, so why a constant 2 gets multiplied
*amazing explaination*
excellent lecture, very clear and u made easy, Thank you....
Faculty's ko bhi aisa hi padhana chiye mam
Thanq sir🤗🤗
Thanks a ton ! Sir❤❤❤❤❤❤
Very nice person ☺️ and learn very easily ☺️
Thank you sir
Happy teachers day 🙏❤️ you are my teacher
Great explaination
Thankyou, Sir!
Thank You Sir 😊
As usual❤
Can someone explain, if we already know the goal why would we search? I mean the aim is to search the goal state and if you could initiate a reverse search from the goal state then what's the need of the search in the first place?
Sir if we are searching from start and from goal simultaneously then time complexity must be half as we are searching from both side at same time and meet at middle point and stop there ??
So time complexity should be b^(d/2) only na ??
Even if we start from the starting node then move one step forward (say down) and then we move one step upward from the goal state, we are effectively taking 2 steps? So it is not b^(d/2) it is essentially b^(d) unless we are doing parallel processing. Am I right??
Thankyou 🙏
sir hamari poori class aaap k video lectures sunti hai aur paper ki last night aur hamari poori class apki fan hai q k... poora saal teachers k lectures hamein samaj nai aaty aur paper se eik din pehlay aapki video dekh k concepts clear hu jaty hain ...im from pakistan
Thank you sir.
which camera you use for recording? nice lectures b/w
Hello Varun! Thank you so much for your hard works. You really help me a lot. And one thing to mention here, I think the space complexity of bidirectional search is O(b^(d/2)). Can you please check? Thanks
ya, that's what i thought. i think it's a mistake in video.
Thank u sir 👍🏻😊
when we know the goal state what's the benefit to search for it again, even if we assume there are multiple goal states then how can u determine the initial goal state
to find intermediate states to reach final state
Sir time complexity for bidirectional search is =o(b^d ) given in book
Aagaya MST!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
we bunk our lectures to watch your classes !!
Thank you sooo much
It is possible sir, we use deapth first search from initial to gaol state and breath first search from goal to initial state
love you sir
Thanks sir g 👍
My name is Shahid Khan from Pakistan kpk.sir I see your all video . I am very thankful to you because your method very easy to understand every student and sir please some video made in assembly language,softwar engineering .
Sir, I request you You also create a video on data structure and algorithms which includes sorting .bubble sort .selection sort. How merage sort works .Waiting for your video,
Thanku guru ji
should the time complexity not be b^d as the worst possible case for it would be when both the searches don't meet at an point and will have to travel the entire path(considering multiple points of reaching the goal state exist.
So in this technique we have to already know the goal position....Then what are we searching for?
Love you brother from Pakistan 🇵🇰
I hope sir you will answer my query
Sir my humble request is that i have completed btech in computer science and engineering but now i wants to do masters in biotechnology.am i eligible to do msc or mtech in biotechnology.
Does NTA conducts same exam for both mtech and msc biotechnology..
Yes you can apply for GATE exam if you want to do Mtech in Biotechnology and there is IIT JAM exam for Msc in Biotechnology
why time complexity is 2*(b^d/2),
if they start at the same time it should be b^d/2
Where are video lectures of other logic and reasoning types?? Please make videos on them.
if u have already known goal in advance, what is the need of search??
Pass my university exam by watching your video
Os
Toc
Cd
Ai
DBMS
Bcs csit ? Nepali ?
is it depth limit search??
Sir, could you please add subtitles for AI videos? Thanks in advance.
Hello sir, mujhe aapse apne career ke bare me baat krni haii.. Plz sir apse contact kese kru..
sir lekin 9 se start karne ki zarrorat hi q hai ... 9 is the goal state....toh answr mil gaya na 9?
Plz tell me about progressive search
Bidirectional search is an example of mentos Zindagi.
if it is the worst case scenario
shouldn't time complexity be
b^d+b^d=2b^d??
We are going upto half depth in forward and half depth in backward..
Nice
How to know where is the goal state? It again takes time to find goal state. Give clarity
same question in my mind if we know the goal state why we find goal state ..
@@AbdulHaseeb091 sometimes it is necessary to know which path is the best one , even if you know the destination.
What if one follow bfs and other one follows DFS?
did not get how it's always possible to meet in between - the bfs example
They could still miss each other no??, unless the stop point is (is node previously visited by friend 2), but if stop point is (is friend 2 at node AT PRESENT), it's possible to miss no?
ager number of nodes even hu?
aaj se mai sare doston ko bidirectionally miluga 😏🤣🤣🤣
👍😊
Sir its my humble reqst to you if u have time then plzzz plzzz plzzz guide us for coal india limited vacancy every channel is focusing on mechanical civil electrical plzz for system/It ie cs plzzz plzzz plzzzz plzzz plzzz guide us sir plzzz sir it will be so hlpful i will be so grateful to u i am for ur all the lectures plzz sir plzz do replyyy
👍👍
Example is epic 🤣🤣
Legends are watching this series just one day before final exam 💀
Board exam ☠️
Jai mahakaal 🔱
you're blessed as a teacher
please add your patreon or upi link, i want to give back...
Upi: gatesmashers@apl
Thanks in advance
I understood the concept but how do we know where the goal state is to start any algorithm from that side?
bro the question u raised now is one of the disadvantage of this bidirectional search.
one should know the goal state in advance
are you god or youtuber Bro?
Discrete math plzzz🙂🙂🙂
You can follow knowledge gate lectures for discrete. They are really good
just watch with 1.75x spedd to save time.
anyone from klu??
This doesn't seems right, if we already know the goal node then why we are doing this searching?
Don't on the caption during video 🤣
Watching from Palestine 🇵🇸 ❤
Tf
Sir how much money does you earn by uploading videos on TH-cam?
Dude, say that this will be done in Hindi. It will help your Hindi speaking viewers and not waste non Hindi speakers' time