Questions by Bikram / GATE Overflow for GATE CSE

0 votes

1 answer

261

Test by Bikram | Mock GATE | Test 3 | Question: 50
Which of the following statement(s) is/are true about $LALR$\left ( 1 \right )$parsers ? S1: LALR$\left ( 1 \right )$parsers have same number of states as $SLR$\left ( 1 \right )$ parsers (core $LR$ ... $\left ( 1 \right )$ is derived. S1 and S2 S1 and S3 S2 and S3 S1, S2 and S3

Which of the following statement(s) is/are true about $LALR$$\left ( 1 \right )$parsers ?S1: LALR$\left ( 1 \right )$parsers have same number of states as $SLR$$\left ( 1...

225 views

asked Feb 9, 2017

1 votes

2 answers

262

Test by Bikram | Mock GATE | Test 3 | Question: 49
In a hospital $’X’$ births occur randomly at an average rate of $1.8$ births per hour. The probability that we observe $5$ births in a given interval of $2$ hours is ______.

In a hospital $’X’$ births occur randomly at an average rate of $1.8$ births per hour.The probability that we observe $5$ births in a given interval of $2$ hours is _...

551 views

asked Feb 9, 2017

2 votes

1 answer

263

Test by Bikram | Mock GATE | Test 3 | Question: 48
The following five concurrent processes operate on counting semaphore variable $\left ( S \right )$, which is initialized to $0$. P1 : wait$\left ( s \right )$ ; $cs$ ; signal$\left ( s \right )$ ; P2 : wait$\left ( s \right )$ ; $cs$ ; ... signal$\left ( s \right )$ ; $cs$ ; wait $\left ( s \right )$; The maximum possible value of $S$ is ______.

The following five concurrent processes operate on counting semaphore variable $\left ( S \right )$, which is initialized to $0$.P1 : wait$\left ( s \right )$ ; $cs$ ...

458 views

asked Feb 9, 2017

0 votes

1 answer

264

Test by Bikram | Mock GATE | Test 3 | Question: 47
A binary max-heap is implemented using an array $A$. The contents of $A$ is $\left \{90, 70, 75, 15, 45, 40, 60 \right \}$. The contents of $A\left[3 \right ]$ are increased from $15$ to $100$. What will the contents of $A$ ... $\left \{ 100, 90, 75, 70, 45, 60, 40 \right \}$

A binary max-heap is implemented using an array $A$. The contents of $A$ is $\left \{90, 70, 75, 15, 45, 40, 60 \right \}$. The contents of $A\left[3 \right ]$ are increa...

244 views

asked Feb 9, 2017

2 votes

1 answer

265

Test by Bikram | Mock GATE | Test 3 | Question: 46
A system uses shortest job first scheduling $(SJF)$ and exponential average of the measured lengths of previous $CPU$ bursts is $a =0.25$. The initial value of the predicted CPU burst time, i.e. $T_{1}=4$ $unit$ ... $4$ $unit$, $12$ $unit$ and $8$ $unit$ respectively is _______.

A system uses shortest job first scheduling $(SJF)$ and exponential average of the measured lengths of previous $CPU$ bursts is $a =0.25$. The initial value of the predi...

555 views

asked Feb 9, 2017

0 votes

1 answer

266

Test by Bikram | Mock GATE | Test 3 | Question: 45
Two hosts $L1$ and $L2$ are connected via a communication link. The host $L2$ has a buffer for receiving data of total size $6000$ $Bytes$. The $2000$ $Bytes$ of received data (unprocessed data) is present in the receiver buffer at ... of congestion window at host $L1$ is $3500$ $Bytes$, the maximum sending window size at host $L1$ is ________.

Two hosts $L1$ and $L2$ are connected via a communication link. The host $L2$ has a buffer for receiving data of total size $6000$ $Bytes$. The $2000$ $Bytes$ of received...

511 views

asked Feb 9, 2017

1 votes

1 answer

267

Test by Bikram | Mock GATE | Test 3 | Question: 44
A CPU manufacturer has two designs $P1$ and $P2$ for a synchronous pipeline processor. $P1$ has $5$ pipeline stages with execution times of $3$ $ns$, $4$ $ns$, $3$ $ns$, $2$ $ns$, $4$ $ns$ respectively. The design $P2$ ... time of $3 ns$ each. The time that can be saved by $P2$ over $P1$ to execute $1000$ instructions is ______ $ns$.

A CPU manufacturer has two designs $P1$ and $P2$ for a synchronous pipeline processor.$P1$ has $5$ pipeline stages with execution times of $3$ $ns$, $4$ $ns$, $3$ $ns$, $...

270 views

asked Feb 9, 2017

0 votes

1 answer

268

Test by Bikram | Mock GATE | Test 3 | Question: 43
The characteristic expression for a new $AB$-flip-flop is given below: $Q_{n+1}$\left ( A, B, Q_{n} \right )$ = $\sim A \sim Q_{n}$ $+$ $B$Q_{n}$ , where $\sim A$ means Not $A$ or $A$ $Bar$. Identify the CORRECT statement among ... $A = 0, B = 1$ then flip flop resets. If $A = 0, B = 0$ then toggles.

The characteristic expression for a new $AB$-flip-flop is given below:$Q_{n+1}$$\left ( A, B, Q_{n} \right )$ = $\sim A \sim Q_{n}$ $+$ $B$$Q_{n}$ , where $\sim A$ mea...

353 views

asked Feb 9, 2017

2 votes

1 answer

269

Test by Bikram | Mock GATE | Test 3 | Question: 42
Read the below code snippet: int joo( int num ) { int result = 0 ; if ( num <= 1) return 1; else { for ( i=num; i >= 1; i - - ) { result + = joo( i / 3) ; } } return result; } When $num = 6$, the return value of the function is _____.

Read the below code snippet: int joo( int num ) { int result = 0 ; if ( num <= 1) return 1; else { for ( i=num; i >= 1; i - - ) { result + = joo( i / 3) ; } } return r...

347 views

asked Feb 9, 2017

0 votes

1 answer

270

Test by Bikram | Mock GATE | Test 3 | Question: 41
A $CPU$ supports $4$ interrupts - $I1 , I2 , I3$ and $I4$. It supports priority of the interrupts. Nested interrupts are allowed if later interrupt has higher priority than the previous one. During a certain period of time, we observe the following sequence of entry ... $I1 > I2 > I3 > I4$ $I4 > I3 > I2 > I1$

A $CPU$ supports $4$ interrupts - $I1 , I2 , I3$ and $I4$. It supports priority of the interrupts. Nested interrupts are allowed if later interrupt has higher priority t...

492 views

asked Feb 9, 2017

2 votes

1 answer

271

Test by Bikram | Mock GATE | Test 3 | Question: 40
Consider the subnet given in the below diagram. Here, distance vector routing algorithm is used. The following vectors have just come in to router $C$: from $B$: $\left ( 3, 0, 6, 5, 3, 8, 3 \right )$; from $D$: $\left ( 1,5, 3, 0, 8, 6, 3 \right )$ ... $\left (5, 4, 0, 3, 5, 6, 6\right )$ $\left (4, 2, 0, 2, 1, 5, 5\right )$

Consider the subnet given in the below diagram. Here, distance vector routing algorithm is used.The following vectors have just come in to router $C$:from $B$: $\left ( 3...

1.1k views

asked Feb 9, 2017

2 votes

1 answer

272

Test by Bikram | Mock GATE | Test 3 | Question: 39
The register $’V’$ contains the value $’500’$. The index register contains the value $’100’$. The address field value of an indexed addressing mode instruction to make it same as a register indirect mode instruction is ___________.

The register $’V’$ contains the value $’500’$. The index register contains the value $’100’$.The address field value of an indexed addressing mode instruction...

473 views

asked Feb 9, 2017

0 votes

1 answer

273

Test by Bikram | Mock GATE | Test 3 | Question: 38
Consider a relation $R$\left ( A, B,C,D, E \right )$ with the following $FD$ set $F$: $A\rightarrow BC$ $CD\rightarrow E$ $B\rightarrow D$ $E\rightarrow A$ The canonical cover of the above $FD$ set is: $A\rightarrow BC$, $C\ ... , $BC\rightarrow D$ , $E\rightarrow A$ $A\rightarrow BC$ , $B\rightarrow E$ , $B\rightarrow D$ , $E\rightarrow A$

Consider a relation $R$$\left ( A, B,C,D, E \right )$ with the following $FD$ set $F$: $A\rightarrow BC$ $CD\rightarrow E$ $B\rightarrow D$ $E\rightarrow A$The canonica...

361 views

asked Feb 9, 2017

1 votes

1 answer

274

Test by Bikram | Mock GATE | Test 3 | Question: 37
In a college, the $CSMA / CD$ protocol has a bandwidth of $512$ $Mbps$ and distance of $2$ $km/s$. If the signal speed is $2,00,000$ $km$, then the minimum frame size in order to detect a collision is _________ $bytes$.

In a college, the $CSMA / CD$ protocol has a bandwidth of $512$ $Mbps$ and distance of $2$ $km/s$.If the signal speed is $2,00,000$ $km$, then the minimum frame size in o...

452 views

asked Feb 9, 2017

2 votes

1 answer

275

Test by Bikram | Mock GATE | Test 3 | Question: 36
Consider the following regular languages given below: L1 : Languages that accept strings over $\sum \left (a,b \right )$ , such that length of string is greater than $1$, but multiples of $3$. L2 : Languages that accept strings over $\sum \left (a,b \right )$ ... ? $n1 = n3 < n2$ $n1 < n3 < n2$ $n3 < n1 < n2$ $n2 < n1 < n3$

Consider the following regular languages given below: L1 : Languages that accept strings over $\sum \left (a,b \right )$ , such that length of string is greater than $1$,...

518 views

asked Feb 9, 2017

2 votes

1 answer

276

Test by Bikram | Mock GATE | Test 3 | Question: 35
Consider the following set of messages with their frequencies: ... The percentage improvement for total binary stream transmission using Huffman Encoding over simple encoding is _______ %.

Consider the following set of messages with their frequencies: $$\begin{array}{|c|c|c|} \hline \textbf{Message} & \textbf{Frequency} \\ \hline A & 50\: \text{million} \...

933 views

asked Feb 9, 2017

0 votes

1 answer

277

Test by Bikram | Mock GATE | Test 3 | Question: 34
Consider the following schedule: $S =$ ${R1(A),R2(B),W2(A),W1(A)}$ Assume that Transaction $T1$ has started execution before the Transaction $T2$. Then, the schedule is: Allowed under Basic Timestamp Protocol ... Allowed under both Basic Timestamp Protocol and Thomas Write Rule. Not allowed under both Basic Timestamp Protocol and Thomas Write Rule.

Consider the following schedule: $S =$ ${R1(A),R2(B),W2(A),W1(A)}$Assume that Transaction $T1$ has started execution before the Transaction $T2$.Then, the schedule is: ...

356 views

asked Feb 9, 2017

2 votes

1 answer

278

Test by Bikram | Mock GATE | Test 3 | Question: 33
Consider the following deterministic finite state automaton $M$: Let $S$ denote the set of $seven$ $bit$ binary strings in which the first, the fourth, and the last bits are $1$. The number of strings in $S$ that are accepted by $M$ is: 1 5 7 8

Consider the following deterministic finite state automaton $M$:Let $S$ denote the set of $seven$ $bit$ binary strings in which the first, the fourth, and the last bits a...

504 views

asked Feb 9, 2017

3 votes

1 answer

279

Test by Bikram | Mock GATE | Test 3 | Question: 32
Which of the following is a TRUE statement? $fig (a)$ $fig (b)$ Deadlock occurs in both the cases. Deadlock occurs in $fig (b)$, but not in $fig (a)$. Deadlock occurs in $fig (a)$, but not in $fig (b)$. Deadlock does not occur in either case.

Which of the following is a TRUE statement? $fig (a)$ $fig (b)$ De...

255 views

asked Feb 9, 2017

2 votes

1 answer

280

Test by Bikram | Mock GATE | Test 3 | Question: 31
What is the output of the below mentioned code snippet? void goo(char *p) { if( p[0] = = ’\0’) return; goo(p+1); goo(p+1); printf("%c", p[0]); } main() { goo("123"); } $3$ $3$ $2$ $1$ $3$ $2$ $1$ $3$ $2$ $3$ $1$ $3$ $2$ $1$ $3$ $3$ $2$ $3$ $3$ $2$ $1$ $3$ $3$ $3$ $1$ $3$ $3$ $2$

What is the output of the below mentioned code snippet?void goo(char *p) { if( p[0] = = ’\0’) return; goo(p+1); goo(p+1); printf("%c", p[0]); } main() { goo("123"); }...

237 views

asked Feb 9, 2017

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