Who is here before exam ?🙂

@payal7819

4 ай бұрын

Yes bro😂

@huriarauf189

2 ай бұрын

Am

@itssipun9086

2 ай бұрын

Tomorrow is my exam 🙂

@rupeshyadav3181

2 ай бұрын

Me at 4am

@pranshulvijayvergia4213

2 ай бұрын

10 baje dekh rha hu, 2 baje exam hai 😂

Why this type of teaching is not found in universities...u r fabolus sir..

@eiji11282

Жыл бұрын

u were probably chit chatting when your teacher was teaching this stuff and now you probably have exams in some days'

@shahidjack373

Жыл бұрын

@@eiji11282 Not in some days. Exam is over today. 😁 of DSA

@eiji11282

Жыл бұрын

@@shahidjack373 ahhh lucky.. i have mine last that is programming and that is on 14 😂😂first time giving offline exams

@sahirmohammad9027

Жыл бұрын

@@eiji11282 tum LPU ke ho ryt😂😂😂

@eiji11282

Жыл бұрын

@@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) 😅😂

@Sanjaysview

11 ай бұрын

So either learn one thing at time or learn many things at the same time

@ronokjahanmithila7487

11 ай бұрын

😂😂😂....

@dangerousn

9 ай бұрын

😂😂 we are intelligent therefore we learn 100 of lessons from one topic 😂😂😂😂😂😂😂😂😂

@mrpatel4313

8 ай бұрын

Thank you bhai muje pata chal gya ki m mature hu thank you

@houseoflofi8442

8 ай бұрын

Padhle philosopher k najayaz aulad

0:51 Every tree is a graph, but not every graph is a tree.

@lagansardana

Жыл бұрын

areyy wah wah wah wah yahi bolne ko aya si mein

@IronheartGamingYoutube

Жыл бұрын

Sahi bole bhai

@IronheartGamingYoutube

Жыл бұрын

Ye galat bata ke confusion create kar raha tha

@100deep1001

Жыл бұрын

@@IronheartGamingKZread bro insaan hain.. galti ho sakta hain :) Itna achha quality content mil raha hain .. kaafi hain :)

@Bruce2207

14 күн бұрын

Correct

🎯 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

Thank u Sir ❤️ For such a great series of DAA.

The best part of every lecture is - "Subscribers boht jaroori hai😅❤❤" love you sir

@LordSarcasticVlogger

5 ай бұрын

THANK YOU ADARSH ..LOVE U 2

@strawberryrafi4662

3 ай бұрын

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."

@vanshrajkudesia

Жыл бұрын

True

@Niteshmaurya1234

Жыл бұрын

yess

@CLGBOY

Жыл бұрын

Fatrue

@monalishasahoo2941

11 ай бұрын

Yes yes

@pritamkumari8547

9 ай бұрын

Yesss..he has made mistake at this point

A big salute to you sir....hats off sir....your way of teaching is incredible.

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

All your videos provide a wonderful content 😇

sort and sweet .. very best video for BFS & DFS... thx..

I have been watching your videos since last week.

Wonderful content sir 😍😍, really helpful for quick remembrance

sir can you please also include topics in your DAA playlist like segment tree,red black tree,skip list etc

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.

@rohitsen7718

7 ай бұрын

Yes you're correct, I was also wondering why I cant agree with him 😂

I just want to thank this channel which helped me a lot in my selection as TGT CS in DSSSB ... Thanku sir.. 🙏

@NakaruHikamuraOP

Жыл бұрын

Congrats

Excellent explanation sir. Thank you

Awesome lecture sir....🙏🙏

Thanku sir Full course done

Finally I finished the playlist sir. Thank you

Hey, you are doing a great job.

Thank you Soo much sir ,ap bht acha smjaty ha ,concept clear ho jaty ha sary🌸🌸

Every tree is a graph, but not every graph is a tree.

SIR please complete your DAA playlist with the topics like RED-BLACK TREE, B-TREE,TRIES,SKIP LIST, FIBONACCI HEAPS ,ET-CETERA

@sprite8344

9 ай бұрын

