0
0
Computer Networksknowledge~10 mins

Distance vector routing (RIP) in Computer Networks - Interactive Code Practice

Choose your learning style9 modes available
Practice - 5 Tasks
Answer the questions below
1fill in blank
easy

Complete the sentence to describe the main metric used by RIP.

Computer Networks
RIP uses [1] as the metric to determine the best path to a destination.
Drag options to blanks, or click blank then click option'
Abandwidth
Bhop count
Cdelay
Dpacket loss
Attempts:
3 left
💡 Hint
Common Mistakes
Confusing hop count with bandwidth or delay.
Thinking RIP uses complex metrics like packet loss.
2fill in blank
medium

Complete the sentence to explain how often RIP routers send updates.

Computer Networks
RIP routers send their routing updates every [1] seconds to share their routing tables.
Drag options to blanks, or click blank then click option'
A10
B60
C30
D120
Attempts:
3 left
💡 Hint
Common Mistakes
Choosing 10 seconds, which is too frequent.
Choosing 60 or 120 seconds, which are longer intervals.
3fill in blank
hard

Fix the error in the statement about RIP's maximum hop count.

Computer Networks
The maximum hop count allowed in RIP is [1]; any route with a higher count is considered unreachable.
Drag options to blanks, or click blank then click option'
A15
B10
C16
D20
Attempts:
3 left
💡 Hint
Common Mistakes
Choosing 16 as the maximum hop count instead of 15.
Confusing the unreachable value with the maximum valid hop count.
4fill in blank
hard

Fill both blanks to complete the description of RIP's routing update method.

Computer Networks
RIP uses [1] routing and sends updates to [2] addresses.
Drag options to blanks, or click blank then click option'
Adistance vector
Blink state
Cbroadcast
Dmulticast
Attempts:
3 left
💡 Hint
Common Mistakes
Confusing distance vector with link state.
Thinking RIP uses broadcast instead of multicast.
5fill in blank
hard

Fill all three blanks to complete the RIP route update rule.

Computer Networks
A router updates its routing table if it receives a route with a [1] hop count, the route is [2] than the current one, and the route comes from a [3] neighbor.
Drag options to blanks, or click blank then click option'
Alower
Bhigher
Cbetter
Ddirect
Attempts:
3 left
💡 Hint
Common Mistakes
Choosing 'higher' hop count instead of 'lower'.
Confusing 'better' with 'higher'.
Not recognizing that routes must come from direct neighbors.