Time Left - 20:00 mins

GATE CS : Computer Networks Champion Quiz 4

Attempt now to get your rank among 883 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

In a network of LANs connected by bridges, packets are sent from one LAN to another through intermediate bridges. Since more than one path may exist between two LANs, packets may have to be routed through multiple bridges. Why is the spanning tree algorithm used for bridge-routing?

Question 3

Which of the following is NOT true with respect to a transparent bridge and a router?

Question 4

In data communication, computer network node are:

Question 5

An IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an IP packet of size 4404 bytes with an IP header of length 20 bytes. The values of the relevant fields in the header of the third IP fragment generated by the router for this packet are

Question 6

An IP router implementing Classless Inter-domain Routing (CIDR) receives a packet with address 131.23.151.76. The router’s routing table has the following entries:

The identifier of the output interface on which this packet will be forwarded is `______.

Question 7

A computer on a 10Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2Mbps. It is initially filled to capacity with 16 Megabits. What is the maximum duration for which the computer can transmit at the full 10 Mbps?

Question 8

Multidestination routing

Question 9

To reduce looping in an algorithm, we:

Question 10

The message 11001001 is to be transmitted using the CRC polynomial x³ + 1 to protect it from errors. The message that should be transmitted is:

883 attempts
6 upvotes
49 comments

Tags :

GATE & PSU CS Computer Networks

Jun 25GATE & PSU CS