CCNA 2 V4 Chapter 10

21 Questions | Total Attempts: 63

SettingsSettingsSettings
CCNA 2 V4 Chapter 10

Hop on Ritch, we'll carry you mate.


Questions and Answers
  • 1. 
    What action does a link-state router take immediately upon receipt of an LSP from a neighboring router?
    • A. 

      Floods the LSP to neighbors

    • B. 

      Calculates the SPF algorithm

    • C. 

      Runs the Bellman-Ford algorithm

    • D. 

      Computes the best path to the destination network

  • 2. 
    Why is it difficult for routing loops to occur in networks that use link-state routing?
    • A. 

      Each router builds a simple view of the network based on hop count.

    • B. 

      Routers flood the network with LSAs to discover routing loops.

    • C. 

      Each router builds a complete and synchronized view of the network.

    • D. 

      Routers use hold-down timers to prevent routing loops.

  • 3. 
    Refer to the exhibit. What kind of information would be seen in an LSP sent from router JAX to router ATL?
    • A. 

      Hop count

    • B. 

      Uptime of the route

    • C. 

      Cost of the link

    • D. 

      A list of all the routing protocols in use

  • 4. 
    To achieve network convergence, what three steps does each link state router take? (Choose three.)
    • A. 

      Use automatic summarization to reduce the size of routing tables

    • B. 

      Build a Link State Packet (LSP) containing the state of each directly connected link

    • C. 

      Flood the LSP to all neighbors, who then store all LSPs received in a database

    • D. 

      Discover neighbors and establish adjacencies using the hello packet sent at regular intervals

    • E. 

      Construct a complete map of the topology and compute the best path to each destination network

    • F. 

      Use the DUAL FSM to select efficient, loop-free paths, and insert routes into the routing table

  • 5. 
    Refer to the exhibit. When Router D is configured to use a link-state routing protocol and is added to the network, what is the first thing that it does to begin learning the network topology?
    • A. 

      It sends LSP packets to Routers B and C.

    • B. 

      It sends LSP packets to all routers in the network.

    • C. 

      It sends Hello packets to all routers in the network.

    • D. 

      It sends information about its directly connected neighbors to Routers A and E.

    • E. 

      It sends information about its directly connected neighbors to all routers in the network.

    • F. 

      It learns about its directly connected networks when its interfaces reach the up state.

  • 6. 
    A new network administrator is given the task of selecting an appropriate dynamic routing protocol for a software development company. The company has over 100 routers, uses CIDR and VLSM, requires fast convergence, and uses both Cisco and non-Cisco equipment. Which routing protocol is appropriate for this company?
    • A. 

      RIP version 2

    • B. 

      IGRP

    • C. 

      EIGRP

    • D. 

      OSPF

    • E. 

      BGP

  • 7. 
    What two events will cause a link state router to send LSPs to all neighbors? (Choose two.)
    • A. 

      30 second timer expires

    • B. 

      Whenever the network topology changes

    • C. 

      Immediately after the Bellman-Ford algorithm has run

    • D. 

      Immediately after the DUAL FSM has built the topology database

    • E. 

      Upon initial startup of router or routing protocol

  • 8. 
    What is the final step in the link state routing process?
    • A. 

      Successors are placed into the routing table

    • B. 

      SPF computes best path to each destination network

    • C. 

      LSPs are flooded to all neighbors to converge the network

    • D. 

      DUAL algorithm is run to find best path to destination networks

  • 9. 
    Refer to the exhibit. What does JAX do with link-state packets from ORL? 
    • A. 

      Sends out its updated routing table to both ORL and BOS routers

    • B. 

      Sends out the individual link-state packets out the interface connected to BOS

    • C. 

      Queries BOS to see if it has a better route

    • D. 

      Only adds it to the local routing table and performs no other actions

  • 10. 
    What two statements correctly describe the link state routing process? (Choose two.)
    • A. 

      Each router in the area floods LSPs to all neighbors

    • B. 

      All routers in the area have identical link state databases

    • C. 

      LSPs use the reserved multicast address of 224.0.0.10 to reach neighbors

    • D. 

      Routing loops are prevented by running the Diffusing Update Algorithm (DUAL)

    • E. 

      Reliable Transport Protocol (RTP) is the protocol used by for the delivery and reception of LSPs

  • 11. 
    Which database or table must be identical on all link-state routers within an area in order to construct an accurate SPF tree?
    • A. 

      Routing table

    • B. 

      Adjacency table

    • C. 

      Link-state database

    • D. 

      Neighbor table

    • E. 

      Topology database

  • 12. 
    Refer to the exhibit. Which statement correctly describes the path traffic would take from the 10.0.0.0/24 network to the 192.168.1.0/24 network if a link-state routing protocol was in use?
    • A. 

      BOS -> ATL because this path is the least hops

    • B. 

      BOS -> ATL because this path is highest cost

    • C. 

      BOS -> ORL -> JAX -> ATL because this path is the lowest cost

    • D. 

      Traffic would load balance across all links

  • 13. 
    What feature do modern link-state protocols provide to minimize processing and memory requirements?
    • A. 

      Splitting routing topologies into smaller areas

    • B. 

      Assigning lower process priorities to route calculations

    • C. 

      Using update timers to restrict routing updates

    • D. 

      Strict split horizon rules to reduce routing table entries

  • 14. 
    What speeds up convergence in a network using link-state routing?
    • A. 

      Updates triggered by network changes

    • B. 

      Updates sent at regular intervals

    • C. 

      Updates sent only to directly connected neighbors

    • D. 

      Updates that include complete routing tables

  • 15. 
    Which algorithm is run by link-state routing protocols to calculate the shortest path to destination networks?
    • A. 

      DUAL

    • B. 

      Dijkstra

    • C. 

      Bellman-Ford

    • D. 

      Diffie-Hellman

  • 16. 
    What are some of the advantages of using a link-state routing protocol instead of a distance vector routing protocol? (Choose two.)
    • A. 

      The topology database eliminates the need for a routing table.

    • B. 

      Frequent periodic updates are sent to minimize the number of incorrect routes in the topological database.

    • C. 

      Routers have direct knowledge of all links in the network and how they are connected.

    • D. 

      After the inital LSA flooding, they generally require less bandwidth to communicate changes in a topology.

    • E. 

      Link-state protocols require less router processor power than distance vector protocols.

  • 17. 
    Refer to the exhibit. If all routers and interfaces are configured to use a link-state routing protocol, from which routers will router D receive hello packets?
    • A. 

      A and E

    • B. 

      B and C

    • C. 

      A, B, C, and E

    • D. 

      C only

  • 18. 
    Which two routing protocols use Dijkstra’s shortest path first algorithm? (Choose two.)
    • A. 

      RIPv1

    • B. 

      RIPv2

    • C. 

      IS-IS

    • D. 

      BGP

    • E. 

      EIGRP

    • F. 

      OSPF

  • 19. 
    When are link-state packets sent to neighbors?
    • A. 

      Every 30 seconds

    • B. 

      Every 180 seconds

    • C. 

      After the holddown time expires

    • D. 

      When a link goes up or down

    • E. 

      When a routing loop occurs

  • 20. 
    What are two advantages of using a link-state routing protocol instead of a distance vector routing protocol? (Choose two.)
    • A. 

      The topology database eliminates the need for a routing table.

    • B. 

      Each router independently determines the route to each network.

    • C. 

      Link-state protocols require less router processor power than distance vector protocols.

    • D. 

      After the inital LSP flooding, they generally require less bandwidth to communicate changes in a topology.

    • E. 

      Frequent periodic updates are sent to minimize the number of incorrect routes in the topological database.

  • 21. 
    To achieve network convergence, what three steps does each link state router take? (Choose three.)
    • A. 

      Use automatic summarization to reduce the size of routing tables

    • B. 

      Build a Link State Packet (LSP) containing the state of each directly connected link

    • C. 

      Flood the LSP to all neighbors, who then store all LSPs received in a database

    • D. 

      Send hello packages at regular intervals to discover neighbors and establish adjacencies

    • E. 

      Construct a complete map of the topology and compute the best path to each destination network

    • F. 

      Use the DUAL FSM to select efficient, loop-free paths, and insert routes into the routing table

Related Topics
Back to Top Back to top