Web Page

$$\small{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline \textbf{Year}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum} \\\hline\textbf{1 Mark Count}&1&3&2&3&2&3&1&2.3&3 \\\hline\textbf{2 Marks Count}&4&2&3&1&4&3&1&2.8&4 \\\hline\textbf{Total Marks}&9&7&8&5&10&9&\bf{5}&\bf{8}&\bf{10}\\\hline \end{array}}}$$

Recent questions in Computer Networks

1
In the given network system, station A needs to send a payload of 1600 B from its network layer to station B. If fragmentation is done, then the actual data size to be transmitted is ______________
2
In the given network system, station A needs to send a payload of 1600B from its network layer to station B. If fragmentation is done, then the actual data size to be transmitted is?
3
Consider a TCP connection between two machines (A and B) in an environment with 0% packet loss. Assume the round trip time (RTT) between the two machines is 4 [seconds], and the segment size is 3 [Kbytes]. The bandwidth of the connection is 500 [kbps]. What is the ... buffer close to zero. I.e., TCP packets are continuously, back-to-back, sent out of the sender before the first ack arrives back.)
4
A system uses selective repeat protocol with window size of 4. If each packet carries 5000 bits , then the time taken to tranfer 5 milion bits of data, if the distance between sender and receiver is 2500km , the propagation speed is 2* 10^8 m/s and data rate is 1Mbps. We assume no data or ACK is lost
5
Which has lower latency amongst “Switch” and “Router”. And why ?
6
answer given as 255.255.255.254 how it is correct please check??
7
A Selective Repeat ARQ is using 7 bits to represent the sequence numbers.The maximum window size is __________. (ans is 64) why It is
8
Consider the following statements: S1: In ethernet, jamming signal ensure that all nodes using the channel are aware for their transmission(s) failed. S2: Bit stuffing ensures that all frames are of the same size. Which of the following is true? (a) Only S1 (b) Only S2 © Both S1 and S2 (d) Neither S1 nor S2
9
10
1 vote
11
Let us consider a scenario of sending real-time voice from Host A to Host B over a packet-switched network. Host A converts analog voice to a digital $32$ kbps bit stream on the fly. Host A then groups the bits into $44$-byte packets. There is one link between Hosts A and B; its ... A) until the bit is decoded (as part of the analog signal at Host B)? $11$ ms $88$ ms $30$ ms $30.088$ ms
12
Consider a TCP connection between two machines (A and B) in an environment with 0% packet loss. Assume the round trip time (RTT) between the two machines is 4 [seconds], and the segment size is 3 [Kbytes]. The bandwidth of the connection is 500 [kbps]. What is ... to be mentioned as minimum possible window size.. Can this be possible plz explain me how to solve this problem if it is correct .
1 vote
13
If TCP RTT is currently 20 ms and following acknowledgement come in after 22,24 and 23 ms respectively. What is new RTT estimate ? 28.527 28.82 20.82 21.22
14
A leaky Bucket with capacity 200MB is at host network interface. The data rate on the network is 2MBps. If the Host has 450 MB to send on the network and it sends data in a burst, then the maximum data speed from the host in order that no data is lost is ______MBps
15
For a class C network if IP address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224 the decimal value of last octet of last host of sixth subnet is __________
1 vote
16
A token bucket scheme is used for traffic shaping. a new token is put into the bucket at every 10 micro second. assume each token pick one packet which contain 2B of data. it is observed that initial capacity of bucket is 10 Mb. the computer can transmit at full speed of 8 Mbps for ... ) = MT what is R? is it token arriving rate (0.1M/s) or data transmitted equivalent to token (16bits * 0.1M/s) ?
17
What is optimal and Estimated Cost here, and why eliminate option A and C, why option B is correct.
Consider a TCP connection using the multiplicative additive congestion control algorithm where the window size is 1 MSS and the threshold is 32 MSS. At the $8^{th}$ transmission timeout occurs and enters in the congestion detection phase. The value of the window size (in MSS) at the ... end of $12^{th}$ transmission. So we have to take the window size after the 12 RTTs right and not at 12th RTT?