Time Left - 10:00 mins
GATE 2020 : Computer Networks Quiz 4
Attempt now to get your rank among 538 students!
Question 1
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D.
Question 2
To reduce looping in an algorithm, we:
Question 3
Which one of the following is TRUE about the interior gateway routing protocols – Routing Information Protocol (RIP) and Open Shortest Path First (OSPF)?
Question 4
Some algorithms (routing) assume that the end node will determine the entire. Such algorithms are reffered as
Question 5
Consider a token bucket with maximum rate R = 25 Mbps. Suppose we want to make sure that the maximum rate can only be sent for atmost 5 seconds at a time, and atmost 150 Mbits can be sent over any 10 second window. Compute the required value for the token refresh rate (r) in Mbps.
Question 6
Consider the following statement.
(1) Path vector protocol is implemented using Border Gateway Protocol (BGP).
(2) Link state routing algorithm is implemented using Open shortest path first. (OSPF).
(3) Path vector protocol is same as Distance vector protocol.
(4) Routing algorithm is used to build the routing table at router.
Which of the following is false?
(1) Path vector protocol is implemented using Border Gateway Protocol (BGP).
(2) Link state routing algorithm is implemented using Open shortest path first. (OSPF).
(3) Path vector protocol is same as Distance vector protocol.
(4) Routing algorithm is used to build the routing table at router.
Which of the following is false?
- 538 attempts
- 1 upvote
- 5 comments
Jan 12GATE & PSU CS
