Questions by Arjun / GATE Overflow for GATE CSE

25 votes

5 answers

1641

GATE CSE 2017 Set 1 | Question: GA-1
After Rajendra Chola returned from his voyage to Indonesia, he ________ to visit the temple in Thanjavur. was wishing is wishing wished had wished

After Rajendra Chola returned from his voyage to Indonesia, he ________ to visit the temple in Thanjavur.was wishingis wishingwishedhad wished

7.5k views

asked Feb 14, 2017

41 votes

4 answers

1642

GATE CSE 2017 Set 2 | Question: 50
A message is made up entirely of characters from the set $X=\{P, Q, R, S, T\}$ ... message of $100$ characters over $X$ is encoded using Huffman coding, then the expected length of the encoded message in bits is ______.

A message is made up entirely of characters from the set $X=\{P, Q, R, S, T\}$. The table of probabilities for each of the characters is shown below:$$\begin{array}{|c|c|...

21.2k views

asked Feb 14, 2017

58 votes

9 answers

1643

GATE CSE 2017 Set 2 | Question: 47
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .

If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .

17.7k views

asked Feb 14, 2017

44 votes

3 answers

1644

GATE CSE 2017 Set 2 | Question: 46
Consider the following database table named $\text{top_scorer}$ ... tc.goals FROM top_scorer AS tc WHERE tc.country='Germany') The number of tuples returned by the above SQL query is ______

Consider the following database table named $\text{top_scorer}$.$$\overset{\text{top_scorer}}{\begin{array}{|c|c|c|}\hline\\\textbf{player}& \textbf{country}& \textbf...

16.2k views

asked Feb 14, 2017

54 votes

7 answers

1645

GATE CSE 2017 Set 2 | Question: 43
Consider the following snippet of a C program. Assume that swap $(\&x, \&y)$ exchanges the content of $x$ and $y$: int main () { int array[] = {3, 5, 1, 4, 6, 2}; int done =0; int i; while (done==0) { done =1; for (i=0; i<=4; i ... i-1]) { swap(&array[i], &array[i-1]); done =0; } } } printf( %d , array[3]); } The output of the program is _______

