How does STP provide a loop-free network?
Sponsored Links
This presentation is the property of its rightful owner.
1 / 26

How does STP provide a loop-free network? By placing all ports in the blocking state PowerPoint PPT Presentation


  • 81 Views
  • Uploaded on
  • Presentation posted in: General

How does STP provide a loop-free network? By placing all ports in the blocking state By placing all bridges in the blocking state By placing some ports in the blocking state By placing some bridges in the blocking state. How does STP provide a loop-free network?

Download Presentation

How does STP provide a loop-free network? By placing all ports in the blocking state

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


  • How does STP provide a loop-free network?

    • By placing all ports in the blocking state

    • By placing all bridges in the blocking state

    • By placing some ports in the blocking state

    • By placing some bridges in the blocking state


  • How does STP provide a loop-free network?

    • By placing all ports in the blocking state

    • By placing all bridges in the blocking state

    • By placing some ports in the blocking state

    • By placing some bridges in the blocking state


  • What elements will exist in a converged network with one spanning tree? (Choose two.)

    • one root bridge per network

    • all non-designated ports forwarding

    • one root port per non-root bridge

    • multiple designated ports per segment

    • one designated port per network


  • What elements will exist in a converged network with one spanning tree? (Choose two.)

    • one root bridge per network

    • all non-designated ports forwarding

    • one root port per non-root bridge

    • multiple designated ports per segment

    • one designated port per network


  • Which port role specifies a forwarding port that is elected for every switched LAN segment when using Rapid Spanning Tree Protocol?

    • Root

    • Backup

    • Alternate

    • Designated


  • Which port role specifies a forwarding port that is elected for every switched LAN segment when using Rapid Spanning Tree Protocol?

    • Root

    • Backup

    • Alternate

    • Designated


  • In which STP state does a port record MAC addresses but not forward user data?

    • blocking

    • learning

    • disabling

    • listening

    • forwarding


  • In which STP state does a port record MAC addresses but not forward user data?

    • blocking

    • learning

    • disabling

    • listening

    • forwarding


  • How is the information contained in BPDUs used by switches? (Choose two.)

    • to prevent loops by sharing bridging tables between connected switches

    • to set the duplex mode of a redundant link

    • to determine the shortest path to the root bridge

    • to determine which ports will forward frames as part of the spanning tree

    • to activate looped paths throughout the network


  • How is the information contained in BPDUs used by switches? (Choose two.)

    • to prevent loops by sharing bridging tables between connected switches

    • to set the duplex mode of a redundant link

    • to determine the shortest path to the root bridge

    • to determine which ports will forward frames as part of the spanning tree

    • to activate looped paths throughout the network


  • In what state can a port populate its MAC address table but not forward user frames?

    • Learning state

    • Blocking state

    • Listening state

    • Forwarding state


  • In what state can a port populate its MAC address table but not forward user frames?

    • Learning state

    • Blocking state

    • Listening state

    • Forwarding state


  • What is Rapid Spanning Tree Protocol equivalent state to the Spanning Tree Protocol blocking state?

    • Blocking

    • Dropping

    • Discarding

    • Forwarding


  • What is Rapid Spanning Tree Protocol equivalent state to the Spanning Tree Protocol blocking state?

    • Blocking

    • Dropping

    • Discarding

    • Forwarding


  • What happens when there is a topology change on a network that utilizes STP ? (Choose two.)

    • User traffic is disrupted until recalculation is complete.

    • The switch recomputes the Spanning Tree topology after the network converges.

    • All ports are placed in learning state until convergence has occurred.

    • A delay of up to 50 seconds is incurred for convergence of the new Spanning Tree topology.

    • User data is forwarded while BPDUs are exchanged to recompute the topology


  • What happens when there is a topology change on a network that utilizes STP ? (Choose two.)

    • User traffic is disrupted until recalculation is complete.

    • The switch recomputes the Spanning Tree topology after the network converges.

    • All ports are placed in learning state until convergence has occurred.

    • A delay of up to 50 seconds is incurred for convergence of the new Spanning Tree topology.

    • User data is forwarded while BPDUs are exchanged to recompute the topology


  • Which of the following describe the BIDs used in a spanning tree topology? (Choose two.)

    • They are sent out by the root bridge only after the inferior BPDUs are sent.

    • They consist of a bridge priority and MAC address.

    • Only the root bridge will send out a BID.

    • They are used by the switches in a spanning tree topology to elect the root bridge.

    • The switch with the fastest processor will have the lowest BID.


  • Which of the following describe the BIDs used in a spanning tree topology? (Choose two.)

    • They are sent out by the root bridge only after the inferior BPDUs are sent.

    • They consist of a bridge priority and MAC address.

    • Only the root bridge will send out a BID.

    • They are used by the switches in a spanning tree topology to elect the root bridge.

    • The switch with the fastest processor will have the lowest BID.


  • On the root bridge, all ports are _______?

    • Root ports

    • Blocked ports

    • Designated ports

    • Non-designated ports


  • On the root bridge, all ports are _______?

    • Root ports

    • Blocked ports

    • Designated ports

    • Non-designated ports


  • What link types have been defined for Rapid Spanning-Tree Protocol? (Choose three.)

    • shared

    • end-to-end

    • edge-type

    • boundary-type

    • point-to-many

    • point-to-point


  • What link types have been defined for Rapid Spanning-Tree Protocol? (Choose three.)

    • shared

    • end-to-end

    • edge-type

    • boundary-type

    • point-to-many

    • point-to-point


  • How much time does it take for a switch port to go from the blocking state to the forwarding state?

    • 2 seconds

    • 15 seconds

    • 20 seconds

    • 50 seconds


  • How much time does it take for a switch port to go from the blocking state to the forwarding state?

    • 2 seconds

    • 15 seconds

    • 20 seconds

    • 50 seconds


  • What features of the Spanning-Tree Protocol contribute to the time it takes for a switched network to converge after a topology change occurs? (Choose three.)

    • the max-age timer

    • the listening forward delay

    • the spanning-tree hold down timer

    • the learning forward delay

    • the spanning-tree path cost

    • the blocking delay


  • What features of the Spanning-Tree Protocol contribute to the time it takes for a switched network to converge after a topology change occurs? (Choose three.)

    • the max-age timer

    • the listening forward delay

    • the spanning-tree hold down timer

    • the learning forward delay

    • the spanning-tree path cost

    • the blocking delay


  • Login