Recent activity by overtomanu / GATE Overflow for GATE CSE

5 answers

1

GATE CSE 2015 Set 3 | Question: 29
Consider the partial Schedule $S$ involving two transactions $T1$ and $T2$. Only the $\textit{read}$ and the $\textit{write}$ operations have been shown. The $\textit{read}$ operation on data item $P$ ... re-started to ensure transaction atomicity Schedule $S$ is recoverable and can ensure transaction atomicity and nothing else needs to be done

Consider the partial Schedule $S$ involving two transactions $T1$ and $T2$. Only the $\textit{read}$ and the $\textit{write}$ operations have been shown. The $\textit{rea...

14.4k views

commented Feb 16, 2015

10 answers

2

GATE CSE 2015 Set 3 | Question: 28
Consider a network connecting two systems located $8000$ $\text{Km}$ apart. The bandwidth of the network is $500 \times 10^6$ $\text{bits}$ per second. The propagation speed of the media is $4 \times 10^6$ $\text{meters}$ per ... . Assume that processing delays at nodes are negligible. Then, the minimum size in bits of the sequence number field has to be ______.

Consider a network connecting two systems located $8000$ $\text{Km}$ apart. The bandwidth of the network is $500 \times 10^6$ $\text{bits}$ per second. The propagation sp...

14.6k views

commented Feb 16, 2015

5 answers

3

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

answered Feb 16, 2015

5 answers

4

GATE CSE 2015 Set 3 | Question: 31
Consider the following grammar G $S \rightarrow F \mid H$ $F \rightarrow p \mid c$ $H \rightarrow d \mid c$ Where $S$, $F$, and $H$ are non-terminal symbols, $p, d$, and $c$ are terminal symbols. Which of the following statement(s) ... grammar G S2: LR(1) can parse all strings that are generated using grammar G Only S1 Only S2 Both S1 and S2 Neither S1 and S2

Consider the following grammar G$S \rightarrow F \mid H$$F \rightarrow p \mid c$$H \rightarrow d \mid c$ Where $S$, $F$, and $H$ are non-terminal symbols, $p, d$, and $c...

15.2k views

answered Feb 15, 2015

3 answers

5

GATE CSE 2015 Set 3 | Question: 30
Consider the following two C code segments. $Y$ and $X$ are one and two dimensional arrays of size $n$ and $ n \times n$ respectively, where $2 \leq n \leq 10$. Assume that in both code segments, elements of $Y$ are initialized to $0$ ... $2$ are contiguous in main memory Only S2 is correct Only S3 is correct Only S1 and S2 are correct Only S1 and S3 are correct

Consider the following two C code segments. $Y$ and $X$ are one and two dimensional arrays of size $n$ and $ n \times n$ respectively, where $2 \leq n \leq 10$. Assume th...

8.8k views

commented Feb 15, 2015

5 answers

6

GATE CSE 2015 Set 3 | Question: 38
In the network $200.10.11.144/27$, the $\text{fourth}$ octet (in decimal) of the last $\text{IP}$ address of the network which can be assigned to a host is _______.

In the network $200.10.11.144/27$, the $\text{fourth}$ octet (in decimal) of the last $\text{IP}$ address of the network which can be assigned to a host is _______.

16.2k views

answered Feb 15, 2015

3 answers

7

GATE CSE 2015 Set 3 | Question: 2
Let $\#$ be the binary operator defined as $X\#Y = X'+Y'$ where $X$ and $Y$ are Boolean variables. Consider the following two statements. $(S_1)$ $(P\#Q)\#R = P\#(Q\#R)$ $(S_2)$ $Q\#R = (R\#Q)$ Which are the following is/are true for the ... $R$? Only $S_1$ is true Only $S_2$ is true Both $S_1$ and $S_2$ are true Neither $S_1$ nor $S_2$ are true

Let $\#$ be the binary operator defined as$X\#Y = X'+Y'$ where $X$ and $Y$ are Boolean variables.Consider the following two statements.$(S_1)$ $(P\#Q)\#R = P\#(Q\#R)$$(S_...

5.6k views

answered Feb 15, 2015

12 answers

8

GATE CSE 2015 Set 3 | Question: 24
In a room there are only two types of people, namely $\text{Type 1}$ and $\text{Type 2}$. $\text{Type 1}$ people always tell the truth and $\text{Type 2}$ people always lie. You give a fair coin to a person in that room, without knowing which type ... person is of $\text{Type 2}$, then the result is tail If the person is of $\text{Type 1}$, then the result is tail

In a room there are only two types of people, namely $\text{Type 1}$ and $\text{Type 2}$. $\text{Type 1}$ people always tell the truth and $\text{Type 2}$ people always l...

17.8k views

commented Feb 15, 2015

2 answers

9

GATE CSE 2015 Set 3 | Question: GA-2
The Tamil version of __________ John Abraham-starrer Madras Cafe __________ cleared by the Censor Board with no cuts last week, but the film's distributor _______ no takers among the exhibitors for a release in Tamilnadu _______ this Friday. Mr., was, found, on a, was, found, at the, was, found, on a, being, find at

The Tamil version of __________ John Abraham-starrer Madras Cafe __________ cleared by the Censor Board with no cuts last week, but the film's distributor _______ no take...

3.6k views

commented Feb 15, 2015

1 answer

10

GATE CSE 2015 Set 3 | Question: 11
Consider a software program that is artificially seeded with 100 faults. While testing this program, 159 faults are detected, out of which 75 faults are from those artificially seeded faults. Assuming that both real and seeded faults are of same nature and have same distribution, the estimated number of undetected real faults is _______.

Consider a software program that is artificially seeded with 100 faults. While testing this program, 159 faults are detected, out of which 75 faults are from those artifi...

4.9k views

answered Feb 15, 2015

3 answers

11

GATE CSE 2015 Set 3 | Question: 23
Suppose $U$ is the power set of the set $S = \{1, 2, 3, 4, 5, 6\}$. For any $T \in U$, let $|T|$ denote the number of elements in $T$ and $T'$ denote the complement of $T$. For any $T, R \in U \text{ let } T \backslash R$ be the set ... $X \backslash Y = \phi)$ $\forall X \in U, \forall Y \in U, (X \backslash Y = Y' \backslash X')$

Suppose $U$ is the power set of the set $S = \{1, 2, 3, 4, 5, 6\}$. For any $T \in U$, let $|T|$ denote the number of elements in $T$ and $T'$ denote the complement of $T...

12.1k views

answered Feb 15, 2015

6 answers

12

GATE CSE 2015 Set 3 | Question: 10
Two processes $X$ and $Y$ ... proposed solution guarantees mutual exclusion and prevents deadlock The proposed solution fails to prevent deadlock and fails to guarantee mutual exclusion

Two processes $X$ and $Y$ need to access a critical section. Consider the following synchronization construct used by both the processes$$\begin{array}{|l|l|}\hline \text...

20.7k views

answered Feb 15, 2015

2 answers

13

GATE CSE 2015 Set 3 | Question: 16
Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order? SLR, LALR Canonical LR, LALR SLR, canonical LR LALR, canonical LR

Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the ...

8.5k views

answered Feb 15, 2015

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