Recent activity by pritishc / GATE Overflow for GATE CSE

3 answers

1

GATE CSE 2014 Set 2 | Question: 22
Given an instance of the STUDENTS relation as shown as below ... $(\text{StudentName, StudentAge})$ to be a key for this instance, the value $X$ should NOT be equal to______.

Given an instance of the STUDENTS relation as shown as below$$\begin{array}{|c|c|c|c|c|} \hline \textbf {StudentID} & \textbf{StudentName} & \textbf{StudentEmail} & \text...

7.3k views

commented Apr 13, 2021

5 answers

2

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

commented Mar 1, 2021

9 answers

3

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

commented Feb 26, 2021

2 answers

4

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

commented Feb 22, 2021

7 answers

5

GATE CSE 2021 Set 1 | Question: 30
Consider the following recurrence relation. $T\left ( n \right )=\left\{\begin{array} {lcl} T(n ∕ 2)+T(2n∕5)+7n & \text{if} \; n>0\\1 & \text{if}\; n=0 \end{array}\right.$ Which one of the following options is correct? $T(n)=\Theta (n^{5/2})$ $T(n)=\Theta (n\log n)$ $T(n)=\Theta (n)$ $T(n)=\Theta ((\log n)^{5/2})$

Consider the following recurrence relation.$$T\left ( n \right )=\left\{\begin{array} {lcl} T(n ∕ 2)+T(2n∕5)+7n & \text{if} \; n>0\\1 & \text{if}\; n=0 \end{array}\r...

23.8k views

comment edited Feb 21, 2021

4 answers

6

GATE CSE 2021 Set 1 | Question: 45
Consider two hosts $P$ and $Q$ connected through a router $R$. The maximum transfer unit $\text{(MTU)}$ value of the link between $P$ and $R$ is $1500$ bytes, and between $R$ and $Q$ is $820$ bytes. A $\text{TCP}$ segment ... to resend the whole $\text{TCP}$ segment. $\text{TCP}$ destination port can be determined by analysing $\textit{only}$ the second fragment.

Consider two hosts $P$ and $Q$ connected through a router $R$. The maximum transfer unit $\text{(MTU)}$ value of the link between $P$ and $R$ is $1500$ bytes, and between...

10.4k views

commented Feb 21, 2021

6 answers

7

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

commented Feb 19, 2021

2 answers

8

GATE CSE 2021 Set 1 | Question: 51
In a pushdown automaton $P=(Q, \Sigma, \Gamma, \delta, q_0, F)$, a transition of the form, where $p,q \in Q$, $a \in \Sigma \cup \{ \epsilon \}$, and $X,Y \in \Gamma \cup \{ \epsilon \}$ ... $\Gamma = \{ \#, A\}$. The number of strings of length $100$ accepted by the above pushdown automaton is ___________

In a pushdown automaton $P=(Q, \Sigma, \Gamma, \delta, q_0, F)$, a transition of the form,where $p,q \in Q$, $a \in \Sigma \cup \{ \epsilon \}$, and $X,Y \in \Gamma \cup...

10.6k views

commented Feb 19, 2021

1 answer

9

GATE CSE 2021 Set 1 | GA Question: 3
Consider the following sentences: Everybody in the class is prepared for the exam. Babu invited Danish to his home because he enjoys playing chess. Which of the following is the $\text{CORRECT}$ observation about the above two sentences? $\text{(i)}$ is ... and $\text{(ii)}$ is ambiguous $\text{(i)}$ is grammatically incorrect and $\text{(ii)}$ is ambiguous

Consider the following sentences:Everybody in the class is prepared for the exam.Babu invited Danish to his home because he enjoys playing chess.Which of the following is...

6.6k views

commented Feb 18, 2021

8 answers

10

GATE CSE 2019 | Question: 37
There are $n$ unsorted arrays: $A_1, A_2, \dots, A_n$. Assume that $n$ is odd.Each of $A_1, A_2, \dots, A_n$ contains $n$ distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of $A_1, A_2, \dots , A_n$ is $O(n)$ $O(n \: \log \: n)$ $O(n^2)$ $\Omega (n^2 \log n)$

There are $n$ unsorted arrays: $A_1, A_2, \dots, A_n$. Assume that $n$ is odd.Each of $A_1, A_2, \dots, A_n$ contains $n$ distinct elements. There are no common elements ...

35.2k views

commented Feb 5, 2021

2 answers

11

GATE2011 MN: GA-64
Four archers P, Q, R, and S try to hit a bull's eye during a tournament consisting of seven rounds. As illustrated in the figure below, a player receives $10$ points for hitting the bull's eye, $5$ ... The most accurate and the most consistent players during the tournament are respectively P and S Q and R Q and Q R and Q

Four archers P, Q, R, and S try to hit a bull’s eye during a tournament consisting of seven rounds. As illustrated in the figure below, a player receives $10$ points fo...

1.7k views

commented Feb 2, 2021

2 answers

12

GATE Overflow Test Series | Mock GATE | Test 3 | Question: 59
If the function $f(x) =\left\{ \begin{array}{rcl} \alpha \sqrt{x+1} &;0\leq x \leq 3 \\\beta x + 2&;3 < x\leq 5\end{array}\right.$ is differentiable, then the value of $\alpha - \beta$ is _________

If the function $f(x) =\left\{ \begin{array}{rcl} \alpha \sqrt{x+1} &;0\leq x \leq 3 \\\beta x + 2&;3 < x\leq 5\end{array}\right.$ is differentiable, then the value of $\...

467 views

commented Jan 30, 2021

1 answer

13

Test by Bikram | Mock GATE | Test 3 | Question: 24
A $4-bit$ carry-lookahead adder adds two $4-bit$ numbers. The adder is designed only using $AND, OR, NOT, NAND $ and $NOR$ gates. We assume that all the inputs are available in both complemented and uncompleted forms. The delay ... using two-level $AND-OR$ logic. Thus, the overall propagation delay of the adder is ______ in terms of time units.

A $4-bit$ carry-lookahead adder adds two $4-bit$ numbers. The adder is designed only using $AND, OR, NOT, NAND $ and $NOR$ gates. We assume that all the inputs are availa...

585 views

commented Jan 28, 2021

1 answer

14

GATE Overflow Test Series | Mock GATE | Test 2 | Question: 13
Given that the relation $\textbf{Student}$ ... __________ $\{t\cdot \text{FirstName} \mid \text{Student}(t)\;\text{AND}\; t\cdot\text{Weight} < 50\}$

Given that the relation$$\textbf{Student}$$$$\begin{array}{|c|c|c|c|c|}\hline\textbf{FirstName} & \textbf{LastName} & \textbf{Weight}\\\hline\text{Rahul} & \text{Soni} & ...

371 views

commented Jan 22, 2021

2 answers

15

GATE Overflow Test Series | Computer Organization and Architecture | Test 1 | Question: 20
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction(FI), Decode Instruction(DI), Fetch Operand(FO), Execute instruction(EI) and Write Operand(WO). The stage delays ... the execution of this program, the time(in ns) needed to complete the program is ________

Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction(FI), Decode Instruction(DI), Fetch Operand(FO), Execute instruction(EI)...

460 views

commented Jan 17, 2021

1 answer

16

GATE Overflow Test Series | Computer Organization and Architecture | Test 1 | Question: 8
Consider the following Assembly code fragment ldr r0, adr_var1 @ load the memory address of var1 via label adr_var1 into r0 ldr r1, adr_var2 @ load the memory address of var2 via label ... excluding register accesses) during the execution stage when the above sequence of instructions is executed is ________

Consider the following Assembly code fragmentldr r0, adr_var1 @ load the memory address of var1 via label adr_var1 into r0 ldr r1, adr_var2 @ load the memory address of v...

475 views

comment edited Jan 16, 2021

1 answer

17

GATE Overflow Test Series | Algorithms | Test 2 | Question: 20
Consider the graph $G$ with $4$ ... $2$ Graph $M$ has $16$ distinct minimum spanning trees, each of cost $3$

Consider the graph $G$ with $4$ vertices. Its adjacency weight matrix is shown below. Which of the following is true?$$G = \begin{bmatrix}0&1&1 &1 \\1 & 0 & 1 & 1 \\1 & 1...

177 views

commented Jan 14, 2021

3 answers

18

Test by Bikram | Mock GATE | Test 2 | Question: 35
Consider the following possible data structures for a set of $n$ distinct integers. A min-heap An array of length $n$ sorted in increasing order A balanced binary search tree For which of these data structures, the number of steps needed to find and remove ... element in $0 (\log n)$ time in the worst case? I and III II and III I and II II only

Consider the following possible data structures for a set of $n$ distinct integers.A min-heapAn array of length $n$ sorted in increasing orderA balanced binary search tre...

1.9k views

commented Jan 9, 2021

1 answer

19

Can anyone explain the normalization formula used in GATE
https://www.change.org/p/iit-kanpur-gate-gate-2015-please-re-apply-fair-normalization-process-or-give-explanation-about-the-set-2-normalization?recruiter=88980546&utm_source=share_petition&utm_medium=facebook&utm_campaign=share_facebook_responsive&utm_term=des-lg-share_petition-no_msg

https://www.change.org/p/iit-kanpur-gate-gate-2015-please-re-apply-fair-normalization-process-or-give-explanation-about-the-set-2-normalization?recruiter=88980546&utm_sou...

5.1k views

commented Jan 8, 2021

6 answers

20

GATE CSE 2003 | Question: 87
Consider three data items $D1, D2,$ and $D3,$ and the following execution schedule of transactions $T1, T2,$ and $T3.$ In the diagram, $R(D)$ and $W(D)$ denote the actions reading and writing the data item $D$ ... $T2; T1; T3$ The schedule is serializable as $T3; T2; T1$ The schedule is not serializable

Consider three data items $D1, D2,$ and $D3,$ and the following execution schedule of transactions $T1, T2,$ and $T3.$ In the diagram, $R(D)$ and $W(D)$ denote the action...

11.3k views

comment edited Dec 12, 2020

1 answer

21

GATE Overflow Test Series | Programming | Test 1 | Question: 6
Consider the following C program: #include<stdio.h> extern int getMyMonth(); int main() { enum Month {January, February, March, April, May, June, July, August, September, October, November, December}; int my_month = getMyMonth(); ... above program if the external function getMyMonth() returns $1?$ $31$ $30$ $28$ None of the above

Consider the following C program:#include<stdio.h extern int getMyMonth(); int main() { enum Month {January, February, March, April, May, June, July, August, September, O...

639 views

commented Nov 18, 2020

1 answer

22

GATE Overflow Test Series | Discrete Mathematics | Test 1 | Question: 22
Consider the following function $f$ on $\left[-\frac{1}{2},3\right] \rightarrow [-1,1]$ such that $f(x) = \frac{2x-1}{4x+5}$. Which of the following statements is TRUE? $f$ is not one-one but is onto $f$ is neither one-one nor onto $f$ is bijective $f$ is one-one but not onto

Consider the following function $f$ on $\left[-\frac{1}{2},3\right] \rightarrow [-1,1]$ such that $f(x) = \frac{2x-1}{4x+5}$. Which of the following statements is TRUE?$f...

434 views

commented Nov 11, 2020

4 answers

23

GATE CSE 2015 Set 1 | Question: GA-4
Based on the given statements, select the most appropriate option to solve the given question. If two floors in a certain building are $9$ feet apart, how many steps are there in a set of stairs that extends from the ... . Both statements together are sufficient, but neither statement alone is sufficient. Statements I and II together are not sufficient.

Based on the given statements, select the most appropriate option to solve the given question.If two floors in a certain building are $9$ feet apart, how many steps are t...

4.1k views

commented Nov 7, 2020

5 answers

24

GATE CSE 2015 Set 3 | Question: 33
If the following system has non-trivial solution, $px + qy + rz = 0$ $qx + ry + pz = 0$ $rx + py + qz = 0$, then which one of the following options is TRUE? $p - q + r = 0 \text{ or } p = q = -r$ $p + q - r = 0 \text{ or } p = -q = r$ $p + q + r = 0 \text{ or } p = q = r$ $p - q + r = 0 \text{ or } p = -q = -r$

If the following system has non-trivial solution, $px + qy + rz = 0$$qx + ry + pz = 0$$rx + py + qz = 0$,then which one of the following options is TRUE?$p - q + r = 0 \t...

10.9k views

commented Oct 29, 2020

2 answers

25

GATE CSE 2015 Set 1 | Question: 50
A variable $x$ is said to be live at a statement $s_{i}$ in a program if the following three conditions hold simultaneously: There exists a statement $S_{j}$ that uses $x$ There is a path from $S_{i}$ to $S_{j}$ in the flow graph corresponding to the program The path ... above control flow graph are $\text{p, s, u}$ $\text{r, s, u}$ $\text{r, u}$ $\text{q, v}$

A variable $x$ is said to be live at a statement $s_{i}$ in a program if the following three conditions hold simultaneously:There exists a statement $S_{j}$ that uses $x$...

26.1k views

comment edited Oct 18, 2020

1 answer

26

GATE CSE 2015 Set 2 | Question: 14
In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is TRUE? In both AST and CFG, let node $N_2$ be the successor of node $N_1$. In the input program, the code corresponding to $N_2$ ... an AST and a CFG depends on the input program Each node in AST and CFG corresponds to at most one statement in the input program

In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is TRUE? In both AST and CFG, let node $N_2$ be the successor of nod...

13.1k views

commented Oct 17, 2020

4 answers

27

GATE CSE 2014 Set 3 | Question: 34
Consider the basic block given below. a = b + c c = a + d d = b + c e = d - b a = e + b The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are $6$ and $6$ $8$ and $10$ $9$ and $12$ $4$ and $4$

Consider the basic block given below. a = b + c c = a + d d = b + c e = d - b a = e + b The minimum number of nodes and edges present in the DAG representation of the abo...

35.1k views

commented Oct 14, 2020

3 answers

28

GATE CSE 1998 | Question: 25-a
Free disk space can be used to keep track of using a free list or a bit map. Disk addresses require $d$ bits. For a disk with $B$ blocks, $F$ of which are free, state the condition under which the free list uses less space than the bit map.

Free disk space can be used to keep track of using a free list or a bit map. Disk addresses require $d$ bits. For a disk with $B$ blocks, $F$ of which are free, state the...

5.3k views

commented Sep 30, 2020

10 answers

29

GATE CSE 2009 | Question: 30
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be ... deadlock Only $P1$ and $P2$ will be in deadlock Only $P1$ and $P3$ will be in deadlock All three processes will be in deadlock

Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used....

34.2k views

commented Sep 28, 2020

5 answers

30

GATE IT 2008 | Question: 45
For the undirected, weighted graph given below, which of the following sequences of edges represents a correct execution of Prim's algorithm to construct a Minimum Spanning Tree? $\text{(a, b), (d, f), (f, c), (g, i), (d, a), (g, h), (c, e), (f, h)}$ ... $\text{(h, g), (g, i), (h, f), (f, c), (f, d), (d, a), (a, b), (c, e)}$

For the undirected, weighted graph given below, which of the following sequences of edges represents a correct execution of Prim's algorithm to construct a Minimum Span...

13.4k views

comment edited Jul 16, 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