GATE CS : Computer Networks Champion Quiz 1 for GATE & PSU CS Exams

Question 1

Which among the following is not covered under OSI layer?

Question 2

Choose the best matching between Group 1 and Group 2
Group-1
P. Data link layer
Q. Network layer
R. Transport layer
Group-2
1. Ensures reliable transport of data over a physical point-to-point link
2. Encodes/decodes data for physical transmission
3. Allows end-to-end communication between two processes
4. Routes data from one network node to the next

Question 3

In the following pairs of OSI protocol layer/sub-layer and its functionality, the INCORRECT pair is

Question 4

In Ethernet when Manchester encoding is used, the bit rate is:

Question 5

The Internet network layer protocol is:

Question 6

There are n stations in a slotted LAN. Each station attempts to transmit with a probability p in each time slot. What is the probability that ONLY one station transmits in a given time slot?

Question 7

The distance between two stations M and N is L kilometers. All frames are K bits long. The propagation delay per kilometer is t seconds. Let R bits/second be the channel capacity. Assuming that processing delay is negligible, the minimum number of bits for the sequence number field in a frame for maximum utilization, when the sliding window protocol is used, is:

Question 8

In a token ring network the transmission speed is 10⁷ bps and the propagation speed is 200 metres/micro second.The 1–bit delay in this network is equivalent to:

Question 9

Spanning tree of graph is like a subgraph which carries all vertices which is similar to a tree. Further it is analysed that a graph carries many spanning trees which will complete graph that contains four vertices.

In a bridge network there are number of LANs which are joined in spanning tree. In this the root bridge has least number with data units being shortest. Here the ports conflicts are solved with lower index value. In this the bridge close to root is strong with preference given to lowest serial.

Now in a LAN network, select which sequence shows depth first in terms of spanning tree of bridges?

Question 10

Spanning tree of graph is like a subgraph which carries all vertices which is similar to a tree. Further it is analysed that a graph carries many spanning trees which will complete graph that contains four vertices.

As per the LAN network which is connected by bridges as shown, there appears to be packets which are sent from LAN to bridge. It is found that because of certain path as seen among two LANs, the packets are routed by multiple bridges. So select the correct option which shows the necessity of spanning tree algorithm applied in case for bridge-routing?