400-007

400-007 practice questions, page 8 of 14, with answer review and explanations.

Question 36

A multicast network is using Bidirectional PIM. Which two combined actions achieve high availability so that two RPs within the same network can act in a redundant manner? (Choose two.)

  1. Advertise the two RP addresses in the routing protocol.
  2. Use two phantom RP addresses.
  3. Manipulate the multicast routing table by creating static mroutes to the two RPs.
  4. Control routing to the two RPs through a longest match prefix.
  5. Use Anycast RP based on MSDP peering between the two RPs.
  6. Manipulate the administrative distance of the unicast routes to the two RPs.

Question 37

Refer to the exhibit. Which impact of using three or more ABRs between the backbone area and area 1 is true?

  1. In a large-scale network, multiple ABRs can create microloops.
  2. Multiple ABRs reduce the CPU processing on each ABR due to splitting prefix advertisement between areas.
  3. Prefixes from the non-backbone area are advertised by one ABR to the backbone area.
  4. In a large-scale network, LSA replication, by all ABRs, can cause serious scalability issues.

Question 38

Company XYZ runs OSPF in their network. A design engineer decides to implement hot-potato routing architecture. How can this implementation be achieved?

  1. Enable iBGP and apply prepend to ensure all prefixes will have the same length of the AS path attribute value.
  2. Redistribute the external prefixes onto OSPF and ensure that the total metric calculation includes external and internal values.
  3. Enable OSPF load-balancing over unequal cost path.
  4. Redistribute the external prefixes onto OSPF and ensure the total metric calculation includes only the external value and the value is the same in all ASBRs.

Question 39

How many fully established neighbour relationships exist on an Ethernet with five routers running OSPF as network type broadcast?

  1. 5
  2. 6
  3. 7
  4. 10
  5. 20

Question 40

How can EIGRP topologies be designed to converge as fast as possible in the event of a point-to-point link failure?

  1. Limit the query domain by use of summarization.
  2. Limit the query domain by use of default routes.
  3. Build neighbor adjacencies in a squared fashion.
  4. Limit the query domain by use of distribute lists.
  5. Build neighbor adjacencies in a triangulated fashion.