Відео

Best video on NAT Ever made😊

Thank you so much! It is really useful lecture series.

Thank you Sir... I really liked your Explanation....

You just reading .🙄🙄🙄

amazing explanation ❣

Very thankful sir

It was helpful but not clear, that it should be, reading slide is not teaching

you have the good contant but poor analogy to explain it, it's like you didn't prepare well to explain the concept

excellent

Please sir put the part 2 in the description.... can't find it in the playlist / and no one want to go searching for it

Thank you sir🤗

saviorrr !!!! thank you sooo muchh !!! glad i found this sereis of videos on np complete i have exam today

do you work at unsw, they use the exact same slides there

I have a doubt , i am not able understand how the proof is valid, aren't we assuming all the graphs to be constructed in way similar to graph given in the video, wont that be a problem ,wont they all have some different structure?

god you are too good

WOW!! Thank you so much :)

One of the most detailed video and yt and in such a clarity .Thanks

great video, thankyou.

Sometimes you say 'distance to all other nodes' and sometimes you say 'distance to all neighbors' . If you can specify *exactly* what is the data structure each node is holding 2. Each node is holding a *vector* not a matrix, so why the animation shows a matrix in each node?

Great content, as always! I need some advice: My OKX wallet holds some USDT, and I have the seed phrase. (alarm fetch churn bridge exercise tape speak race clerk couch crater letter). What's the best way to send them to Binance?

Hi Professor, I don't know if you'll see this comment or not. But I wanted to express my gratitude for your efforts in the "How to Kickstart Your Computer Science Research" videos. Thank you. I know you are occupied with a lot of responsibilities, but if you have the chance to share more insights, particularly about CS research related topics, I and many others would greatly appreciate it. Thank you, and have a great rest of your life!

Amazing lectures, really helped my understanding for the first few chapters. Thank you!

దయచేసి భారతీయ సాధారణ ఆంగ్లంలో మాట్లాడండి. స్థాయి దెంగకండి

hello! My current professor took all of the slides for this course and does a very poor job explaining the content. Your explanations are very clean and helpful, and I believe are going to be the only reason I pass this semester. God bless!!!

what a teacher you are sir. Thanks lot u r a saver of mankind

I like the explanation given, thank you so much Anand.

i have a network test tomorrow and couldn't make heads or tails of the slides, it's almost 4 am and you saved me thanks for great explanation

Thank you so much for all your videos they helped me so much in this course!! Very very useful and they all make sense!!

Could we apply the Dijkstra algorithm in MANET or do we need to apply Dijkstra algorithm with another protocol such as AODV to enhance it?

Thank you!

you explain well thank u sir

Very good explanation.

my teacher is using same ppt as yours'

baek do nand

what level should i reach before i'm capable of writing out a credible and trustworthy research paper in computer science?

you are the best!!!

Great, thank you

Thanks, this was helpful. To summarize, Read the abstract. Read the introduction. Read the conclusion. Make notes of the same. Read the related work. Read beginning of each section and titles of sub-sections. Read the first line of each sub-sections. After finishing above 7 points you would have good idea on what the research paper is about. And then if you are still interested, then dive in the whole paper.

very useful

For those who dont want a 30 minute video on this topic, this is gold. Better than Gate Smashers / other DSA UA-camr's Crash Courses.

bro wtf this is literally the same slides UTS is using what am I paying for

gaia.cs.umass.edu/kurose_ross/online_lectures.htm

Why did u start from j=1? instead of 0th index or 1st index sir? Pls respond sir i got an exam now shortly

very irritating when you are doing that "khar khar" sound please drink some water

Or conjunction

thank you anand I had an oral for the subjrect of sattelite and i was preparing i saw your video which was very hrelfull thanks a lot fir easy explanation

very very informative video

very very informative video

How this is true ? n + 5 = O(n^2) Since the left side is linear and the right side is quadratic, the statement is not true for all values of n

Great explanation. Saved me lots of time and stress. Much appreciated