Kursliste Registrer Logg inn

Informasjon

Forfatter(e) Emilie Deprez
Frist Ingen frist
Innleveringsgrense Ingen begrensning
Kategorimerkelapper ethernet

Merkelapper

Logg inn

Logg inn

The spanning tree protocol - step by step - 2

Consider the network shown in the figure below where all links have a cost of 1.

1 2 1 2 1 1 2 3
Spørsmål 1: Root switch

Which is the root switch in this network ?

Provide your answer as Sx where x is the number of the switch

Spørsmål 2: BPDU sent

What is the BPDU sent by switch in this network ?

Provide your answer as R=123, C=456, T=789

Spørsmål 3: BPDU sent

What is the BPDU sent by switch in this network ?

Provide your answer as R=123, C=456, T=789

Spørsmål 4: BPDU sent

What is the BPDU sent by switch in this network ?

Provide your answer as R=123, C=456, T=789

Spørsmål 5: BPDU sent

What is the BPDU sent by switch in this network ?

Provide your answer as R=123, C=456, T=789

Spørsmål 6: Best BPDU

Between and , which switch has the best BPDU ?

Provide your answer as Sx where x is the number of the switch

Spørsmål 7: Best BPDU

Between and , which switch has the best BPDU ?

Provide your answer as Sx where x is the number of the switch

Spørsmål 8: Best BPDU

Between and , which switch has the best BPDU ?

Provide your answer as Sx where x is the number of the switch

Spørsmål 9: Best BPDU

Between and , which switch has the best BPDU ?

Provide your answer as Sx where x is the number of the switch

Spørsmål 10: Port State

What is the state of each port of ?

Provide your answer as 1:root, 2:designated, 3:blocked, ...

Spørsmål 11: Port State

What is the state of each port of ?

Provide your answer as 1:root, 2:designated, 3:blocked, ...

Spørsmål 12: Port State

What is the state of each port of ?

Provide your answer as 1:root, 2:designated, 3:blocked, ...

Spørsmål 13: Port State

What is the state of each port of ?

Provide your answer as 1:root, 2:designated, 3:blocked, ...