-- Practice Midterm Problems (Problem 9)
Originally Posted By: eaon168
So for problem 9, each message has 3 columns: sender ID, root ID, distance to the root
Round 1:
node 1: 1, 1, 0
node 2: 2, 2, 0
node 3: 3, 3, 0
node 4: 4, 4, 0
node 5: 5, 5, 0
node 6: 6, 6, 0
Round 2:
node 1: 1, 1, 0
node 2: 2, 1, 1
node 3: 3, 2, 1
node 4: 4, 3, 1
node 5: 5, 4, 1
node 6: 6, 1, 1
Round 3:
node 1: 1, 1, 0
node 2: 2, 1, 1
node 3: 3, 1, 2
node 4: 4, 2, 2
node 5: 5, 1, 2
node 6: 6, 1, 1
Round 4:
node 1: 1, 1, 0
node 2: 2, 1, 1
node 3: 3, 1, 2
node 4: 4, 1, 3
node 5: 5, 1, 2
node 6: 6, 1, 1
The resulting tree will look as follow(should look like a ring with the edge between 4 and 5 removed):
1--2--3--4
|
6
|
5
'''Originally Posted By: eaon168'''
So for problem 9, each message has 3 columns: sender ID, root ID, distance to the root<br><br>Round 1:<br>node 1: 1, 1, 0<br>node 2: 2, 2, 0<br>node 3: 3, 3, 0<br>node 4: 4, 4, 0<br>node 5: 5, 5, 0<br>node 6: 6, 6, 0<br><br>Round 2:<br>node 1: 1, 1, 0<br>node 2: 2, 1, 1<br>node 3: 3, 2, 1<br>node 4: 4, 3, 1<br>node 5: 5, 4, 1<br>node 6: 6, 1, 1<br><br>Round 3:<br>node 1: 1, 1, 0<br>node 2: 2, 1, 1<br>node 3: 3, 1, 2<br>node 4: 4, 2, 2<br>node 5: 5, 1, 2<br>node 6: 6, 1, 1<br><br>Round 4:<br>node 1: 1, 1, 0<br>node 2: 2, 1, 1<br>node 3: 3, 1, 2<br>node 4: 4, 1, 3<br>node 5: 5, 1, 2<br>node 6: 6, 1, 1<br><br><br>The resulting tree will look as follow(should look like a ring with the edge between 4 and 5 removed):<br><br>1--2--3--4<br>|<br>6<br>|<br>5