Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
aniketh317
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by aniketh317
9
answers
1
GATE CSE 2021 Set 1 | GA Question: 9
Given below are two statements $1$ and $2$, and two conclusions $\text{I}$ and $\text{II}$ $\text{Statement 1:}$ All bacteria are microorganisms. $\text{Statement 2:}$ All pathogens are microorganisms. $\text{Conclusion I:}$ Some pathogens are ... Either conclusion $\text{I}$ or $\text{II}$ is correct Neither conclusion $\text{I}$ nor $\text{II}$ is correct
Given below are two statements $1$ and $2$, and two conclusions $\text{I}$ and $\text{II}$$\text{Statement 1:}$ All bacteria are microorganisms.$\text{Statement 2:}$ All ...
14.0k
views
commented
Feb 26, 2021
Analytical Aptitude
gatecse-2021-set1
analytical-aptitude
logical-reasoning
statements-follow
2-marks
+
–
3
answers
2
GATE CSE 2021 Set 1 | Question: 44
A $\text{TCP}$ server application is programmed to listen on port number $P$ on host $S$. A $\text{TCP}$ client is connected to the $\text{TCP}$ server over the network. Consider that while the $\text{TCP}$ connection was active, the ... receive a $\text{RST}$ segment If the client sends a packet after the server reboot, it will receive a $\text{FIN}$ segment
A $\text{TCP}$ server application is programmed to listen on port number $P$ on host $S$. A $\text{TCP}$ client is connected to the $\text{TCP}$ server over the network.C...
12.7k
views
commented
Feb 21, 2021
Computer Networks
gatecse-2021-set1
multiple-selects
computer-networks
tcp
2-marks
+
–
6
answers
3
GATE CSE 2021 Set 1 | Question: 36
Let $G=(V, E)$ be an undirected unweighted connected graph. The diameter of $G$ is defined as: $\text{diam}(G)=\displaystyle \max_{u,v\in V} \{\text{the length of shortest path between $u$ and $v$}\}$ Let $M$ be the adjacency matrix of $G$. Define graph $G_2$ ... $\text{diam}(G_2) = \text{diam}(G)$ $\text{diam}(G)< \text{diam}(G_2)\leq 2\; \text{diam}(G)$
Let $G=(V, E)$ be an undirected unweighted connected graph. The diameter of $G$ is defined as:$$\text{diam}(G)=\displaystyle \max_{u,v\in V} \{\text{the length of shortes...
9.8k
views
answered
Feb 20, 2021
Graph Theory
gatecse-2021-set1
graph-theory
graph-connectivity
2-marks
+
–
5
answers
4
GATE CSE 2021 Set 1 | Question: 39
For a Turing machine $M$, $\langle M \rangle$ denotes an encoding of $M$ ... decidable $L_1$ is decidable and $L_2$ is undecidable $L_1$ is undecidable and $L_2$ is decidable Both $L_1$ and $L_2$ are undecidable
For a Turing machine $M$, $\langle M \rangle$ denotes an encoding of $M$. Consider the following two languages.$$\begin{array}{ll} L_1 = \{ \langle M \rangle \mid M \text...
9.8k
views
answered
Feb 20, 2021
Theory of Computation
gatecse-2021-set1
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability
easy
2-marks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register