

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
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
1 / 2
This page cannot be seen from the preview
Don't miss anything!


Name __________________________
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:
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
or False
6. (2 points) Using the Sliding Window protocol, throughput is not limited by hardware bandwidth. True or **False