Content Frame
Note for screen reader users: There is text between the form elements on this page. To be sure that you do not miss any text, use item by item navigation methods, rather than tabbing from form element to form element.
Skip Breadcrumb Navigation
Home  arrow Student Resources  arrow Self-Assessment Quizzes  arrow Chapter 4 MC

Chapter 4 MC



This activity contains 12 questions.

Question 1.
The link-state algorithm in Section 4.5 has the following properties:

 
End of Question 1


Question 2.
Suppose that c(E,F) = 6 instead of 2 in Figure 4.27. Then the link state algorithm finds the shortest path to F in

 
End of Question 2


Question 3.
In routing among ASs, which of the following issues dominants:

 
End of Question 3


Question 4.
Suppose an application generates chunks of 60 bytes of data every second, and each chunk gets encapsulated in a TCP segment and then an IP datagram. What percentage of each datagram will contain application data.

 
End of Question 4


Question 5.
Consider sending a 1300 byte datagram into a link that has an MTU of 500 bytes.

 
End of Question 5


Question 6.
The ICMP protocol

 
End of Question 6


Question 7.
In a router, queuing can occur

 
End of Question 7


Question 8.
In a high-performance router, shadow copies of the routing table are kept in

 
End of Question 8


Question 9.

Suppose a router has n input ports each with identical line speeds, n output ports each with identical line speeds, and the line speed of an output port is at least n times as that of an input port. Further suppose that the switching fabric speed is at least n times as fast as an input line speed. Then
 
End of Question 9


Question 10.
Suppose one IPv6 router wants to send a datagram to another IPv6 router, but are connected together by intervening IPv4 routers. If the two routers use tunneling, then

 
End of Question 10


Question 11.
IPsec can provide:

 
End of Question 11


Question 12.
As part of hierarchical routing, hot-potato routing does the following:

 
End of Question 12





Pearson Copyright © 1995 - 2010 Pearson Education . All rights reserved. Pearson Addison Wesley is an imprint of Pearson .
Legal Notice | Privacy Policy | Permissions

Return to the Top of this Page