Skills101
← All practice quizzes

Quiz: Flow Control and Sliding Window

5 questions · new set on every retakeNo time limitPass: 60%+10 XP on first pass

Learn why a sender must not flood a receiver, how stop-and-wait wastes a long link, and how sliding-window protocols (Go-Back-N and Selective Repeat) fix it — with efficiency, window-size and sequence-number numericals solved step by step.

Log in to take the quiz

Free account · see your score, answers and explanations, earn XP

  1. Question 1

    A 2,000-bit frame is sent on a 1 Mbps link. What is the transmission time?

  2. Question 2

    Tt = 4 ms and Tp = 6 ms. What is the efficiency of stop-and-wait?

  3. Question 3

    With a = 2, what is the smallest window size that gives 100% efficiency?

  4. Question 4

    In Go-Back-N, what does the receiver do with frames that arrive after a missing frame?

  5. Question 5

    Which statement about Selective Repeat is correct?

🎯 Today’s placement challenge — 10 questions, no login. Can you score 10/10?Take today’s challenge →