Scribd
Upload
14 views8 pages

Routing Protocol

Uploaded by

rohit.s.rawat9816
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views8 pages

Routing Protocol

Uploaded by

rohit.s.rawat9816
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Q1.

Consider an IP packet with a length of 4,500 bytes that includes a


24-byte IPv4 header and a 40-byte TCP header. The packet is forwarded
to an IPv4 router that supports a Maximum Transmission Unit (MTU) of
600 bytes. Assume that the length of the IP header in all the outgoing
fragments of this packet is 24 bytes. Assume that the fragmentation offset
value stored in the first fragment is 0. The fragmentation offset value
stored in the third fragment is ________.
(a) 0 (b) 72
(c) 144 (d) 216

Q2. Consider three machines M, N, and P with IP addresses 100.10.5.2,


100.10.5.5, and 100.10.5.6 respectively. The subnet mask is set to
255.255.255.252 for all the three machines. Which one of the following
is true?
(a) M, N, and P all belong to the same subnet
(b) Only M and N belong to the same subnet
(c) Only N and P belong to the same subnet
(d) M, N, and P belong to three different subnets

Q3. Suppose that in an IP-over-Ethernet network, a machine X wishes to


find the MAC address of another machine Y in its subnet. Which one of
the following techniques can be used for this?
(a) X sends an ARP request packet to the local gateway’s IP address
which then finds the MAC address of Y and sends to X
(b) X sends an ARP request packet to the local gateway’s MAC address
which then finds the MAC address of Y and sends to X
(c) X sends an ARP request packet with broadcast MAC address in its
local subnet
(d) X sends an ARP request packet with broadcast IP address in its local
subnet
Q4. 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. 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)

Q5. Consider the same data as given in previous question. After the
update in the previous question, the link N1-N2 goes down. N2 will
reflect this change immediately in its distance vector as cost, infinite.
After the NEXT ROUND of update, what will be cost to N1 in the
distance vector of N3?
(a) 3 (b) 9
(c) 10 (d) Infinite
Q6. Consider a network with 6 routers R1 to R6 connected with links
having weights as shown in the following diagram:

All the routers use the distance vector-based routing algorithm to


update their routing tables. Each router starts with its routing table
initialized to contain an entry for each neighbor with the weight of the
respective connecting link. After all the routing tables stabilize, how
many links in the network will never be used for carrying any data?
(a) 4 (b) 3
(c) 2 (d) 1

Q7. Consider the data given in above question. Suppose the weights of
all unused links in the previous question are changed to 2 and the
distance vector algorithm is used again until all routing tables
stabilize. How many links will now remain unused?
(a) 0 (b) 1
(c) 2 (d) 3
Q8. Which one of the following is TRUE about interior Gateway
routing protocols - Routing Information Protocol (RIP) and Open
Shortest Path First (OSPF)?
(a) RIP uses distance vector routing and OSPF uses link state routing
(b) OSPF uses distance vector routing and RIP uses link state routing
(c) Both RIP and OSPF use link state routing
(d) Both RIP and OSPF use distance vector routing

Q9. Count to infinity is a problem associated with


(a) link state routing protocol.
(b) distance vector routing protocol
(c) DNS while resolving host name.
(d) TCP for congestion control

Q10. Which of the following statements is TRUE?


(a) Both Ethernet frame and IP packet include checksum fields
(b) Ethernet frame includes a checksum field and IP packet includes a
CRC field
(c) Ethernet frame includes a CRC field and IP packet includes a
checksum field
(d) Both Ethernet frame and IP packet include CRC fields
Q11. Two popular routing algorithms are Distance Vector (DV) and
Link State (LS) routing. Which of the following are true?
S1: Count to infinity is a problem only with DV and not LS
routing
S2: In LS, the shortest path algorithm is run only at one node
S3: In DV, the shortest path algorithm is run only at one node
S4: DV requires lesser number of network messages than LS
(a) S1, S2 and S4 only
(b) S1, S3 and S4 only
(c) S2 and S3 only
(d) S1 and S4 only

Q12. Match with the suitable one:


List-I List-II
A. Multicast group membership 1. Distance vector routing
B. Interior gateway protocol 2. IGMP
C. Exterior gateway protocol 3. OSPF
D. RIP 4. BGP
(a) A-2, B-3, C-4, D-1 (b) A-2, B-4, C-3, D-1
(c) A-3, B-4, C-1, D-2 (d) A-3, B-1, C-4, D-2

Q13. What is routing algorithm used by OSPF routing protocol?


(a) Distance vector
(b) Flooding
(c) Path vector
(d) Link state

Q14. If there are five routers and six networks in intranet using link
state routing, how many routing tables are there?
(a) 1 (b) 5
(c) 6 (d) 11

Q15. Djikstra’s algorithm is used to


(a) Create LSAs
(b) Flood an internet with information
(c) Calculate the routing tables
(d) Create a link state database

Ans:
1. C
2. C
3. C
4. A
5. C
6. C
7. B
8. A
9. B
10. C
11. D
12. A
13. D
14. B
15. C

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy