Tip: Choose Save as PDF in the print dialog to download. Use A4 paper size.
Shade in the A or B circle for each question.
Draw a line connecting each item on the left to its match on the right.
| Left column | Right column | |
|---|---|---|
| 1route = best_available_path() | AA congested route is avoided and the packet is sent another way | |
| 2if link_busy: choose_other_route() | Bif link_broken: use_working_route() | |
| 3A broken link is avoided, so the router sends the packet along a working route instead | CA router avoids busy or congested routes and picks a better available path, so the packets are not stuck in a queue. | |
| 4Different routes can take different lengths of time, so packets may arrive at different times | Darrival_time = sum(route_delays) | |
| 5All packets in a message must follow the same route | EPackets from one message can take different routes, because each router chooses the best available path at that moment. | |
| 6A router keeps sending packets down a busy route | FA router picks the best path open at that moment for each packet |
Complete each line of code by filling in the missing parts.
Shade in the letter of the line that contains an error.
different routes — Packets from one message can take different routes because each router picks the best available path at that moment, avoiding busy or broken links. Routes may take different lengths of time.IF routeBusy = TRUE THEN
route ← "B"
ENDIFIF linkBroken = TRUE THEN
route ← "C"
ENDIFIF timeA < timeB THEN
route ← "A"
ENDIFIF linkBroken = TRUE THEN
route ← "B"
ENDIFIF routeBusy = TRUE THEN
route ← "B"
ENDIF