Scribd
Upload
83 views

Test Dynamic Routing Protocols

This document contains a multiple choice test with 12 questions about networking topics such as IP addressing, routing protocols, NAT, and multicast routing. The test time is from 2:35 pm to 3:20 pm. Each question has 4 possible answer choices.

Uploaded by

Sahil Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
83 views

Test Dynamic Routing Protocols

This document contains a multiple choice test with 12 questions about networking topics such as IP addressing, routing protocols, NAT, and multicast routing. The test time is from 2:35 pm to 3:20 pm. Each question has 4 possible answer choices.

Uploaded by

Sahil Kumar
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

MULTIPLE CHOICE QUESTIONS

TEST TIME- (2.35 pm – 3.20 pm)

1. If a PC on an Ethernet network attempts to communicate with a host on a different


subnet, what destination IP address and destination MAC address will be placed in the
packet/frame header sent by the PC?
a. Dest. IP: IP address of default gateway. Dest. MAC: MAC address of default gateway.
b. Dest. IP: IP address of remote host. Dest. MAC: MAC address of default gateway.
c. Dest. IP: IP address of remote host. Dest. MAC: MAC address of remote host.
d. Dest. IP: IP address of remote host. Dest. MAC: MAC address of local PC.

2. What protocol is used to request a MAC address that corresponds to a known IPv4
address on the local network?
a. IGMP
b. TTL
c. ICMP
d. ARP

3. What is the network address and subnet mask of a default route?


a. 255.255.255.255/32
b. 0.0.0.0/32
c. 255.255.255.255/0
d. 0.0.0.0/0

4. What routing protocol characteristic indicates the believability of the routing


protocol (as opposed to other routing protocols)?
a. Weight
b. Metric
c. Administrative distance
d. SPF algorithm

5. Which of the following are distance-vector routing protocol features that can
prevent routing loops? (Choose two.)
a. Reverse path forwarding (RPF) check
b. Split horizon
c. Poison reverse
d. Rendezvous point

6. Which of the following is a distance-vector routing protocol with a maximum usable hop
count of 15?
a. BGP
b. IS-IS
c. RIP
d. OSPF

7. Which of the following routing protocols is an EGP?


a. BGP
b. IS-IS
c. RIP
d. OSPF

8. What NAT IP address is a public IP address that maps to an inside device?


a. Inside local
b. Inside global
c. Outside local
d. Outside global

9. What NAT variation automatically assigns an inside global address from a pool of available
addresses?
a. SNAT
b. DNAT
c. PAT
d. GNAT

10. What multicast protocol is used between clients and routers to let routers know which
of their interfaces are connected to a multicast receiver?
a. IGMP
b. PIM-DM
c. PIM-SM
d. SPT switchover

11. Consider the following three statements about link state and distance vector routing
protocols, for a large network with 500 network nodes and 4000 links.

[S1] The computational overhead in link state protocols is higher than in distance vector
protocols.
[S2] A distance vector protocol (with split horizon) avoids persistent routing loops, but not a
link state protocol.
[S3] After a topology change, a link state protocol will converge faster than a distance vector
protocol.

Which one of the following is correct about S1, S2, and S3?
a. S1, S2, and S3 are all true.
b. S1, S2, and S3 are all false.
c. S1 and S2 are true, but S3 is false
d. S1 and S3 are true, but S2 is false

12. Consider a network with five nodes, N1 to N5, as shown below.


The network uses a Distance Vector Routing protocol. Once the routes have stabilized, the
distance vectors at different nodes are as following.

N1: (0, 1, 7, 8, 4)
N2: (1, 0, 6, 7, 3)
N3: (7, 6, 0, 2, 6)
N4: (8, 7, 2, 0, 4)
N5: (4, 3, 6, 4, 0)

Each distance vector is the distance of the best-known path at the instance to nodes, N1 to
N5, where the distance to itself is 0. Also, all links are symmetric and the cost is identical in
both directions. In each round, all nodes exchange their distance vectors with their
respective neighbors. Then all nodes update their distance vectors. In between two rounds,
any change in cost of a link will cause the two incident nodes to change only that entry in
their distance vectors. 52. The cost of link N2-N3 reduces to 2(in both directions). After the
next round of updates, what will be the new distance vector at node, N3.

(A) (3, 2, 0, 2, 5)
(B) (3, 2, 0, 2, 6)
(C) (7, 2, 0, 2, 5)
(D) (7, 2, 0, 2, 6)

You might also like