Computer  Science 826
                         Quiz 9           Name _______________________

1. What transport is used by the RIP protocol?

   a. ICMP                        b. IP with a special protocol #

   c. TCP                         d. UDP

2. What transport is used by the OSPF protocol?

   a. ICMP                        b. IP with a special protocol #

   c. TCP                         d. UDP

3. Routing updates generated by a RIP router propogate: (we are talking
   about the actual packets themselves -- not indirectly derived information)

   a. Only to directly attached   b. Across the full AS
      neighbors.

   c. Across the entire internet.

4. Routing updates generated by an OSPF router propogate: (we are talking
   about the actual packets themselves -- not indirectly derived information)

   a. Only to directly attached   b. Across the full AS
      neighbors.

   c. Across the entire internet.

5. The number of entries in a RIP update generated by a Clemson
   router is closest to:

   a. the number of directly      b. the number of hosts on the
      attached neighbors of          subnet served by the router
      the router.

   c. the number of networks      d. the number of subnetworks at
      in the Internet                Clemson

6. The number of entries in a OSPF Link state update generated
   by an OSPF router is closest to:

   a. the number of directly      b. the number of hosts on the
      attached neighbors of          subnet served by the router
      the router.

   c. the number of networks      d. the number of subnetworks at
      in the Internet                Clemson

7. Consider the network shown below. Suppose that the link
   connecting A and B has just failed and that RIP WITHOUT split
   horizon or poisoned reverse is being used... Fill in the
   routing table entries for node A  as they will appear AFTER
   the next three exchanges.

   A ----- B ----- C ----- D ----- E
          1-A     2-B     3-C     4-D





8. The use of split horizon with poisoned reverse completely
   eliminates the counting to infinity problem if and only
   if the connectivity graph is: (Hint: the answer is two
   words and one of them is "a")



9. In the cost matrix used to create OSPF routing tables the
   row and column indices are:

   a. IP network addresses             b. AS numbers

   c. Router ids                       d. Link state ID's

10. In a RIP network a router will INCREASE the cost to a given
    destination:

   a. whenever it receives an          b. when it receives a higher
      update containing a higher          cost update from the router
      cost than the current               which is the current via
      cost.

   c. Only when it detects the         d. NEVER.
      current via no longer
      operational

11. An OSPF advertisement whose  link-state ID is that of a network
    carries link ID's of

    a. directly attached networks        b. directly attached OSPF routers

    c. directly or indirectly attached
      networks or routers.

12. Given the following cost matrix draw the routing tree rooted
    at node "C".

               To
           A  B  C  D  E
    F   A     5  2
    r   B  3        1  2
    o   C  8           1
    m   D     6
        E     4  3