You are a great teacher. Your lectures helped me since 3 semesters and I am happy that you have already made the DBMS playlist which I'm gonna study in the next semester. Your way of teaching is perfect.
Varun sir I am really really impressed with all your videos i have watched all your DBMS videos as i am preparing for Gate. Just want to say your videos are extremely good i have just gone through all your videos and able to solve last 25years questions easily :) Thank you so much for this. pls never stop publishing videos there are very very helpful for many students those who cannot afford huge fee of coaching centers. Thanks once again.
sometimes we are loving the teacher because of grades or thier personality but true love is that you are loving your teacher because of thier teaching style or way to deliver the lecture and i love varun sir big fan from pakistan you are our real teacher
Dear Varun Sir, your teaching style makes the subject looks very simple. All the best, we need more and more teachers like you. Pl. keep doing the good work of uploading the lectures on subjects which are close to your heart. Your lectures are removing the tag of boring subjects as you are making them interesting and simple. Once the two things are delivered, your teaching has served the purpose.
Suuuupeerrrrrrrr explanation I have ever seen......I didnt even rewind atleast once for not understanding the topic.......It is that smooth in explanation......
Whenever i have difficulty in any topic or in any subject ... I search that topic name and by gate smashers .... Bcz i know that only this channel can help me to understand the difficult topics easily.. Thank you Sir ! ❣️
Sir, you should complete the whole concept of Distance vector routing protocol with its problems like "count to infinity problem", so that we can link the whole concept in one video ..... thank u so much for this effort....
Seriously best ever explination on distance vector routing algorithm....I was really in need of this video so thank you Soooooo much ....once again thanks
Thank you sir for such a wonderful explanation of the whole topic 😍👍🙏 understood the methodology of distance vector routing in just few minutes 😊 thanks a lot
Great work varun Sir.. Really impressed your way of teaching. You really work the best for students in free of cost. Because I know some students due to cost, they lack the best teachers like you. Appreciate your work Sir. God bless you so much as always Sir.
Hello Sir, actually I was taught the same topic by my professor Rajesh (teaches very bad) even tho i tried to listen to him, he kept on humiliating me for not understanding, he made the topic very threatening but it was so easy coz of u.
I think that this yr NET exam will be difficult for me bcoz my preparation started very lately. But surely i can crack the next yr exam just bcoz of u.
Incredible playlist, thank you so much, it has made all the concepts clear. This is the only thing that really confuses me, if you are saying each router only shares the distance vectors, then how does the router know which vector belongs to which router? It must also pass which vector belongs to which router? If N2 only passes its vectors to N1 for example, How does N1 know cost 3 belongs to N5? Also, is it possible
Aahh thank god you got a video on this topic. This whole algorithm thingie is turning me crazy. I search for a topic on UA-cam and if I don't see your video on that, then I know I ain't no getting no marks in that topic if it comes in the exam.. Badhiya video bro.. Har bar ke tarah.. thanks mate..
00:00 Distance Vector Routing 03:54 Routing table for nodes N1, N2, N3, N4, and N5 06:54 Share only distance vector with neighbours 10:11 Formation of new routing table for N1 with distance vectors 13:28 Routing table update example 16:48 To go from N5 to N1, there are two paths through N2 and N4 with a cost of four. 20:05 Two methods to go from N5 to N3 with different costs 22:57 Distance vector routing updates routing tables after 3-4 passes. Crafted by Merlin AI.
Oh tbw I forgot to tell this psyschopath teacher Rajesh Kumar teaches in VIT chennai Computer Network AB1-7TH FLOOR FIRST CABIN TO THE RIGHT. Help of Hitman are aprreciated
Siraaaa Veer..... Boht wadiyaa samjayaa Sir..!! Just One request Sir Mera Exam Hai agr aap aik week mein ATM kerwaa den to bOht Shukar Guzaar hun ga Apka...!! Love from Pak ..!!
The video was awesome, BTW ... I would like to point out the similarity of this algorithm with Bellman Ford. Yaha pe n-1 iterations karne se shortest path to all nodes mil jayega, where n is the number of edges
Sir , 4 weeks ago I requested you for Link State Routing Video.. I would like to request you once again.. Please Sir.. Thora sa time nikal ke please iss topic me video Banna dijiye.. My humble request.. Regards Purobi..
00:00 Distance Vector Routing 03:54 Routing table for nodes N1, N2, N3, N4, and N5 06:54 Share only distance vector with neighbours 10:11 Formation of new routing table for N1 with distance vectors 13:28 Routing table update example 16:48 To go from N5 to N1, there are two paths through N2 and N4 with a cost of four. 20:05 Two methods to go from N5 to N3 with different costs 22:57 Distance vector routing updates routing tables after 3-4 passes.
All videos are Awesome sir , jitni tarif karu sir kam hi hogi. Sir cisco packet traser me use hone vale router,switches,cable ke baare me batao sir. Practically samjana is little bit difficult ho raha h.
Sir.. I am totally impressed with the way you explain every topic..It's my humble request Kindly please upload a video on Link State Routing as soon as possible.. Waiting for a response..
Sir.. Your networking concept are fabulous.. I would surely share this with all my friends.. May God bless you millions of subscriber and every one would just eagerly expect for your upcoming video as I do....
16:02 , mein I think ek mistake hua, next mein bas konse router pe jaiga wahi info honi chahiye. So N1 se next mein N2 hi aayega. Also great video, bhai!
only dist vector( array) to be shared with the neighbors. Next is to update the routing table. n1, n2 n3 n4 n5 makes their new routing table. N1 to n2 : n1-n2 and n2 - n2 cost
Is there any other shortcut? Finding these many tables is hectic task and time consuming in GATE. They ask questions like "After how many passes the routing table will be stabilized?"
even though we are from telugu states we all are subscribing u r channel l,, that much contect presents in u videos, try to post videos in English I think it would be helpful for every one
You are a great teacher. Your lectures helped me since 3 semesters and I am happy that you have already made the DBMS playlist which I'm gonna study in the next semester. Your way of teaching is perfect.
I am myself a lecturer and I watch you to improve my skills
Thanks for the work you are doing
sir please don't be like typical "sarkari teacher guy" u will get lots of love from students
Varun sir I am really really impressed with all your videos i have watched all your DBMS videos as i am preparing for Gate. Just want to say your videos are extremely good i have just gone through all your videos and able to solve last 25years questions easily :) Thank you so much for this. pls never stop publishing videos there are very very helpful for many students those who cannot afford huge fee of coaching centers.
Thanks once again.
Very good sir
How was your gate?
Are these videos sufficient?
@@sohamdeshpande1086 It was fine, these videos are very good but one must make sure that he has practiced all pyqs.
@@vipingautam1257 what was ur gate score bro
@@bellalmahtab8220 535 bro
sometimes we are loving the teacher because of grades or thier personality
but true love is that you are loving your teacher because of thier teaching style or way to deliver the lecture
and i love varun sir
big fan from pakistan
you are our real teacher
Dear Varun Sir, your teaching style makes the subject looks very simple. All the best, we need more and more teachers like you. Pl. keep doing the good work of uploading the lectures on subjects which are close to your heart. Your lectures are removing the tag of boring subjects as you are making them interesting and simple. Once the two things are delivered, your teaching has served the purpose.
Thank you for your lovely feedback..
Best computer network tutorials online, amazing , stay blessed, can't thankyou enough
Watching this vid. in incognito mode just to avoid history.but you made me to like it...Salute sir..
incognito mode: video will add in your account history buz u have logged in google account for commenting.
Very Clear Explanation, Logic of the Algorithm as well as the background processes in the Routing Network are perfectly depicted..
Sir, very easily explained..... thanks a lot sir you are the best Teacher for many CSE students 🔥💯
can't imagine anyone explain this better....your videos are always my go-to sir.
Suuuupeerrrrrrrr explanation I have ever seen......I didnt even rewind atleast once for not understanding the topic.......It is that smooth in explanation......
Thank you so much for your valuable feedback..
Whenever i have difficulty in any topic or in any subject ... I search that topic name and by gate smashers .... Bcz i know that only this channel can help me to understand the difficult topics easily..
Thank you Sir ! ❣️
sahi baat hai
Started watching this legend in 2019 for completing the syllabus of CoA/Dsl/ Ds. And now in 2021 watching for completing Computer networks.
You must go and check Amit khurana gate lectures on UA-cam you will know what you have learnt.
@@aasifrashidkhanday5613 is learnt word used in India English or learned word is good in indenglish
Sir, you should complete the whole concept of Distance vector routing protocol with its problems like "count to infinity problem", so that we can link the whole concept in one video .....
thank u so much for this effort....
Seriously best ever explination on distance vector routing algorithm....I was really in need of this video so thank you Soooooo much ....once again thanks
Thank you sir for such a wonderful explanation of the whole topic 😍👍🙏 understood the methodology of distance vector routing in just few minutes 😊 thanks a lot
Can’t thanks enough 🙏ur concepts r so clear n u explain in so much depth ..that too in simple manner .. no comparison with ur teaching 👏
thank you so much for teaching us almost all courses
Great work varun Sir.. Really impressed your way of teaching. You really work the best for students in free of cost. Because I know some students due to cost, they lack the best teachers like you. Appreciate your work Sir. God bless you so much as always Sir.
Hello Sir, actually I was taught the same topic by my professor Rajesh (teaches very bad) even tho i tried to listen to him, he kept on humiliating me for not understanding, he made the topic very threatening but it was so easy coz of u.
Our sir is too good 😊😊😊😊
Sir you're great. Thank you very much for such an awesome playlist
I think that this yr NET exam will be difficult for me bcoz my preparation started very lately. But surely i can crack the next yr exam just bcoz of u.
Your way of teaching is excellent thank you
Incredible playlist, thank you so much, it has made all the concepts clear. This is the only thing that really confuses me, if you are saying each router only shares the distance vectors, then how does the router know which vector belongs to which router?
It must also pass which vector belongs to which router?
If N2 only passes its vectors to N1 for example, How does N1 know cost 3 belongs to N5?
Also, is it possible
Very nice. Highly appreciated from Kathmandu Nepal too.
Aahh thank god you got a video on this topic. This whole algorithm thingie is turning me crazy. I search for a topic on UA-cam and if I don't see your video on that, then I know I ain't no getting no marks in that topic if it comes in the exam.. Badhiya video bro.. Har bar ke tarah.. thanks mate..
This is Bellman-Ford Algorithm, think it that way , it will be easier to understand.
More like Floyd Warshall Algorithm
Re ally?????
thanks :) it really helped
@@anushshand1443 nhi Floyd warshall me previous value dekhte hai
Yaa
I think I studied 4-5 subject from this channel only
great video sir, i got it in first go...your teaching is too good..thanks
we need more lecturers like you bhai
This is quite different as given in Forouzan/Tanenbaum of CN
Awesome Explanation. Perfectly done. This is my first video watch of yours. You mailed it...👍
loved the explanation sir thank you, made it easy to understand the concept.
you are an excellent teacher. kudos to you!
Please try to make videos on Link State Routing protocol and AS business relationship!
ua-cam.com/video/dINbkkxHY4U/v-deo.html
Sir your teaching mathod is very easier ❤️
00:00 Distance Vector Routing
03:54 Routing table for nodes N1, N2, N3, N4, and N5
06:54 Share only distance vector with neighbours
10:11 Formation of new routing table for N1 with distance vectors
13:28 Routing table update example
16:48 To go from N5 to N1, there are two paths through N2 and N4 with a cost of four.
20:05 Two methods to go from N5 to N3 with different costs
22:57 Distance vector routing updates routing tables after 3-4 passes.
Crafted by Merlin AI.
Oh tbw I forgot to tell this psyschopath teacher Rajesh Kumar teaches in VIT chennai Computer Network AB1-7TH FLOOR FIRST CABIN TO THE RIGHT. Help of Hitman are aprreciated
😂😂😂
ayooooo
Siraaaa Veer..... Boht wadiyaa samjayaa Sir..!! Just One request Sir Mera Exam Hai agr aap aik week mein ATM kerwaa den to bOht Shukar Guzaar hun ga Apka...!!
Love from Pak ..!!
All the best
Gate Smashers Thanx Sir for the best wishes ...!!
Will be very Thankul to U if U can post a Video on ATM ..!! Plzz Sir..!!
@@haseebbhatti8229 share the link of ATM VIDEO THANKS
Raat ke time baada Bhai samjha raha ho ❤ Love you bhaiya 😊
GATE hatao, ye banda college me courses pass krne ke liye bht important hai 😂 Thanks sir for your valuable contribution!
Better than reading 2 pages techknowledge bk theory thanks sir crsip and clean video !🤩🤩
Sir im really impressed with ur teaching.even im a telugu student .but i understood watever
U teach.my request is to upload link state sir.pls.
Gurujee shandar jabardast zindabaad
Ek no. Padate ho sir, you are an inspiration.
Sir thank you so much . your video's are very help full for me and I watch your all video's
Thank you sir for making such a good guide..
The video was awesome, BTW ... I would like to point out the similarity of this algorithm with Bellman Ford. Yaha pe n-1 iterations karne se shortest path to all nodes mil jayega, where n is the number of edges
Yup I was also thinking the same....it does resemble with bellman ford algo
And to some xtent with dijekters algo
You r a good teacher and I know u teach plsql very well.
Please sir
Varun sir aapka padaya hua bhot acche se smjh m aata h... kya aap dtp(desktop publishing) ko bhi detail m explain kr skte hn???? Plssss😊
Awesome explanation sir ....
Thanks for nice explanation....
Sir link state ke saath other algorithm bhi samjha dijiye. Accha explain karte h aap... Please...
Sir you are great teacher
Thank you so much sir
love from Pakistan
i am impressed by your teaching sir
I m Btech third year student , I don't understand lectures from class of college,but I got understand here ,
Smack that , get on the floor ...smack that too many chores ...smack that ...🎉
Sir , 4 weeks ago I requested you for Link State Routing Video.. I would like to request you once again.. Please Sir.. Thora sa time nikal ke please iss topic me video Banna dijiye.. My humble request.. Regards Purobi..
Hope you get well soon..My prayers are always with you..
Meanwhile feel free to check this amazing content ua-cam.com/video/dINbkkxHY4U/v-deo.html
Thanks
@@honestindianpeople na g na... Apny varun sir sabse best
yaar mai tera fan ban gya...........
Very good and easy to understand Sir.
Best video and best explanation
Nicely explain thanks 👍 very helpful ☺️
00:00 Distance Vector Routing
03:54 Routing table for nodes N1, N2, N3, N4, and N5
06:54 Share only distance vector with neighbours
10:11 Formation of new routing table for N1 with distance vectors
13:28 Routing table update example
16:48 To go from N5 to N1, there are two paths through N2 and N4 with a cost of four.
20:05 Two methods to go from N5 to N3 with different costs
22:57 Distance vector routing updates routing tables after 3-4 passes.
thankyou so much sir well explained.
All videos are Awesome sir , jitni tarif karu sir kam hi hogi.
Sir cisco packet traser me use hone vale router,switches,cable ke baare me batao sir.
Practically samjana is little bit difficult ho raha h.
Nice Explanation!!. Thank You !!
crystal clear explanation. hatsoff
chacha u r great ,thank you sir
Your explanation is best sir
Excellent explanation sir ❤
Sirji tussi great ho.
Sir, you never disappoint. 🙏🏼🙏🏼🙏🏼❤️
Sir.. I am totally impressed with the way you explain every topic..It's my humble request Kindly please upload a video on Link State Routing as soon as possible.. Waiting for a response..
Sure..thank you
Sir.. Your networking concept are fabulous.. I would surely share this with all my friends.. May God bless you millions of subscriber and every one would just eagerly expect for your upcoming video as I do....
@@GateSmashers sir link state kab ayyega?? kal mera exam hai
Your videos really helped me a lot. ❣️❣️
Ap bhut acha smjhty ho .........
very helpful before exams
16:02 , mein I think ek mistake hua, next mein bas konse router pe jaiga wahi info honi chahiye. So N1 se next mein N2 hi aayega. Also great video, bhai!
This video helps me a lot... Thanks 😊
You are amazing. Thank YOu
only dist vector( array) to be shared with the neighbors. Next is to update the routing table. n1, n2 n3 n4 n5 makes their new routing table. N1 to n2 : n1-n2 and n2 - n2 cost
I love your videos. You are doing a great job. I wish I can subscribe to your channel a million times. :)
16:00 Next will be N2, N5 instead of only N5.
Please Make Videos On All Routing Protocols.
Is there any other shortcut? Finding these many tables is hectic task and time consuming in GATE. They ask questions like "After how many passes the routing table will be stabilized?"
esi problem ko solve krne ke liye short trick bhi bta do sir compititive exams k liye....
😭😭😭 thank you so much sir you are just best
Thankyou for easy explanation
even though we are from telugu states we all are subscribing u r channel l,, that much contect presents in u videos, try to post videos in English I think it would be helpful for every one
Sir plz make video on Dijkstra theorem as soon as possible..
Superb sir g thank you
Great teaching
The word ThanK you is not enough for u♥️
I've exam in an hour
best explianation😀
Sir Thankyou so much for you videos...sir plz upload on TCP IP programming, socket programming..networking with linux plz sir
very clearly explained 👌
Best explaination
thanks sir g for your efforts
Sir how could u teach so perfect whereas my college professor are .. u know right
Great explanation thanks 😄
Thank you!!
Sir, please upload the other routing protocol also...from gate point of view it is really important topic..sir please upload as soon as possible
ua-cam.com/video/dINbkkxHY4U/v-deo.html