UNI CS 3470, Section 1 (Fall 2014)
Networking
Homework 5 (due 10/13/2014 in class)
Instructor
Sarah Diesburg (diesburg@cs.uni.edu)
Office: 311 ITTC
Office hours: MWF 11:00-noon, 2:00-3:00pm, and by appointments
________________________________________________________________________
Please answer the following Chapter 3 exercise questions from your textbook (2 pts
each): 4, 5, 15.
(Hint: Question 4 is asking about datagram forwarding from Section 3.1.1. Specifically,
you’ll need to construct forwarding tables like Table 3.1 in the text.)
In addition, please answer the following extra questions.
E1) Given the extended LAN shown below, indicate which ports are not selected by the
spanning tree algorithm (2 pts).
E2) What are the differences between repeaters (hubs) and bridges (1 pt)?
E3) Suppose some repeaters (hubs), rather than bridges, are connected into a loop.
a) What will happen when a node transmits (1/2 pt)?
b) Why would the spanning tree mechanism be difficult or impossible to
implement for repeaters (1/2 pt)?
The exercises are due on 10/13/2014 in class, stapled, and readable with your name on
the front page.