# Computer Network Quiz Set 4

This quiz is based on Computer Network question asked in GATE exams. This quiz is helpful for aspiring candidates of GATE, UGC NET and other competitive exams.

Congratulations - you have completed .
You scored %%SCORE%% out of %%TOTAL%%.
Your performance has been rated as %%RATING%%

Your answers are highlighted below.

Question 1 |

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

**[GATE 2007, 1 Marks]**Half the baud rate | |

Twice the baud rate | |

Same as the baud rate | |

None of these |

Question 2 |

A broadcast channel has 10 nodes and total capacity of 10 Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of \(80\mu s\) is to poll the next node. Whenever a node is polled, it is allowed to transmit a maximum of 1000 bytes. The maximum throughput of the broadcast channel is

**[GATE 2007, 2 Marks]**1 Mbps | |

10 Mbps | |

11 Mbps | |

100 Mbps |

Question 3 |

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?

**[GATE 2007, 2 Marks]**\(n p (1 - p)^{n-1}\) | |

\( (1 - p) ^ {n-1}\) | |

\( p ^ {n-1}\) | |

\( 1 - (1 - p) ^ {n-1}\) |

Question 4 |

The distance between two stations M and N is \(L\) kilometers. All frames are \(K\) bit longs. The propagation delay per kilometer is \(t\) seconds. Let \(R\) bits/sec 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

**[GATE 2007, 2 Marks]**$$\left [ \log_2{\frac{2LtR + 2K}{K}}\right ]$$ | |

$$\left [ \log_2{\frac{2LtR}{K}}\right ]$$ | |

$$\left [ \log_2{\frac{2LtR + K}{K}}\right ]$$ | |

$$\left [ \log_2{\frac{2LtR + K}{2K}}\right ]$$ |

Question 5 |

The minimum frame size required for a CSMA/CD based computer network running at 1 Gbps on a 200m cable with a link speed of \(2 \times 10^8\)m/s is

**[GATE 2008, 2 Marks]**125 bytes | |

250 bytes | |

500 bytes | |

None of these |

Question 6 |

Consider a source computer S transmitting a file of size \(10^6\) bits to a destination computer D over a network of two routers \(R_1\) and \(R_2\) and three links \(L_1\), \(L_2\) and \(L_3\). \(L_1\) connect \(S\) to \(R_1\), \(L_2\) connects \(R_1\) to \(R_2\), and \(L_3\) connects \(R_2\) to \(D\). Let each link be of length 100 km. Assume signals travel over each link at a speed of \(10^8\) meters per second. Assume that the link bandwidth on each link is 1 Mbps. Let the file be broken down into 1000 packets each of size 1000 bits. Find the total sum of transmission and propagation delays in transmitting the file from \(S\) to \(D\)?

**[GATE 2012, 2 Marks]**1005 ms | |

1010 ms | |

3000 ms | |

3003 ms |

Question 7 |

Determine the maximum length of the cable (in km) for transmitting data at a rate of 500 Mbps in an Ethernet LAN with frames of size 10,000 bits. Assume the signal speed in the cable to be 2,00,000 km/s.

**[GATE 2013, 2 Marks]**1 | |

2 | |

2.5 | |

5 |

Question 8 |

Consider a CSMA/CD network that transmits data at a rate of 100 Mbps (\(10^8\) bits per second) over a 1 km (kilometer) cable with no repeaters. If the minimum frame size required for this network is 1250 bytes, what is the signal speed (km/s) in the cable?

**[GATE 2015 (Set 3), 1 Marks]**8000 | |

10000 | |

16000 | |

20000 |

Question 9 |

Which of the following protocols is NOT used to resolve one form of address to another one?

**[GATE 2006 (Set 1), 2 Marks]**DNS | |

ARP | |

DHCP | |

RARP |

Question 10 |

Which of the following is/are example(s) of state full application layer protocol?

(I.) HTTP (II.) FTP (III.) DHCP (IV.) POP3

(I.) HTTP (II.) FTP (III.) DHCP (IV.) POP3

**[GATE 2016 (Set 1), 2 Marks]**I and II only | |

II and III only | |

II and IV only | |

IV only |

Once you are finished, click the button below. Any items you have not completed will be marked incorrect.

There are 10 questions to complete.