Time Left - 30:00 mins

GATE 2019 -National Champion Test -3: (Computer Networks ) (App update required to attempt this test)

Attempt now to get your rank among 671 students!

Question 1

Consider a network connecting two systems located 8000 kilometers apart. The bandwidth of the network is 500×106 bits per second. The propagation speed of the media is 4×106 meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is 107 bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible. Then, the minimum size in bits of the sequence number field has to be ____________.

Question 2

Which one of the following uses UDP as the transport protocol?

Question 3

Consider two problem which are observed in wireless network:
1) Hidden Node Problem
2) Exposed Node Problem
Which of the following is true?

Question 4

Match the following:

Question 5

CSMA/CD LAN of 1 Gpbs is to be designed over 100 m cable without repeater. What is the minimum frame size (in bits) that Data Linked Layer should consider if cable support signal speed of 200000 Km/sec?

Question 6

We have a network 210.50.60.0, we have to divide it into 6 equal subnets, give network and broadcast address of each subnet.

Question 7

Suppose that the maximum transmit window size for a TCP connection is 12000 bytes. Each packet consists of 2000 bytes. At some point of time connection is in slow-start phase with a current transmit window of 4000 bytes. Subsequently, the transmitter receives two acknowledgments, assume that no packets are lost and there are no time-outs, then what is the maximum possible value of (in bytes) the current transmit window?

Question 8

The minimum positive integer p such that 2p modulo 11 = 1 is

Question 9

The routing table for C and entire network using the link state protocol is given below.

Assume that the network is stable and all the routing tables at all routers A, B, C,..., H are successfully updated. The respective values for X, Y and Z are

Question 10

Let the size of congestion window of a TCP connection be 32 KB when a timeout occurs. The round trip time of the connection is 100 m sec and the maximum segment size used is 2 KB. The time taken (in m sec) by the TCP connection to get back to 32 KB congestion window is _________.

Question 11

Station a need to send a message consisting of 10 packets to station B using a sliding window of size 4. All packets are ready and can be transferred immediately. Selective repeat and GBN are used at 2 different times and every 5th packet get lost for both protocols. (ACK’s from B never gets lost). Let x and y be the number of transmissions that A has to make in selective repeat and GBN respectively to ensure safe delivery to B. Then x+y=?

Question 12

What must be the minimum window size of the sender to transmit 12500 bytes of data, over a 10 Gbps link. (Assume propagation delay of 5 ms). Also assume 100 % utilization of link for sliding window protocol and acknowledgment is short.
  • 671 attempts
  • 3 upvotes
  • 7 comments
Mar 30GATE & PSU CS