H12-224 : HCNP-R&S Fast Track (Huawei Certified Network Professional – Routing & Switching Fast Track) : Part 23

H12-224 : HCNP-R&S Fast Track (Huawei Certified Network Professional – Routing & Switching Fast Track) : Part 23

1. In the process of calculating SPF tree, the cost from a node to root node equals to metric listed in the Router LSA generated by the node.

   • True
   • False 

2. Which command must be configured to establish a BGP peer relationship between indirectly connected EBGP peers?

   • Peer connect-interface
   • Peer valid-ttl-hops
   • Peer ignore
   • Peer ebgp-max-hop 

3. Using the peer connect-interface command to establish “multiple” peer relationships between two routers connected through “multiple” links is recommended.

   • True 
   • False

4. Which following BGP attribute can used to define a set of prefixes with the same characteristics?

   • Origin
   • Nexthop
   • Community 
   • MED

5. Which types of packets are supported by BGP? (Choose three.)

   • Hello
   • Notification
   • Update
   • Route-refresh

6. Which BGP attribute is not a well-known mandatory attribute?

   • Origin
   • Nexthop
   • AS-Path
   • MED 

7. By default, what are the LOCAL_PREF and PREFERRED-VALUE in VRP system?

   • 0,32768
   • 100,0 
   • 255,100
   • 32768,0

8. Which of the following statements are false? (Choose three.)

   • An ASBR-Summary-LSA describes the route to an ASBR and is flooded within an AS. 
   • An ASE-LSA describes the route to an external AS and is flooded to an external AS.
   • An AS-External-LSA does not belong to any specific area.
   • The metric of a Type-1 external route is the AS external metric only. 

9. If a router receives two BGP routes (M and N) that contain the following attributes,

   

   Which route is the optimal route based on BGP route selection rules?

   •  The optimal route is route M because its AS_Path is shorter than that of route N. 
   • The optimal route is route N because its MED value is smaller than that of route M.
   • The optimal route is determined randomly.

10. Which parameters are carried in a BGP Open message? (Choose three.)

    • Local AS number 
    • BGP ID
    • Keepalive timer
    • Holder timer 
    • Current peer status

11. In BGP, performing MD5 authentication between BGP peers can protect them from DoS attacks.

    • True 
    • False

12. Only one BGP process can be configured on a router.

    • True 
    • False

13. In OSPF, the process of calculating shortest path tree can be divided into two phases, calculate Transit node first, then calculate Stub network.

    • True 
    • False

14. Which BGP attributes can be used to prevent routing loops? (Choose three.)

    • Originator_ID 
    • Aggregator
    • Cluster_List
    • AS-Path

15. Which methods can be used to import local routes to BGP? (Choose two.)

    • Run the network command. 
    • Receive routes from peers.
    • Run the summary automatic command.
    • Run the import command. 

16. Whatever changes occur in the BGP routing table, a BGP Speaker advertises all the optimal routes in the BGP routing table to its BGP peer.

    • True
    • False

17. Which of the connection types that Router LSA can describe? (Choose three.)

    • Point-to-point 
    • Star
    • Transit
    • Virtual link

18. In the VRP, by default, a BGP router does not automatically send a Refresh packet to request its BGP peer to retransmit an Update packet after the inbound routing policy of the BGP peer changes.

    • True
    • False

19. Which statements about prerequisites to establishing a BGP peer relationship are true? (Choose two.)

    • BGP peers have been manually configured.
    • A TCP connection has been established between two neighboring routers.
    • BGP peers have exchanged routing information.
    • MD5 authentication has been configured on BGP peers.

20. Based on BGP route selection rules, how are Origin attributes listed in descending order of priority?

    • EGP > IGP > Incomplete
    • IGP > Incomplete > EGP
    • Incomplete > EGP > IGP
    • IGP > EGP > Incomplete