Consider the following snippet of a C program. Assume that swap $(\&x, \&y)$ exchanges the content of $x$ and $y$:int main () { int array[] = {3, 5, 1, 4, 6, 2}; int done...

17.0k views

asked Feb 14, 2017

77 votes

12 answers

1646

GATE CSE 2017 Set 2 | Question: 39
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$ ... $\emptyset$ $\{q_0, q_1, q_3\}$ $\{q_0, q_1, q_2\}$ $\{q_0, q_2, q_3 \}$

Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$-NFA whose transition table is given below:$$\...

28.4k views

asked Feb 14, 2017

36 votes

6 answers

1647

GATE CSE 2017 Set 2 | Question: 37
Consider the C program fragment below which is meant to divide $x$ by $y$ using repeated subtractions. The variables $x$, $y$, $q$ and $r$ are all unsigned int. while (r >= y) { r=r-y; q=q+1; } Which of the following conditions on the variables $x, y, q$ and $r$ ... $(q==0) \ \&\& \ (y>0)$

Consider the C program fragment below which is meant to divide $x$ by $y$ using repeated subtractions. The variables $x$, $y$, $q$ and $r$ are all unsigned int.while (r >...

14.2k views

asked Feb 14, 2017

27 votes

5 answers

1648

GATE CSE 2017 Set 2 | Question: 36
The pre-order traversal of a binary search tree is given by $12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20$. Then the post-order traversal of this tree is $2, 6, 7, 8, 9, 10, 12, 15, 16, 17, 19, 20$ $2, 7, 6, 10, 9, 8, 15, 17, 20, 19, 16, 12$ $7, 2, 6, 8, 9, 10, 20, 17, 19, 15, 16, 12$ $7, 6, 2, 10, 9, 8, 15, 16, 17, 20, 19, 12$

The pre-order traversal of a binary search tree is given by $12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20$. Then the post-order traversal of this tree is$2, 6, 7, 8, 9, 10, ...

8.7k views

asked Feb 14, 2017

39 votes

3 answers

1649

GATE CSE 2017 Set 2 | Question: 34
Consider the binary code that consists of only four valid codewords as given below: $00000, 01011, 10101, 11110$ Let the minimum Hamming distance of the code $p$ and the maximum number of erroneous bits that can be corrected by the code be $q$. Then the values of $p$ and $q$ are $p=3$ and $q=1$ $p=3$ and $q=2$ $p=4$ and $q=1$ $p=4$ and $q=2$

Consider the binary code that consists of only four valid codewords as given below:$00000, 01011, 10101, 11110$Let the minimum Hamming distance of the code $p$ and the ma...

15.5k views

asked Feb 14, 2017

28 votes

7 answers

1650

GATE CSE 2017 Set 2 | Question: 33
A system shares $9$ ... describes current state of the system? Safe, Deadlocked Safe, Not Deadlocked Not Safe, Deadlocked Not Safe, Not Deadlocked

A system shares $9$ tape drives. The current allocation and maximum requirement of tape drives for that processes are shown below:$$\begin{array}{ccc} \textbf{Process} &...

13.8k views

asked Feb 14, 2017

32 votes

7 answers

1651

GATE CSE 2017 Set 2 | Question: 32
Consider the following expression grammar $G$: $E \rightarrow E-T \mid T$ $T \rightarrow T + F \mid F$ $F \rightarrow (E) \mid id$ Which of the following grammars is not left recursive, but is equivalent to $G$? $E \rightarrow E-T \mid T$ ... $E \rightarrow TX \mid (TX)$ $X \rightarrow -TX \mid +TX \mid \epsilon$ $T \rightarrow id$

Consider the following expression grammar $G$:$E \rightarrow E-T \mid T$$T \rightarrow T + F \mid F$$F \rightarrow (E) \mid id$Which of the following grammars is not left...

11.0k views

asked Feb 14, 2017

50 votes

7 answers

1652

GATE CSE 2017 Set 2 | Question: 31
For any discrete random variable $X$, with probability mass function $P(X=j)=p_j, p_j \geq 0, j \in \{0, \dots , N \}$, and $\Sigma_{j=0}^N \: p_j =1$, define the polynomial function $g_x(z) = \Sigma_{j=0}^N \: p_j \: z^j$. For a certain ... . The expectation of $Y$ is $N \beta(1-\beta)$ $N \beta$ $N (1-\beta)$ Not expressible in terms of $N$ and $\beta$ alone

For any discrete random variable $X$, with probability mass function$P(X=j)=p_j, p_j \geq 0, j \in \{0, \dots , N \}$, and $\Sigma_{j=0}^N \: p_j =1$, define the polynomi...

16.1k views

asked Feb 14, 2017

67 votes

6 answers

1653

GATE CSE 2017 Set 2 | Question: 29
In a two-level cache system, the access times of $L_1$ and $L_2$ caches are $1$ and $8$ clock cycles, respectively. The miss penalty from the $L_2$ cache to main memory is $18$ clock cycles. The miss rate of $L_1$ cache is twice that of $L_2$. The average ... respectively are $0.111$ and $0.056$ $0.056$ and $0.111$ $0.0892$ and $0.1784$ $0.1784$ and $0.0892$

In a two-level cache system, the access times of $L_1$ and $L_2$ caches are $1$ and $8$ clock cycles, respectively. The miss penalty from the $L_2$ cache to main memory i...

28.6k views

asked Feb 14, 2017

32 votes

2 answers

1654

GATE CSE 2017 Set 2 | Question: 28
Given $f(w, x, y, z) = \Sigma_m(0,1, 2, 3, 7, 8, 10) + \Sigma_d(5, 6, 11, 15)$; where $d$ represents the 'don't-care' condition in Karnaugh maps. Which of the following is a minimum product-of-sums (POS) form of $f(w, x, y, z)$? $f=(\bar{w}+\bar{z}) (\bar{x}+z)$ $f=(\bar{w}+z) (x+z)$ $f=(w+z) (\bar{x}+z)$ $f=(w+\bar{z}) (\bar{x}+z)$

Given $f(w, x, y, z) = \Sigma_m(0,1, 2, 3, 7, 8, 10) + \Sigma_d(5, 6, 11, 15)$; where $d$ represents the 'don't-care' condition in Karnaugh maps. Which of the following i...

15.6k views

asked Feb 14, 2017

65 votes

6 answers

1655

GATE CSE 2017 Set 2 | Question: 26
$P$ and $Q$ are considering to apply for a job. The probability that $P$ applies for the job is $\dfrac{1}{4},$ the probability that $P$ applies for the job given that $Q$ applies for the job is $\dfrac{1}{2},$ and the probability that $Q$ applies for the ... $\left(\dfrac{5}{6}\right)$ $\left(\dfrac{7}{8}\right)$ $\left(\dfrac{11}{12}\right)$

$P$ and $Q$ are considering to apply for a job. The probability that $P$ applies for the job is $\dfrac{1}{4},$ the probability that $P$ applies for the job given that $Q...

12.5k views

asked Feb 14, 2017

33 votes

2 answers

1656

GATE CSE 2017 Set 2 | Question: 22
Let $P = \begin{bmatrix}1 & 1 & -1 \\2 & -3 & 4 \\3 & -2 & 3\end{bmatrix}$ and $Q = \begin{bmatrix}-1 & -2 &-1 \\6 & 12 & 6 \\5 & 10 & 5\end{bmatrix}$ be two matrices. Then the rank of $ P+Q$ is ___________ .

Let $P = \begin{bmatrix}1 & 1 & -1 \\2 & -3 & 4 \\3 & -2 & 3\end{bmatrix}$ and $Q = \begin{bmatrix}-1 & -2 &-1 \\6 & 12 & 6 \\5 & 10 & 5\end{bmatrix}$ be two matrices.Th...

11.9k views

asked Feb 14, 2017

20 votes

8 answers

1657

GATE CSE 2017 Set 2 | Question: 6
Which of the following statements about parser is/are CORRECT? $\text{Canonical LR}$ is more powerful than $\text{SLR}$ $\text{SLR}$ is more powerful than $\text{LALR}$ $\text{SLR}$ is more powerful than $\text{Canonical LR}$ I only II only III only II and III only

Which of the following statements about parser is/are CORRECT?$\text{Canonical LR}$ is more powerful than $\text{SLR}$$\text{SLR}$ is more powerful than $\text{LALR}$$\te...

7.8k views

asked Feb 14, 2017

24 votes

7 answers

1658

GATE CSE 2017 Set 2 | Question: 1
The representation of the value of a $16\text{-bit}$ unsigned integer $X$ in hexadecimal number system is $\textsf{BCA9}$. The representation of the value of $X$ in octal number system is $571244$ $736251$ $571247$ $136251$

The representation of the value of a $16\text{-bit}$ unsigned integer $X$ in hexadecimal number system is $\textsf{BCA9}$. The representation of the value of $X$ in octal...

6.8k views

asked Feb 14, 2017

54 votes

4 answers

1659

GATE CSE 2017 Set 1 | Question: 49
Consider a RISC machine where each instruction is exactly $4$ bytes long. Conditional and unconditional branch instructions use PC-relative addressing mode with Offset specified in bytes to the target location of the branch instruction. Further the Offset is ... $i,$ then the decimal value of the Offset is ____________ .

Consider a RISC machine where each instruction is exactly $4$ bytes long. Conditional and unconditional branch instructions use PC-relative addressing mode with Offset sp...

14.6k views

asked Feb 14, 2017

56 votes

10 answers

1660

GATE CSE 2017 Set 1 | Question: 48
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i \right ]$ is $1$ by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is ____________.

Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i ...

21.8k views

asked Feb 14, 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