Computer Science 360
                                 Quiz  N             Name___________________

1. Let N = number of nodes in a network and M = the average number
   of links / node.


   a. In terms of computational complexity the OSPF algorithm as performed
      by a single node is of order:

       1. M      2. N      3. N ^ 2    4. M ^ 2    5. N ^ M

   b. The minimum number of routing packets transmissions at each complete
      exchange in an OSPF network within the entire network is of order:

       1. M      2. N      3. N ^ 2    4. M ^ 2    5. N * M

2. Each individual routing update packet propagates

   a. Across the entire net in OSPF    b. Only to adjacent neighbors in OSPF
      and in distance vector              and distance vector

   c. Across entire net in OSPF but    d. Across entire net in distance vector
      only to adjacent neighbors inF      but only to adjacent neighbors
      distance vector                     in OSPF.


3. The routing algorithm used to transmit routing updates in an OSPF
   network is typically:

   a. Static tables built by          b. random routing
      sysadmin

   c. distance vector                 d. Flooding


4. Suppose the distance vector routing algorithm is being used and station
   B receives the following routing updates from neighbors A, C and E
   Suppose BA delay = 2, BC delay = 4 and BE delay = 3.
   Complete the routing table for B.,

      A  C  E      Cost VIA
   A  0  9  6          |
   ------------   ----------
   B  5 11  7       0  |  B
   ------------   ----------
   C  2  0  3          |
   ------------   ----------
   D  8  5  2          |
   ------------   ----------
   E  6  8  0          |
   ------------   ----------
   F 11  2  7          |
   ------------   ----------