The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
15 views

http://ledr.luon.net/documents/2IC10/bas_mark/week1.pdf

in the exercise 9 of the pdf ...how did they calculated path length i+j-2 ...and moreover it if possible please derive it in easy way with explanation.....

asked ago in Computer Networks by Active (2.7k points) | 15 views
0

they mention that i means a node in level i and j means a node in level j and root node is at level 1

every time i wants to communicate j ===> i to root and root to j

distance between i to root ---> maximum edges btw them ===> i-1 

distance between root to j ===> j-1 

i wants to communicate j ==> (i-1)+(j-1) = i+j-2

1 Answer

0 votes

..............

answered ago by Boss (19.1k points)


Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

36,995 questions
44,571 answers
126,782 comments
43,637 users