| A | B |
|---|
| The main function of the Spanning-Tree Protocol is to | allow duplicate switched/bridged paths without incurring the latency effects of loops in the network |
| Spanning-Tree Protocol, prevents loops by | calculating a stable spanning-tree network topology |
| The Spanning-Tree Algorithm is used to | calculate a loop-free path |
| Spanning-tree frames, called bridge protocol data units (BPDUs), are sent and received by | all switches in the network at regular intervals and are used to determine the spanning-tree topology |
| Spanning-Tree Protocol is resilient to | topology changes and device failures |
| Spanning-Tree Protocol allows | redundant links |
| Loops can cause | broadcast storms |
| Blocking state | No frames forwarded, BPDUs heard |
| Listening state | No frames forwarded, listening for frames |
| Learning state | No frames forwarded, learning addresses |
| Forwarding state | Frames forwarded, learning addresses |
| Disabled state | No frames forwarded, no BPDUs heard |
| You can determine the status, cost, and priority of ports and VLANs by using the | show spantree command |
| Ports can be configured to immediately enter Spanning-Tree Protocol | forwarding mode when a connection is made |
