L-4.15: BFS & DFS | Breadth First Search | Depth First Search | Graph Traversing | DAA
ฝัง
- เผยแพร่เมื่อ 13 ก.ย. 2022
- 👉Subscribe to our new channel: / @varunainashots
►Design and Analysis of algorithms (DAA) (Complete Playlist):
• Design and Analysis of...
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
► Operating System :
• Operating System (Comp...
►Database Management System:
• DBMS (Database Managem...
► Theory of Computation
• TOC(Theory of Computat...
►Artificial Intelligence:
• Artificial Intelligenc...
►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
►Data Structure:
• Data Structure
►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
#breadthfirstsearch #depthfirstsearch #algorithm
Why this type of teaching is not found in universities...u r fabolus sir..
u were probably chit chatting when your teacher was teaching this stuff and now you probably have exams in some days'
@@vjkdestinyyt4676 Not in some days. Exam is over today. 😁 of DSA
@@shahidjack373 ahhh lucky.. i have mine last that is programming and that is on 14 😂😂first time giving offline exams
@@vjkdestinyyt4676 tum LPU ke ho ryt😂😂😂
@@sahirmohammad9027 thode se miss kr gaye 😂cu ka hoo
Maturity is when you know your life was dfs (one direction one goal) became dfs (multiple directions no goals) 😅😂
So either learn one thing at time or learn many things at the same time
😂😂😂....
😂😂 we are intelligent therefore we learn 100 of lessons from one topic 😂😂😂😂😂😂😂😂😂
Thank you bhai muje pata chal gya ki m mature hu thank you
Padhle philosopher k najayaz aulad
0:51 Every tree is a graph, but not every graph is a tree.
areyy wah wah wah wah yahi bolne ko aya si mein
Sahi bole bhai
Ye galat bata ke confusion create kar raha tha
@@IronheartGamingTH-cam bro insaan hain.. galti ho sakta hain :) Itna achha quality content mil raha hain .. kaafi hain :)
Who is here before exam ?🙂
Yes bro😂
Am
Tomorrow is my exam 🙂
Me at 4am
10 baje dekh rha hu, 2 baje exam hai 😂
The best part of every lecture is - "Subscribers boht jaroori hai😅❤❤" love you sir
THANK YOU ADARSH ..LOVE U 2
I'm used to it 😂❤ .Sir is the best toh subscribe toh jaroori hai eh❤
Great explanation, but one mistake at 0:50, it should be "Every tree is a graph, but not every graph is a tree."
True
yess
Fatrue
Yes yes
Yesss..he has made mistake at this point
Thank u Sir ❤️ For such a great series of DAA.
A big salute to you sir....hats off sir....your way of teaching is incredible.
🎯 Key Takeaways for quick navigation:
00:00 🌐 *Graph traversal involves visiting and exploring vertices in a graph or tree, with focus on visiting and exploring.*
01:54 🚶♂️ *Breadth-First Search (BFS) covers levels one by one, while Depth-First Search (DFS) goes towards depth, backtracking when needed.*
03:21 🍴 *BFS example: Visiting a food stall breadth-wise at Marys. DFS example: Choosing a career path and backtracking when faced with a dead end.*
05:17 🔄 *BFS uses a Queue, exploring vertices level by level. DFS uses a Stack, going in-depth and backtracking when necessary.*
10:40 ⏱️ *Both BFS and DFS have a time complexity of Order(V + E), making them crucial for applications like web crawlers, social media, and network analysis.*
Made with HARPA AI
Mene apki video dekh bsc cs clear kiya abd now my msc cs ki exam ke liye apse hi pad rhi hu thanku so much sir ♥️😊 itte easy way me padane ke liye
sort and sweet .. very best video for BFS & DFS... thx..
All your videos provide a wonderful content 😇
Every tree is a graph, but not every graph is a tree.
I just want to thank this channel which helped me a lot in my selection as TGT CS in DSSSB ...
Thanku sir.. 🙏
Congrats
Sir At 0:51 there is a correction. It must be every tree is a graph but graph may or may not be a tree.
Yes you're correct, I was also wondering why I cant agree with him 😂
I have been watching your videos since last week.
Wonderful content sir 😍😍, really helpful for quick remembrance
Awesome lecture sir....🙏🙏
Excellent explanation sir. Thank you
Main kahani ye hai ki devices multiple hai but email ek hi hai! 😄Thanks a lot!
SIR please complete your DAA playlist with the topics like RED-BLACK TREE, B-TREE,TRIES,SKIP LIST, FIBONACCI HEAPS ,ET-CETERA
Lmao stfu go listen while your teacher is explaining in class cringe 🤣🤣🤣
Thanku sir
Full course done
Hey, you are doing a great job.
kmall sir level great teaching method
Finally I finished the playlist sir. Thank you
The teacher that we all wanted but don't deserved♥️♥️
sir can you please also include topics in your DAA playlist like segment tree,red black tree,skip list etc
Sir I hope you are well, I like you very much you are one of the best teachers in the world who teaches very well and you make every point very clear, sir you helped me a lot from ist sem to now 4th sem i am doing BCA, For which I am very grateful to you I have watched your all videos till now...
Now sir plz i have request please make the video on *Amortized Analysis* and also on *Medians and order statistics*...( bht se youtubers ki vedio dekhi the but zara b smj nahi aaya, kyun ki aph ki aadat hogyi hai na sune ki so plzzz Sir Accept my little request that will be your kindness..lots of love sir ❣️❣️❣️❣️
honest reaction- "Dil khush kar ditta!"
i will pass my wxams bcz of u thanks
Totally loved it maan❤
Thank you Soo much sir ,ap bht acha smjaty ha ,concept clear ho jaty ha sary🌸🌸
I think there's a small problem in dry run, from 4 how we can directly jump to 3? 4 has 2 children - 5 and 6. From 4 it's not possible to jump to 3, since 4 doesn't know 3. In my dry run, I had jump to 2, then to 1, then from 1 to 3 and finally 7. Hence, the final answer is same.
I'm watching this while I'm learning BST, so maybe I'm wrong, but yeah this is what I had to say.
kalyug ko uski charamsima pe pohchane ka waqt aa gaya he sir..isliye ye sikh raha hoon...ASUR
Well explained Sir you are the best
Perfectly Explained..
I ALWAYS SUBSCRIBE very good purpose youtube channel ... like you
Such A Great Teacher Hats off💯💯Sir❤❣
You are Great sir
i have exam in two days your videos are helping me a lot by saving my time
love you brother
kaisa gya exam bhai
@@mddilshadansari_0792 50/60
@@hackcodesfree9200 which University give results in one month bro
Super explanation sir...
Great teacher
just wanted to let you know that ,youre videos are getting suggested by the faculty of our university for better understanding!
Thanks sir ✨️
Thank you so much
You are just superb
I subscibed .... your way of teaching is such that no professor can explain
u r awesome guru. Love u
Sir you are great
Nice video sir !!
Thank you so much sir😊
very nicely explained
Great🔥
Thank you sir Allah ap ko ilm ata Kara mazeed
tomorrow is my exam and you helped me alot ❤
Exam is in afternoon, I'm watching this in morning 😁
Well explained within time... thanks sir
awesome Example
Sir Every tree is a graph but every graph may or may not be tree.
Thanks crystal clear🎉🎉🎉❤
The correct statement is: "Every tree is a graph, but not every graph is a tree". you mentioned it wrong in this video
Thank you sir 🥰
Amazing
Thank you ❣️ sir
Thank you so much sir 🙏❤️
Thanku so much sir 😊
You are teaching on White board is really nice , i thing this little bit .....
You are the great teacher my university teacher is nothing infront of u guruji🙏
Thanks sir 😊
Thankyou sir ❤
Bloody sweet sirr🎉❤
Wow !! Wonderful explanation ♡
thanks a lot sir......
Thanks sir
awesome sir
thanks sir
Excellent ❤❤❤❤
Wow amazing 😌😌
Love you Sir
Very nice explained sir 👌👌👌
Great explanation sir!!👏
Your teaching technique is very imagine sir👍👍💯💯❣️
Thanks sir respect from pakistan ❤❤❤❤❤❤
at 0:50 "Every graph is tree???" "EVERY TREE IS A GRAPH".
Ulta bol diya hai bhai sir ne
thanks😇
Too good👍
0:56 according to me there is statement like
Every Tree is graph but not all graph is tree
yes it’s correct
kamal ha sir ji lub u
Sirrr hatsss of to u sir❤❤
Love u man❤
PERFECT easy way me samjhaa diyaa
or mere clg me professor ne itnaa complicated way me samjhayaa thaa ke kuch nahi samajh aayaa
par ye viedow dekh ke aagyaa samajh
Love you Sir from abbottabad kpk Pakistan 😍❤️❤️❤️
EVERY TREE IS A GRAPH BUT EVERY GRAPH MAY OR MAY NOT BE A TREE
great
Thanks anna
Sir m pass hogyi data structure m..😇 thanku so so so much sir..ap sbse best ho...aapki wjh s kitne bcche success ho jate h .❤or m sbhi ko advice Dena chahti hu pdhna ho toh gate smesher sir s...i can't express my feelings in words..❤️✨god bless u sir..😇ap really hero h hum jse average students k liye😊
Congratulations
Became your fan🔥🔥❤️
❤❤thank you
Nice
Best teacher I have ever seen in my life❤
Super sir
Great teacher 👍