CCENT/CCNA Icnd2 Chapt. 8

10 Questions | Total Attempts: 258

SettingsSettingsSettings
CCENT Quizzes & Trivia

The CCENT exam is the first step towards obtaining certification. It covers some of the things we will discuss in depth once you start the CCNA exam. Have you just finished covering chapter 8 in class? Take this CCENT/CCNA icnd2 chapter 8 quiz and get to refresh your memory on the topics covered.


Questions and Answers
  • 1. 
    Which of the following routing protocols are considered to use distance vector logic?
    • A. 

      RIP-1

    • B. 

      RIP-2

    • C. 

      EIGRP

    • D. 

      OSPF

    • E. 

      Integrated IS-IS

  • 2. 
    Which of the following routing protocols are considered to use link-state logic?
    • A. 

      RIP-1

    • B. 

      RIP-2

    • C. 

      EIGRP

    • D. 

      OSPF

    • E. 

      Integrated IS-IS

  • 3. 
    Which of the following routing protocols use a metric that is, by default, at least partially affected by link bandwidth?
    • A. 

      RIP-1

    • B. 

      RIP-2

    • C. 

      EIGRP

    • D. 

      OSPF

    • E. 

      BGP

  • 4. 
    Which of the following interior routing protocols support VLSM?
    • A. 

      RIP-1

    • B. 

      RIP-2

    • C. 

      EIGRP

    • D. 

      OSPF

    • E. 

      Integrated IS-IS

  • 5. 
    Which of the following situations would cause a router using RIP-2 to remove all the routes learned from a particular neighboring router?
    • A. 

      RIP keepalive failure

    • B. 

      No longer receiving updates from that neighbor

    • C. 

      Updates received 5 or more seconds after the last update was sent to that neighbor

    • D. 

      Updates from that neighbor have the global “route bad” flag

  • 6. 
    Which of the following distance vector features prevents routing loops by causing the routing protocol to advertise only a subset of known routes, as opposed to the full routing table, under normal stable conditions?
    • A. 

      Counting to infinity

    • B. 

      Poison reverse

    • C. 

      Holddown

    • D. 

      Split horizon

    • E. 

      Route poisoning

  • 7. 
    Which of the following distance vector features prevents routing loops by advertising an infinite metric route when a route fails?
    • A. 

      Holddown

    • B. 

      Full updates

    • C. 

      Split horizon

    • D. 

      Route poisoning

  • 8. 
    A router that is using a distance vector protocol just received a routing update that lists a route as having an infinite metric. The previous routing update from that neighbor listed a valid metric. Which of the following is not a normal reaction to this scenario?
    • A. 

      Immediately send a partial update that includes a poison route for the failed route

    • B. 

      Put the route into holddown state

    • C. 

      Suspend split horizon for that route and send a poison reverse route

    • D. 

      Send a full update listing a poison route for the failed route

  • 9. 
    An internetwork is using a link-state routing protocol. The routers have flooded all LSAs, and the network is stable. Which of the following describes what the routers will do to reflood the LSAs?
    • A. 

      Each router refloods each LSA using a periodic timer that has a time similar to distance vector update timers.

    • B. 

      Each router refloods each LSA using a periodic timer that is much longer than distance vector update timers

    • C. 

      The routers never reflood the LSAs as long as the LSAs do not change.

    • D. 

      The routers reflood all LSAs whenever one LSA changes.

  • 10. 
    Which of the following is true about how a router using a link-state routing protocol chooses the best route to reach a subnet?
    • A. 

      The router finds the best route in the link-state database.

    • B. 

      The router calculates the best route by running the SPF algorithm against the information in the link-state database.

    • C. 

      The router compares the metrics listed for that subnet in the updates received from each neighbor and picks the best (lowest) metric route.