CCNA Quiz Online Test Mcqs

Test Instructions
Test Name	:	CCNA MCQs
Subject	:	Computer General
Test Type	:	Mcqs
Total Question	:	25
Total Marks	:	50
Total Time	:	20 Minutes

This quiz includes mcq’s questions about the CCNA. This quiz will help you test and improve your knowledge about it will ease as it includes all the important questions related to it. You will be given multiple options for each question and need to select the correct one.

CCNA Quiz Online Test Mcqs Questions with Answers

Uncategorized

Question 1 of 25

Uncategorized

1. Why is it difficult for routing loops to occur in networks that use link-state routing?

Routers use hold-down timers to prevent routing loops

Each router builds a complete and synchronized view of the network

Each router builds a simple view of the network based on hop count

Routers flood the network with LSAs to discover routing loops

Question 1 of 25

Question 2 of 25

2. What range of addresses can be used in the first octet of a Class C address?

203-234

129-192

1-127

192-223

Question 2 of 25

Question 3 of 25

3. What two events will cause a link state router to send LSPs to all neighbors?

Immediately after the DUAL FSM has built the topology database

Immediately after the Bellman-Ford algorithm has run

Whenever the network topology changes

30 second timer expires

Upon initial startup of router or routing protocol

Question 3 of 25

Question 4 of 25

4. Which protocol working at the Transport layer provides a connectionless service between hosts?

ARP

UDP

TCP

Question 4 of 25

Question 5 of 25

5. What range of addresses can be used in the first octet of a Class B network address?

128-190

1-127

128-191

129-192

1-126

Question 5 of 25

Question 6 of 25

6. 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?

ICMP

TCP

IPX

ARPA

RARP

Question 6 of 25

Question 7 of 25

7. Refer to the exhibit. Router B receives a packet with a destination address of 10.16.1.97. What will router B do?

Use the default route

Drop the packet

Forward the packet via the route to 10.16.1.0

Forward the packet via the route to 10.16.1.64

Question 7 of 25

Question 8 of 25

8. What is the final step in the link state routing process?

SPF computes best path to each destination network

Successors are placed into the routing table

LSPs are flooded to all neighbors to converge the network

DUAL algorithm is run to find best path to destination networks

Question 8 of 25

Question 9 of 25

9. Which routers will router D receive hello packets?

A, B, C, and E

C only

B and C

A and E

Question 9 of 25

Question 10 of 25

10. Which protocol works at the Transport layer and provides virtual circuits between hosts?

TCP

ARP

UDP

Question 10 of 25

Question 11 of 25

11. Which protocol works at the Internet layer and provides a connection service between hosts?

ARP

UDP

TCP

Question 11 of 25

Question 12 of 25

12. What two statements correctly describe the link state routing process?

LSPs use the reserved multicast address of 224.0.0.10 to reach neighbors

All routers in the area have link state databases

Each router in the area floods LSPs to all neighbors

Routing loops are prevented by running the Diffusing Update Algorithm (DUAL)

Question 12 of 25

Question 13 of 25

13. When are link-state packets sent to neighbors?

After the holddown time expires

When a link goes up or down

Every 180 seconds

Every 30 seconds

Question 13 of 25

Question 14 of 25

14. What action does a link-state router take immediately upon receipt of an LSP from a neighboring router?

Floods the LSP to neighbors

Calculates the SPF algorithm

Runs the Bellman-Ford algorithm

Computes the best path to the destination network

Question 14 of 25

Question 15 of 25

15. How many bytes is an Ethernet address?

Question 15 of 25

Question 16 of 25

16. Which algorithm is run by link-state routing protocols to calculate the shortest path to destination networks?

Diffie-Hellman

Bellman-Ford

DUAL

Dijkstra

Question 16 of 25

Question 17 of 25

17. Which database or table must be identical on all link-state routers within an area in order to construct an accurate SPF tree?

Adjacency table

Routing table

Link-state database

Neighbor table

Question 17 of 25

Question 18 of 25

18. 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.31

172.16.10.20 through 172.16.10.22

172.16.10.17 through 172.16.10.30

172.16.10.1 through 172.16.10.255

172.16.10.16 through 172.16.10.23

Question 18 of 25

Question 19 of 25

19. If a router interface is congested, which protocol in the IP suite is used to tell neighbor routers?

TCP

ICMP

RARP

ARP

Question 19 of 25

Question 20 of 25

20. Refer to the exhibit. What does JAX do with link-state packets from ORL?

Only adds it to the local routing table and performs no other actions

Queries BOS to see if it has a better route

Sends out the individual link-state packets out the interface connected to BOS

Sends out its updated routing table to both ORL and BOS routers

Question 20 of 25

Question 21 of 25

21. What feature do modern link-state protocols provide to minimize processing and memory requirements?

Strict split horizon rules to reduce routing table entries

Assigning lower process priorities to route calculations

Splitting routing topologies into smaller areas

Using update timers to restrict routing updates

Question 21 of 25

Question 22 of 25

22. Refer to the exhibit. What kind of information would be seen in an LSP sent from router JAX to router ATL?

Cost of the link

Uptime of the route

A list of all the routing protocols in use

Hop count

Question 22 of 25

Question 23 of 25

23. What protocol is used to find the hardware address of a local device?

ARP

ICMP

BootP

RARP

Question 23 of 25

Question 24 of 25

24. What are two advantages of using a link-state routing protocol instead of a distance vector routing protocol?

The topology database eliminates the need for a routing table.

Link-state protocols require less router processor power than distance vector protocols

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

Question 24 of 25

Question 25 of 25

25. What speeds up convergence in a network using link-state routing?

Updates sent only to directly connected neighbors

Updates that include complete routing tables

Updates triggered by network changes

Updates sent at regular intervals

Question 25 of 25

0/5 (0 Reviews)

You Can Learn and Gain more Knowledge through our Online Quiz and Testing system Just Search your desired Preparation subject at Gotest.

Check Other Related Topics

Adobe Photoshop Quiz Online Test Mcqs

Database Management System (DBMS) Quiz Online Test Mcqs

Corel DRAW Quiz Online Test Mcqs

Computer MS Word Shortcuts Keys Info Quiz 2 Online Important Mcqs Test

HTML Basics Info Quiz Online Mcq’s Questions Test

Twitter Basic Info Quiz Online GK Test

Perl Quiz Online Test Mcqs

PHP Quiz Online Test Mcqs

2016-08-29

Zubair Asghar

Facebook
Twitter
Google +
Pinterest

Newspaper Jobs in Pakistan




All Daily Jobs in Pakistan click here

CCNA Quiz Online Test Mcqs

Test Instructions