Question 1

A network administrator is designing a Layer 2 topology and requires separate spanning-tree roots to avoid having a given port blocked for all instances. Which spanning-tree protocols will meet this need?

Options :

A : STP & RSTP

B : RSTP-PV & MSTP

C : STP & RSTP-PV

D : RSTP & MSTP

Answer: B

Question 2

A network administrator enters the BGP command neighbor 10.0.2.1. The BGP router does NOT have any route to the 10.0.2.0 network. What will happen?

Options :

A : The router will form a successful adjacency with its 10.0.2.1 neighbor. The BGP state will be listed as connect.

B : The router will not form a successful adjacency with its 10.0.2.1 neighbor.

C : It will send gratuitous ARP messages to attempt to discover a route to its 10.0.2.1 neighbor.

D : It will send an ICMP packet to attempt to reach its 10.0.2.1 neighbor.

Answer: B

Question 3

What is the maximum number of LLDP neighbors supported per system with OS10?

Options :

A : 250

B : 256

C : 384

D : 512

Answer: A

Question 4

How does a DHCP Client make a request to a DHCP server following an offer?

Options :

A : Multicast

B : ACK

C : Broadcast

D : Unicast

Answer: D

Question 5

How are ACLs processed?

Options :

A : LIFO

B : FIFO

C : Randomly

D : Sequentially

Answer: D