Challenge 02

Issued:

28 April 2002

Details:

The interconnection of routers (R) gives the following (where there is also a route between A and H, H and C, and H and E, which are hidden on the diagram):

So let's have a challenge...

CHALLENGE...

Determine the number of possible routes (without retracing an existing route) to go from the router at A to the router at D.

and another challenge...

CHALLENGE...

Which routes would RIP use if going from A to D?

and another challenge...

CHALLENGE...

If the router at F was to fail, how many routes are now possible?

Design | SFC | NOS | Code | Diary | WWW | Essay | Cisco | [Old]