单选题panning Tree Protocol calculates path cost based on which of these？（）A interface bandwidthB interface delayC interface bandwidth and delayD hop countE bridge priority

题目
单选题
panning Tree Protocol calculates path cost based on which of these？（）
A

interface bandwidth

B

interface delay

C

interface bandwidth and delay

D

hop count

E

bridge priority

相似考题

1.要将交换机100M端口的路径成本设置为25,以下哪个命令是正确的?()A.Switch(config)#spanning-tree cost 25B.Switch(config-if)#spanning-tree cost 25C.Switch(config)#spanning-tree priority 25D.Switch(config-if)#spanning-tree path-cost 25

2.By default, which of the following factors determines the spanning-tree path cost?A．It is the individual link cost based on latencyB．It is the sum of the costs based on bandwidthC．It is the total hop countD．It is dynamically determined based on loadE．None of the above

3.Open Shortest Path First (OSPF) was designed as an （ ） gateway protocol, for use in an autonomous system such as a local area network (LAN). It implements Dijkstra's algorithm, also known as the （ ） path first algorithm. As a link-state routing protocol it was based on the link-state algorithm developed for the ARPANET in 1980 and the IS-IS routing protocol. OSPF was first standardised in 1989 as RFC 1131, which is now known as OSPF version 1.Routing protocols like OSPF calculate the shortest route to a destination through the network based on an algorithm. The first routing protocol that was widely implemented, the （请作答此空）, calculated the shortest route based on hops, that is the number of routers that an IP packet had to traverse to reach the destination host. RIP successfully implemented dynamic routing, where routing tables change if the network topology changes. But RIP did not adapt its routing according to changing network conditions, such as data-transfer rate. Demand grew for a dynamic routing protocol that could calculate the fastest route to a destination. （ ） was developed so that the shortest path through a network was calculated based on the cost of the route, taking into account bandwidth, delay and load. Therefore OSPF undertakes route cost calculation on the basis of link-cost parameters, which can be weighted by the administrator. OSPF was quickly adopted because it became known for reliably calculating routes through large and complex local area networks.As a link state routing protocol, OSPF maintains link state （ ）, which are really network topology maps, on every router on which it is implemented. The state of a given route in the network is the cost, and OSPF algorithm allows every router to calculate the cost of the routes to any given reachable destination. Unless the administrator has made a configuration, the link cost of a path connected to a router is determined by the bit rate (1 Gbit/s, 10 Gbit/s, etc) of the interface. A router interface with OSPF will then advertise its link cost to neighbouring routers through multicast, known as the hello procedure. All routers with OSPF implementation keep sending hello packets, and thus changes in the cost of their links become known to neighbouring routers. The information about the cost of a link, that is the speed of a point to point connection between two routers, is then cascaded through the network because OSPF routers advertise the information they receive from one neighbouring router to all other neighbouring routers. This process of flooding link state information through the network is known as synchronisation. Based on this information, all routers with OSPF implementation continuously update their link state databases with information about the network topology and adjust their routing tables.OSPF has become a popular dynamic routing protocol. Other commonly used dynamic routing protocols are the RIP and the Border Gateway Protocol (BGP). Today routers support at least one interior gateway protocol to advertise their routing tables within a local area network. Frequently implemented interior gateway protocols besides OSPF are RIP, IS-IS, and the proprietary Interior Gateway Routing Protocol (IGRP) by Cisco.A.OSPF B.RIP C.IS-IS D.EIGRP

4.In the following statements about graph operations，which one is NOT correct?A．Finding critical path is an operation on directed graphB．Finding critical path is an operation on undirected graphC．Spanning tree of a graph may not be uniqueD．Minimum spanning tree of a graph may not be unique

