Shortest Path routing algorithm | Data Communication | Lec-22 | bhanu priya

preview_player
Показать описание
Data Communication
Shortest path routing algorithm in network layer

Class Notes ( pdf )

Complete DATA COMMUNICATION Course Playlist
Рекомендации по теме
Комментарии
Автор

The way of your teaching is really acclaimable. I thank you for helping us, individually I can say I have been helped by your videos.
And one thing for others who are doing comments..
If you can not understand any part, mention it. But never post such stupid comments as "your English is bad", or "you are teaching wrongly" like a donkey. Understand 😎😎

BHARATIYA...
Автор

Best explaination, thanks God bless ❣️

goodnessawe
Автор

At last node we have to write D(10, H) not D(10, F)

pampamsingh
Автор

My staff are following u and me too following u, u r a teacher for teachers😃

animationinworld
Автор

Good mam very well explained This video is very helpful for solving many examples Tq very much mam🙏🙏🙏🙏

shaikhibza
Автор

Mam can u explain link state routing algorithm with an example

grandhipranathi
Автор

Madam i have a doubt in step 10, F is permanent so that the value for C should be (9, F) know it is not (9, B) right?

shilkababu
Автор

For D node, It should be (10, H) not 10, F. Here H or says says the predecessor node. How F is predecessor to D????

anjaneyulu
Автор

Respectfully sorry to say u r cofusing while teaching bcz u r not cleared to explain it properly, so when we are watching videos so we r not wasting vaueble times to learn confusion and wrong concepts, pls make sure to clarify the subject properly, thank u .

sagarkumarsahoo
Автор

When we already make a shortest path from a-b-e-g then how can you change it to a-b-e-f and in the last I am totally confused 😕

harishghasolia
Автор

Basic concept:- Jja kasi bhi node pee hoo check karo kii koi dusra node non-premanent node kam value ka to nehi hay if yes-
1) then usko parmanent karo.
In no-
2)then permanent the node at which you are there

technicalspecial
Автор

Mam, destination node Di ki value 10, f ) kase Aai ( 10, e ) chaheye n

sscmasterbyakshitanandanwa
Автор

Good but inka clarity ga chepte bagutundi

modalagovindammamodalagovi
Автор

Is this suitable for ques. Explain about optimality principle with respect to shortest path algorith

shailajabattu
Автор

mam..i think u say wrong..at last D(10, H)

kyt
Автор

Omg you got confused, dew to this it becomes a confusing a new

smarthgaind
Автор

It makes us confusion ...first the cost of g is 6, a and going the half of the explanation it becomes as 5 it changes 6 to 5

gopikanair
Автор

Medam can you provide PDF of your lectures

satyakrish
Автор

the routing path taken is correct but your explanations are quite confusing.

emmanayoemmanuel
Автор

Very well explained, I understood the concept 😍😍😍😍

koyavasudhalakshmi
join shbcf.ru