|CCNA Solved MCQs Quiz Test|
CCNA Objective Type MCQs Quiz List
Q.1: Which algorithm is run by link-state routing protocols to calculate the shortest path to destination networks ?
Q.2: Which protocol working at the Transport layer provides a connectionless service between hosts ?
Q.3: What range of addresses can be used in the first octet of a Class C address ?
Q.4: What are two advantages of using a link-state routing protocol instead of a distance vector routing protocol ?
- Each router independently determines the route to each network.
- After the inital LSP flooding, they generally require less bandwidth to communicate changes in a topology
- The topology database eliminates the need for a routing table.
- Link-state protocols require less router processor power than distance vector protocols
Q.5: What speeds up convergence in a network using link-state routing ?
- Updates sent only to directly connected neighbors
- Updates sent at regular intervals
- Updates triggered by network changes
- Updates that include complete routing tables
Q.6: If a router interface is congested, which protocol in the IP suite is used to tell neighbor routers ?
Q.7: Why is it difficult for routing loops to occur in networks that use link-state routing ?
- Each router builds a simple view of the network based on hop count
- Each router builds a complete and synchronized view of the network
- Routers use hold-down timers to prevent routing loops
- Routers flood the network with LSAs to discover routing loops
Q.8: Which protocol works at the Transport layer and provides virtual circuits between hosts ?
Q.9: What is the valid host range the IP address 172.16.10.22 255.255.255.240 is a part of ?
- 172.16.10.17 through 172.16.10.30
- 172.16.10.20 through 172.16.10.22
- 172.16.10.16 through 172.16.10.23
- 172.16.10.1 through 172.16.10.255
- 172.16.10.17 through 172.16.10.31
Q.10: Refer to the exhibit. What does JAX do with link-state packets from ORL ?
- Sends out the individual link-state packets out the interface connected to BOS
- Queries BOS to see if it has a better route
- Only adds it to the local routing table and performs no other actions
- Sends out its updated routing table to both ORL and BOS routers
Q.11: Which routers will router D receive hello packets ?
- C only
- B and C
- A, B, C, and E
- A and E
Q.12: What two statements ly describe the link state routing process ?
- All routers in the area have link state databases
- LSPs use the reserved multicast address of 188.8.131.52 to reach neighbors
- Each router in the area floods LSPs to all neighbors
- Routing loops are prevented by running the Diffusing Update Algorithm (DUAL)
Q.13: What feature do modern link-state protocols provide to minimize processing and memory requirements ?
- Strict split horizon rules to reduce routing table entries
- Splitting routing topologies into smaller areas
- Using update timers to restrict routing updates
- Assigning lower process priorities to route calculations
Q.14: What is the final step in the link state routing process ?
- DUAL algorithm is run to find best path to destination networks
- LSPs are flooded to all neighbors to converge the network
- SPF computes best path to each destination network
- Successors are placed into the routing table
Q.15: If a host broadcasts a frame that includes a source and destination hardware address, and its purpose is to assign IP addresses to itself, which protocol at the Network layer does the host use ?
Q.16: What range of addresses can be used in the first octet of a Class B network address ?
Q.17: Which protocol works at the Internet layer and provides a connection service between hosts ?
Q.18: How many bytes is an Ethernet address ?
Q.19: Refer to the exhibit. Router B receives a packet with a destination address of 10.16.1.97. What will router B do ?
- Forward the packet via the route to 10.16.1.64
- Use the default route
- Drop the packet
- Forward the packet via the route to 10.16.1.0
Q.20: Refer to the exhibit. What kind of information would be seen in an LSP sent from router JAX to router ATL ?
- A list of all the routing protocols in use
- Cost of the link
- Hop count
- Uptime of the route
Q.21: What action does a link-state router take immediately upon receipt of an LSP from a neighboring router ?
- Runs the Bellman-Ford algorithm
- Floods the LSP to neighbors
- Computes the best path to the destination network
- Calculates the SPF algorithm
Q.22: When are link-state packets sent to neighbors ?
- Every 180 seconds
- When a link goes up or down
- After the holddown time expires
- Every 30 seconds
Q.23: What two events will cause a link state router to send LSPs to all neighbors ?
- Whenever the network topology changes
- Upon initial startup of router or routing protocol
- Immediately after the Bellman-Ford algorithm has run
- 30 second timer expires
- Immediately after the DUAL FSM has built the topology database
Q.24: Which database or table must be identical on all link-state routers within an area in order to construct an accurate SPF tree ?
- Routing table
- Neighbor table
- Adjacency table
- Link-state database
Q.25: What protocol is used to find the hardware address of a local device ?