CECS 406 Network Engineering Quiz 4, Quizzes of Computer Science

A network engineering quiz from cecs 406 university course, held on april 4, 2001. The quiz includes identifying terms related to networking, understanding the bridge algorithm, and recognizing protocol problems and their solutions.

Typology: Quizzes

Pre 2010

Uploaded on 08/18/2009

koofers-user-7um-1
koofers-user-7um-1 🇺🇸

5

(1)

9 documents

1 / 2

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Name __________________________
QUIZ 4
CECS 406 Network Engineering
Wednesday, April 4, 2001
1. (2 points each) Identify each of the following terms with the phrase that most fully describes it.
Each phrase should be used only once.
____ repeater A. An individual LAN.
____ optical fiber B. Propagates each incoming signal to all connections.
____ switch C. Allows multiple stations to share one network
connection; predates hubs.
____ stacking D. Does not forward noise or collisions.
____ hub E. Bridging technique that can span an arbitrary distance.
____ LAN segment F. Physically similar to a hub, but logically similar to a
bridge.
____ connection multiplexing G. Copies a signal from one LAN to another LAN.
____ satellite bridging H. Has low delay and high bandwidth.
____ bridge I. Always superior to copper cable.
____ switch J. Always has some distance limitation.
K. Daisy chaining hubs.
L. Connecting multiple segments using repeaters.
2. (1 point for each event) Given the following illustration of a bridge:
A B C X Y Z
B
Segment 1
Segment 2
Fill in the blanks in the table below, using the rules of the Bridge Algorithm.
Event Segment 1 List Segment 2 list
Bridge boots -- --
Y sends to A
Z sends to B
B sends to C
C sends to Y
3. (2 points each) Identify each of the following terms with the phrase that most fully describes it.
Each phrase should be used only once.
Dr. Tracy Bradley Maples (Spring 2001)
1
pf2

Partial preview of the text

Download CECS 406 Network Engineering Quiz 4 and more Quizzes Computer Science in PDF only on Docsity!

Name __________________________

QUIZ 4

CECS 406 Network Engineering

Wednesday, April 4, 2001

1. (2 points each) Identify each of the following terms with the phrase that most fully describes it. Each phrase should be used only once. ____ repeater A. An individual LAN. ____ optical fiber B. Propagates each incoming signal to all connections. ____ switch C. Allows multiple stations to share one network connection; predates hubs. ____ stacking D. Does not forward noise or collisions. ____ hub E. Bridging technique that can span an arbitrary distance. ____ LAN segment F. Physically similar to a hub, but logically similar to a bridge. ____ connection multiplexing G. Copies a signal from one LAN to another LAN. ____ satellite bridging H. Has low delay and high bandwidth. ____ bridge I. Always superior to copper cable. ____ switch J. Always has some distance limitation. K. Daisy chaining hubs. L. Connecting multiple segments using repeaters. 2. (1 point for each event) Given the following illustration of a bridge:

AB C YZ

B

Segment 1 Segment 2

Fill in the blanks in the table below, using the rules of the Bridge Algorithm. Event Segment 1 List Segment 2 list Bridge boots -- -- Y sends to A Z sends to B B sends to C C sends to Y

3. (2 points each) Identify each of the following terms with the phrase that most fully describes it. Each phrase should be used only once. 1 Dr. Tracy Bradley Maples (Spring 2001)

Name __________________________ ____ protocol A. Handles packet forwarding. ____ protocol layer B. Not a real working protocol stack, only conceptual. ____ data encapsulation C. An agreement about how communication should take place. ____ network layer D. Adding a header to each outgoing packet. ____ physical layer E. Layer N at the destination sees exactly what layer N at the source sent. ____ OSI 7 layer model F. Handles login and passwords. ____ session layer G. Dedicated to solving one subproblem. ____ layering principle H. A protocol suite. I. The underlying hardware. J. Individual application programs.

4. (2 points each) Match each of the following protocol problems with one possible way to solve it. You may use the solutions more than once. ____ bit corruption A. Positive acknowledgements and retransmission. ____ packet duplication B. Unique message ID. ____ lost packets C. Sequence numbers. ____ excessive delay D. Checksum. ____ out-of-order delivery E. Flow control. ____ data overrun

5. (2 points) The Stop-and-Go protocol is one possible flow control solution. True

or False

6. (2 points) Using the Sliding Window protocol, throughput is not limited by hardware bandwidth. True or **False

  1. (2 points)** In the Sliding Window protocol, the window size limits how many packets the receiver is able to accept. True or **False
  2. (2 points)** Congestion is usually caused by hardware failure. True or False 2 Dr. Tracy Bradley Maples (Spring 2001)