Lmao stfu go listen while your teacher is explaining in class cringe 🤣🤣🤣

Totally loved it maan❤

After 19 yrs Sir make me clear the concept.. Thanks sir

00:02 Graph Traversal Methods 01:48 BFS follows all the levels one by one and DFS goes towards depth 03:22 BFS is a breadth-first search algorithm that explores nodes level by level. 04:39 BFS traversal explores nodes in a breadth-first manner. 05:56 BFS traversal works level by level. 07:18 Exploring the options and backtracking 08:36 Backtracking from 5 to 4 and then finding options 09:55 Depth-First Search (DFS) and Breadth-First Search (BFS) have the same time complexity

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 ❣️❣️❣️❣️

i will pass my wxams bcz of u thanks

I ALWAYS SUBSCRIBE very good purpose youtube channel ... like you

Amazing Explaination sir!!

Thank you so much

You are just superb

Thank you so much sir😊

Nice video sir !!

u r awesome guru. Love u

Perfectly Explained..

Sir you are great

Thank you ❣️ sir

You are Great sir

Sir Every tree is a graph but every graph may or may not be tree.

Thanku so much sir 😊

kalyug ko uski charamsima pe pohchane ka waqt aa gaya he sir..isliye ye sikh raha hoon...ASUR

very nicely explained

Thanks sir 😊

Great🔥

Well explained Sir you are the best

I subscibed .... your way of teaching is such that no professor can explain

awesome Example

Thank you so much sir 🙏❤️

Thanks sir

thanks a lot sir......

You are the great teacher my university teacher is nothing infront of u guruji🙏

The teacher that we all wanted but don't deserved♥️♥️

thanks😇

Thank you sir 🥰

Main kahani ye hai ki devices multiple hai but email ek hi hai! 😄Thanks a lot!

@golpokotha4228

2 ай бұрын

Thanks crystal clear🎉🎉🎉❤

You are teaching on White board is really nice , i thing this little bit .....

Wow amazing 😌😌

Well explained within time... thanks sir

Bloody sweet sirr🎉❤

kmall sir level great teaching method

Sir you are great thank you soo muchhh❤

Amazing

thanks sir

Became your fan🔥🔥❤️

honest reaction- "Dil khush kar ditta!"

awesome sir

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😊

@GateSmashers

3 ай бұрын

Congratulations

Love you Sir

The correct statement is: "Every tree is a graph, but not every graph is a tree". you mentioned it wrong in this video

Excellent ❤❤❤❤

really you are great sir

Thanks anna

❤❤thank you

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.

@divyam5935

Ай бұрын

no u r correct, i was about to comment the same 👍

Sir which book to refer to practice problems on graphs, AVL trees , etc in a easy way.

kamal ha sir ji lub u

Too good👍

great

Thank u

Life saviour

Here before 1 hr exam

@AryanKumarBaghel-cp1jv

2 ай бұрын

How was your exam?

@creativecode5693

28 күн бұрын

Bca 😂

@cherish_till_you_get_perish

27 күн бұрын

@@AryanKumarBaghel-cp1jv got 70 for 100🤣

@gamerwhale295

10 күн бұрын

same

thanks

Thanks sir respect from pakistan ❤❤❤❤❤❤

Thank you sir Allah ap ko ilm ata Kara mazeed

Thanks sir ✨️

Thanks 🙂

Thankyou sir ❤

Love u man❤

Please complete daa syllabus before January

0:56 according to me there is statement like Every Tree is graph but not all graph is tree

@Natural.168

Жыл бұрын

yes it’s correct

Wow !! Wonderful explanation ♡

just wanted to let you know that ,youre videos are getting suggested by the faculty of our university for better understanding!

Love you Sir from abbottabad kpk Pakistan 😍❤️❤️❤️

Super explanation sir... Great teacher

i have exam in two days your videos are helping me a lot by saving my time love you brother

@mddilshadansari_0792

Жыл бұрын

kaisa gya exam bhai

@hackcodesfree9200

Жыл бұрын

@@mddilshadansari_0792 50/60

@novagames5719

Жыл бұрын

​@@hackcodesfree9200 which University give results in one month bro

helpful