Answers by Sherrinford03 / GATE Overflow for GATE CSE

4 votes

1

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.9k views

answered Feb 19, 2021

2 votes

2

GATE CSE 2021 Set 1 | Question: 43
A relation $R$ is said to be circular if $a\text{R}b$ and $b\text{R}c$ together imply $c\text{R}a$. Which of the following options is/are correct? If a relation $S$ is reflexive and symmetric, then $S$ is an equivalence relation ... and circular, then $S$ is an equivalence relation. If a relation $S$ is transitive and circular, then $S$ is an equivalence relation.

A relation $R$ is said to be circular if $a\text{R}b$ and $b\text{R}c$ together imply $c\text{R}a$.Which of the following options is/are correct?If a relation $S$ is refl...

8.2k views

answered Feb 19, 2021

6 votes

3

GATE CSE 2021 Set 1 | Question: 41
An $articulation$ $point$ in a connected graph is a vertex such that removing the vertex and its incident edges disconnects the graph into two or more connected components. Let $T$ be a $\text{DFS}$ tree obtained by doing $\text{DFS}$ ... is a descendent of $u$ in $T$, then all paths from $x$ to $y$ in $G$ must pass through $u$.

An $articulation$ $point$ in a connected graph is a vertex such that removing the vertex and its incident edges disconnects the graph into two or more connected component...

14.0k views

answered Feb 19, 2021

0 votes

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.9k views

answered Feb 19, 2021

0 votes

5

GATE CSE 2021 Set 1 | Question: 33
Consider the relation $R(P,Q,S,T,X,Y,Z,W)$ with the following functional dependencies. $PQ\rightarrow X;\quad P\rightarrow YX;\quad Q\rightarrow Y; \quad Y\rightarrow ZW$ Consider the decomposition of the relation $R$ into the ... $D_2$ is a lossless decomposition Both $D_1$ and $D_2$ are lossless decompositions Both $D_1$ and $D_2$ are lossy decompositions

Consider the relation $R(P,Q,S,T,X,Y,Z,W)$ with the following functional dependencies.$$PQ\rightarrow X;\quad P\rightarrow YX;\quad Q\rightarrow Y; \quad Y\rightarrow ZW$...

13.4k views

answered Feb 19, 2021

4 votes

6

GATE CSE 2021 Set 1 | Question: 26
Consider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed translation $\text{(SDT)}$ ... used to type-check syntactically correct boolean variable declarations and boolean expressions. The actions will lead to an infinite loop

Consider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed translation $\text{(SDT)}$ acti...

10.4k views

answered Feb 19, 2021

4 votes

7

GATE CSE 2021 Set 1 | Question: 14
Which of the following standard $C$ library functions will always invoke a system call when executed from a single-threaded process in a $\text{UNIX/Linux}$ operating system? $\textsf{exit}$ $\textsf{malloc}$ $\textsf{sleep}$ $\textsf{strlen}$

Which of the following standard $C$ library functions will always invoke a system call when executed from a single-threaded process in a $\text{UNIX/Linux}$ operating sys...

10.7k views

answered Feb 19, 2021

15 votes

8

GATE CSE 2021 Set 1 | Question: 4
Consider the following statements. $S_1:$ The sequence of procedure calls corresponds to a preorder traversal of the activation tree. $S_2:$ The sequence of procedure returns corresponds to a postorder traversal of the activation tree. Which one of the following options is ... and $S_2$ is true $S_1$ is true and $S_2$ is true $S_1$ is false and $S_2$ is false

Consider the following statements.$S_1:$ The sequence of procedure calls corresponds to a preorder traversal of the activation tree.$S_2:$ The sequence of procedure retur...

6.6k views

answered Feb 19, 2021

0 votes

9

Testbook Test Series: Programming & DS - Hashing
How to solve such kind of questions ? Can anybody tell what's is the concept behind this ?? someone provide me link so that I read it and understand the actual concept

How to solve such kind of questions ? Can anybody tell what's is the concept behind this ?? someone provide me link so that I read it and understand the actual concept

505 views

answered Aug 9, 2020

0 votes

10

MadeEasy Test Series: Programming & DS - Hashing
Consider the hashing table with m' slots and n' keys. If the expected number of probes in an unsuccessful search is 3, the expected number of probes in successful search is _____(Up to 2 decimals) Ans. 1.647 Here by default ... given here in the table http://cs360.cs.ua.edu/notes/hashing_formulas.pdf With linear hashing, I am getting around 1.61

Consider the hashing table with ‘m’ slots and ‘n’ keys. If the expected number of probes in an unsuccessful search is 3, the expected number of probes in success...

906 views

answered Aug 9, 2020

1 votes

11

MadeEasy Test Series 2019: Programming & DS - Hashing
Consider the hashing table with 'm' slots and 'n' keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search is_ Answer 1.647

Consider the hashing table with 'm' slots and 'n' keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search...

1.3k views

answered Aug 9, 2020

0 votes

12

Made easy test GATE 2019 MOCK 1 Question 53
IF the above network uses class C network 192.203.16.0; Then find the DBA used for Dept Y

IF the above network uses class C network 192.203.16.0; Then find the DBA used for Dept Y

337 views

answered Jul 21, 2020

1 votes

13

monotonically increasing grammar
Which of the following is not a monotonically increasing grammar? (A) Context-sensitive grammar (B) Unrestricted grammar (C) Regular grammar (D) Context-free grammar

Which of the following is not a monotonically increasing grammar?(A) Context-sensitive grammar(B) Unrestricted grammar(C) Regular grammar(D) Context-free grammar

1.9k views

answered Jul 21, 2020

1 votes

14

NIELIT 2016 MAR Scientist B - Section B: 5
The greatest and the least value of $f(x)=x^4-8x^3+22x^2-24x+1$ in $[0,2]$ are $0,8$ $0,-8$ $1,8$ $1,-8$

The greatest and the least value of $f(x)=x^4-8x^3+22x^2-24x+1$ in $[0,2]$ are$0,8$$0,-8$$1,8$$1,-8$

664 views

answered Jun 26, 2020

2 votes

15

NIELIT 2016 MAR Scientist B - Section B: 14
The minimum value of $\mid x^2-5x+2\mid$ is $-5$ $0$ $-1$ $-2$

The minimum value of $\mid x^2-5x+2\mid$ is$-5$$0$$-1$$-2$

566 views

answered Jun 26, 2020

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true