更多“panning Tree Protocol calculates path cost based on which of”相关问题

  • 第1题：

    Which two statements about spanning tree path cost are true？（）

    • A、The path cost can be changed for an interface using the spanning-tree cost command
    • B、The path cost can be changed for an interface using the stp path-cost command
    • C、The SPT default path cost depends on the interface speed
    • D、The STP default path cost is similar for all interface

    正确答案:A,C

  • 第2题：

    Which characteristics are representative of a link-state routing protocol?（）

    • A、Provide common view of entire topology
    • B、Exchange routing tables with neighbors.
    • C、Calculates shortest path.
    • D、Utilizes event triggered updates.
    • E、Utilizes frequent periodic updates.

    正确答案:A,C,D

  • 第3题：

    Which two are characteristics of link-state routing protocols?（） (Choose two.)

    • A、Routers choose a best path for a destination based on the SPF algorithm.
    • B、All routers in a given area or level build a consistent database describing the network's topology.
    • C、Routers choose the best path for a destination based on the interface on which they received the link stateadvertisement with the lowest cost.
    • D、All routers in a given area or level forward link state advertisements between interfaces in the same area or level, adding their metric to the link state advertisement's cost information when they forward it.

    正确答案:A,B

  • 第4题：

    The classic Spanning Tree Protocol （802.1D 1998） uses which sequence of variables to determine the best received BPDU？（）

    • A、 1） lowest root bridge id，2）lowest sender bridge id，3）lowest port id，4）lowest root path cost
    • B、 1） lowest root path cost，2）lowest root bridge id，3）lowest sender bridge id，4）lowest sender port id
    • C、 1） lowest root bridge id，2）lowest sender bridge id，3）lowest root path cost 4）owest sender port id
    • D、 1） lowest root bridge id，2）lowest root path cost，3）lowest sender bridge id，4）lowest sender port id

    正确答案:D

  • 第5题：

    By default, which of the following factors determines the spanning-tree path cost?（）

    • A、It is the individual link cost based on latency
    • B、It is the sum of the costs based on bandwidth
    • C、It is the total hop count
    • D、It is dynamically determined based on load

    正确答案:B

  • 第6题：

    What value is primarily used to determine which port becomes the root port on each nonroot switch in a spanning-tree topology?（）

    • A、lowest port MAC address
    • B、port priority number and MAC address.
    • C、VTP revision number
    • D、highest port priority number.
    • E、path cost

    正确答案:E

  • 第7题：

    Which command enhances the 802.1D convergence time on ports that are connected to hosts?（）

    • A、spanning-tree backbonefast
    • B、spanning-tree uplinkfast
    • C、spanning-tree portfast
    • D、spanning-tree cost512

    正确答案:C

  • 第8题：

    单选题
    By default, which of the following factors determines the spanning-tree path cost?（）
    A

    It is the individual link cost based on latency

    B

    It is the sum of the costs based on bandwidth

    C

    It is the total hop count

    D

    It is dynamically determined based on load


    正确答案： B
    解析： 暂无解析

  • 第9题：

    多选题
    Which four Cisco priority Spanning Tree Protocol enhancements are supported with rapid per-VLAN Spanning Tree？ （）
    A

    PortFast

    B

    UplinkFast

    C

    loop guard

    D

    root guard

    E

    BPDU guard

    F

    BackboneFast


    正确答案： F,D
    解析： 暂无解析

  • 第10题：

    单选题
    The classic Spanning Tree Protocol （802.1D  1998） uses which sequence of variables to determine the best received BPDU？（）
    A

    lowest root bridge id；lowest sender bridge id；lowest port id；lowest root path cost

    B

    lowest root path cost；lowest root bridge id；lowest sender bridge id；lowest sender port id

    C

    lowest root bridge id；lowest sender bridge id；lowest root path cost；lowest sender port id

    D

    lowest root bridge id；lowest root path cost；lowest sender bridge id；lowest sender port id


    正确答案： D
    解析： 暂无解析

  • 第11题：

    单选题
    Network A has a spanning-tree problem in which the traffic is selecting a longer path. How is the path cost calculated？（）
    A

    number of hops

    B

    priority of the bridge

    C

    interface bandwidth

    D

    interface delay

    E

    None of the above


    正确答案： A
    解析： 暂无解析

  • 第12题：

    单选题
    What Cisco technology protects against Spanning-Tree Protocol manipulation？（）
    A

     Spanning tree protect

    B

     Root Guard and BPDU Guard

    C

     Unicast Reverse Path Forwarding

    D

     MAC spoof guard

    E

     Port Security


    正确答案： E
    解析： 暂无解析

  • 第13题：

    What value is primarily used to determine which port becomes the root port on each nonroot switch in a spanning-tree topology？（）

    • A、lowest port MAC address
    • B、port priority number and MAC address
    • C、VTP revision number
    • D、highest port priority number
    • E、path cost

    正确答案:E

  • 第14题：

    panning Tree Protocol calculates path cost based on which of these？（）

    • A、interface bandwidth
    • B、interface delay
    • C、interface bandwidth and delay
    • D、hop count
    • E、bridge priority

    正确答案:A

  • 第15题：

    What Cisco technology protects against Spanning-Tree Protocol manipulation？（）

    • A、 Spanning tree protect
    • B、 Root Guard and BPDU Guard
    • C、 Unicast Reverse Path Forwarding
    • D、 MAC spoof guard
    • E、 Port Security

    正确答案:B

  • 第16题：

    Spanning Tree Protocol calculates path cost based on which of these？ （）

    • A、 interface bandwidth
    • B、 interface delay
    • C、 interface bandwidth and delay
    • D、 hop count
    • E、 bridge priority

    正确答案:A

  • 第17题：

    Which three options are considered in the spanning-tree decision process？（）

    • A、lowest root bridge ID
    • B、lowest path cost to root bridge
    • C、lowest sender bridge ID
    • D、highest port ID
    • E、highest root bridge ID
    • F、highest path cost to root bridge

    正确答案:A,B,C

  • 第18题：

    Network A has a spanning-tree problem in which the traffic is selecting a longer path. How is the path cost calculated？（）

    • A、number of hops
    • B、priority of the bridge
    • C、interface bandwidth
    • D、interface delay
    • E、None of the above

    正确答案:C

  • 第19题：

    单选题
    panning Tree Protocol calculates path cost based on which of these？（）
    A

    interface bandwidth

    B

    interface delay

    C

    interface bandwidth and delay

    D

    hop count

    E

    bridge priority


    正确答案： C
    解析： 暂无解析

  • 第20题：

    多选题
    Which two statements about spanning tree path cost are true？（）
    A

    The path cost can be changed for an interface using the spanning-tree cost command

    B

    The path cost can be changed for an interface using the stp path-cost command

    C

    The SPT default path cost depends on the interface speed

    D

    The STP default path cost is similar for all interface


    正确答案： D,A
    解析： 暂无解析

  • 第21题：

    多选题
    Which three options are considered in the spanning-tree decision process？（）
    A

    lowest root bridge ID

    B

    lowest path cost to root bridge

    C

    lowest sender bridge ID

    D

    highest port ID

    E

    highest root bridge ID

    F

    highest path cost to root bridge


    正确答案： A,D
    解析： 暂无解析

  • 第22题：

    单选题
    The classic Spanning Tree Protocol （802.1D 1998） uses which sequence of variables to determine the best received BPDU？（）
    A

     1） lowest root bridge id，2）lowest sender bridge id，3）lowest port id，4）lowest root path cost

    B

     1） lowest root path cost，2）lowest root bridge id，3）lowest sender bridge id，4）lowest sender port id

    C

     1） lowest root bridge id，2）lowest sender bridge id，3）lowest root path cost 4）owest sender port id

    D

     1） lowest root bridge id，2）lowest root path cost，3）lowest sender bridge id，4）lowest sender port id


    正确答案： A
    解析： 暂无解析

  • 第23题：

    单选题
    Spanning Tree Protocol calculates path cost based on which of these？ （）
    A

     interface bandwidth

    B

     interface delay

    C

     interface bandwidth and delay

    D

     hop count

    E

     bridge priority


    正确答案： D
    解析： 暂无解析

  • 第24题：

    单选题
    Spanning Tree Protocol calculates path cost based on which of these？（）
    A

    interface bandwidth

    B

    interface delay

    C

    interface bandwidth and delay

    D

    hop count

    E

    bridge priority


    正确答案： D
    解析： 暂无解析

相关内容