Register

Web Page

Concept of layering.OSI and TCP/IP Protocol Stacks; Basics of packet, circuit and virtual circuit-switching; Data link layer: framing, error detection, Medium Access Control, Ethernet bridging; Routing protocols: shortest path, flooding, distance vector and link state routing; Fragmentation and IP addressing, IPv4, CIDR notation, Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT); Transport layer: flow control and congestion control, UDP, TCP, sockets; Application layer protocols: DNS, SMTP, HTTP, FTP, Email.

.$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}& \textbf{2024-1} & \textbf{2024-2} & \textbf{2023}&  \textbf{2022} & \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 3&3&2& 2 &1&1&1&2&3
\\\hline\textbf{2 Marks Count} & 3&3&3& 4 &4&3&3&3.33&4
\\\hline\textbf{Total Marks} & 9&9&8& 10 &9&7&\bf{7}&\bf{8.67}&\bf{10}\\\hline
\end{array}}}$$

Filter

Recent questions in Computer Networks

#4501
12.4k
views
3 answers
28 votes
GATE IT 2007 | Question: 70
You are given the following four bytes : $\begin{array}{| c | c | c | c |} \hline 10100011 & 00110111 & 11101001 & 10101011 \\\hline \end{array}$ ... $ encoding of the above four bytes?$\text{zdp}$\text{fpq}$\text{qwA}$\text{oze}$
User Avatar
#4502
6.7k
views
4 answers
31 votes
GATE IT 2007 | Question: 69
Consider the following clauses:Not inherently suitable for client authentication.Not a state sensitive protocol.Must be operated with more than one server.Suitable for structured message ... SMTP-i; HTTP-ii; IMAP-iii; DNS-iv; FTP-v
User Avatar
#4503
11.1k
views
6 answers
47 votes
GATE IT 2007 | Question: 64
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 ... of the broadcast channel is:$1$ Mbps$100/11$ Mbps$10$ Mbps$100$ Mbps
User Avatar
#4504
19.7k
views
8 answers
62 votes
GATE IT 2007 | Question: 63
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending ... $4.26$4.53$5.26$
User Avatar
#4505
13.4k
views
3 answers
57 votes
GATE IT 2007 | Question: 62
Let us consider a statistical time division multiplexing of packets. The number of sources is $10$. In a time unit, a source transmits a packet of $1000$ bits. The ... $4.45$3.45$0$
User Avatar
#4506
18.7k
views
6 answers
39 votes
GATE IT 2007 | Question: 61
In the waveform (a) given below, a bit stream is encoded by Manchester encoding scheme. The same bit stream is encoded in a ... respectively$1000010111$ and Integral Manchester respectively$0111101000$ and Integral Manchester respectively
User Avatar
#4507
9.8k
views
4 answers
42 votes
GATE IT 2007 | Question: 60
For the network given in the figure below, the routing tables of the four nodes $A$, $E$, $D$ and $G$ are shown. Suppose that $F$ has estimated its delay to its neighbors, ...
User Avatar
#4508
26.3k
views
7 answers
39 votes
GATE IT 2007 | Question: 43
An error correcting code has the following code words: $00000000, 00001111, 01010101, 10101010, 11110000$. What is the maximum number of bit errors that can be corrected?$0$1$2$3$
User Avatar
#4509
6.7k
views
3 answers
36 votes
GATE IT 2007 | Question: 18
A firewall is to be configured to allow hosts in a private network to freely open TCP connections and send packets on open connections. ... circuitA finite automatonA pushdown automaton with one stackA pushdown automaton with two stacks
User Avatar
#4510
8.3k
views
3 answers
22 votes
GATE IT 2007 | Question: 15
Consider the following two statements:A hash function (these are often used for computing digital signatures) is an injective function.A. encryption technique such as ... is falseStatement (ii) is true and the other is falseBoth are true
User Avatar
#4511
11.0k
views
4 answers
42 votes
GATE IT 2007 | Question: 14
Consider a $TCP$ connection in a state where there are no outstanding $ACK$s. The sender sends two segments back to back. The sequence numbers of the first and second segments ... $ and $290$230$ and $291$60$ and $231$60$ and $230$
User Avatar
#4512
11.8k
views
5 answers
34 votes
GATE IT 2007 | Question: 13
Consider the following statements about the timeout value used in TCP.The timeout value is set to the RTT (Round Trip Time) measured during TCP connection establishment for the entire ... $(iii)$ is true$(i), (ii)$ and $(iii)$ are false
User Avatar
#4513
20.5k
views
3 answers
65 votes
GATE IT 2008 | Question: 85
Host $X$ has $IP$ address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to an­other host $Y$ with $IP$ address $192.168.1.80$. Router $R1$ ... $192.168.1.110$192.168.1.135$192.168.1.155$
User Avatar
#4514
12.5k
views
8 answers
55 votes
GATE IT 2008 | Question: 84
Host $X$ has IP address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to an­other host $Y$ with IP address $192.168.1.80$. ... $2$3$6$
User Avatar
#4515
11.5k
views
4 answers
21 votes
GATE IT 2008 | Question: 70
The total number of keys required for a set of $n$ individuals to be able to communicate with each other using secret key and public key cryptosystems, respectively are:$n(n-1)$ and $2n$2n ... - 1)}{2}$ and $2n$\dfrac{n(n - 1)}{2}$ and $n$
User Avatar
#4516
15.6k
views
3 answers
47 votes
GATE IT 2008 | Question: 69
The three way handshake for $\text{TCP}$ connection establishment is shown below. Which of the following statements are TRUE?$S1:$ Loss of $\text{SYN} + \text{ACK}$ from the ... $S1$ and $S4$ only$S1$ and $S3$ only$S2$ and $S4$ only
User Avatar
#4517
16.4k
views
2 answers
40 votes
GATE IT 2008 | Question: 68
Which of the following statements are TRUE?S1: TCP handles both congestion and flow controlS2: UDP handles congestion but not flow controlS3: Fast retransmit deals with congestion but ... $S3$only$S3$and $S4$ only$S1$, $S3$ and $S4$ only
User Avatar
#4518
9.9k
views
4 answers
33 votes
GATE IT 2008 | Question: 67
Two popular routing algorithms are Distance Vector(DV) and Link State (LS) routing. Which of the following are true?(S1): Count to infinity is a problem only with DV ... LSS1, S2 and S4 onlyS1, S3 and S4 onlyS2 and S3 onlyS1 and S4 only
User Avatar
#4519
16.1k
views
8 answers
41 votes
GATE IT 2008 | Question: 66
Data transmitted on a link uses the following $2D$ parity scheme for error detection:Each sequence of $28$ bits is arranged in a $4\times 7$ matrix (rows $r_0$ ... $ corrupted bits. What is the mini­mum possible value of $n$?$1$2$3$4$
User Avatar
#4520
8.6k
views
3 answers
28 votes
GATE IT 2008 | Question: 65
The minimum frame size required for a CSMA/CD based computer network running at $1\text{Gbps}$ on a $200m$ cable with a link speed of $2 \times10^{8}\text{m/sec}$ is:$125 \text{bytes}$250 \text{bytes}$500 \text{bytes}$None of the above
User Avatar
Page: