slide1
Download
Skip this Video
Download Presentation
How does STP provide a loop-free network? By placing all ports in the blocking state

Loading in 2 Seconds...

play fullscreen
1 / 26

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


  • 107 Views
  • Uploaded on

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?

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' How does STP provide a loop-free network? By placing all ports in the blocking state' - matthew-weiss


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
slide1

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
slide2

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
slide3

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
slide4

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
slide5

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
slide6

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
slide7

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

    • blocking
    • learning
    • disabling
    • listening
    • forwarding
slide8

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

    • blocking
    • learning
    • disabling
    • listening
    • forwarding
slide9

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
slide10

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
slide11

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

    • Learning state
    • Blocking state
    • Listening state
    • Forwarding state
slide12

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

    • Learning state
    • Blocking state
    • Listening state
    • Forwarding state
slide13

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

    • Blocking
    • Dropping
    • Discarding
    • Forwarding
slide14

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

    • Blocking
    • Dropping
    • Discarding
    • Forwarding
slide15

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
slide16

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
slide17

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.
slide18

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.
slide19

On the root bridge, all ports are _______?

    • Root ports
    • Blocked ports
    • Designated ports
    • Non-designated ports
slide20

On the root bridge, all ports are _______?

    • Root ports
    • Blocked ports
    • Designated ports
    • Non-designated ports
slide21

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
slide22

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
slide23

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
slide24

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
slide25

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
slide26

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
ad