Answers by swap_it / GATE Overflow for GATE CSE

3 votes

1

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

answered Feb 14, 2017

2 votes

2

GATE CSE 2017 Set 2 | Question: 42
The next state table of a $2-$ ... $T_1 = Q_1+Q_0, \quad T_0= \bar{Q_1} \bar{Q_0}$ $T_1 = \bar{Q_1}Q_0, \quad T_0= Q_1 + Q_0$

The next state table of a $2-$bit saturating up-counter is given below.$\begin{array}{cc|cc} Q_1 & Q_0 & Q_1^+ & Q_0^+ \\ \hline 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 0 \\ 1 & 0...

11.1k views

answered Feb 14, 2017

6 votes

3

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

answered Feb 14, 2017

2 votes

4

GATE CSE 2017 Set 2 | Question: 30
Consider the recurrence function $T(n) = \begin{cases} 2T(\sqrt{n})+1, & n>2 \\ 2, & 0 < n \leq 2 \end{cases}$ Then $T(n)$ in terms of $\Theta$ notation is $\Theta(\log \log n)$ $\Theta( \log n)$ $\Theta (\sqrt{n})$ $\Theta(n)$

Consider the recurrence function$$T(n) = \begin{cases} 2T(\sqrt{n})+1, & n>2 \\ 2, & 0 < n \leq 2 \end{cases}$$Then $T(n)$ in terms of $\Theta$ notation is$\Theta(\log \l...

17.9k views

answered Feb 14, 2017

36 votes

5

GATE CSE 2017 Set 2 | Question: 40
Consider the following languages. $L_1 = \{a^p \mid p \text{ is a prime number} \}$ $L_2 = \{ a^nb^mc^{2m} \mid n \geq 0, m \geq 0 \}$ $L_3 = \{a^n b^n c^{2n} \mid n \geq 0 \}$ ... not context free $L_3$ is not context free but recursive $L_4$ is deterministic context free I, II and IV only II and III only I and IV only III and IV only

Consider the following languages.$L_1 = \{a^p \mid p \text{ is a prime number} \}$$L_2 = \{ a^nb^mc^{2m} \mid n \geq 0, m \geq 0 \}$$L_3 = \{a^n b^n c^{2n} \mid n \geq 0 ...

8.9k views

answered Feb 14, 2017

4 votes

6

GATE CSE 2017 Set 2 | Question: 11
Let $p, q, r$ ... $(\neg p \wedge r) \vee (r \rightarrow (p \wedge q))$

Let $p, q, r$ denote the statements ”It is raining”, “It is cold”, and “It is pleasant”, respectively. Then the statement “It is not raining and it is pleas...

12.2k views

answered Feb 14, 2017

3 votes

7

GATE CSE 2017 Set 2 | Question: 16
Identify the language generated by the following grammar, where $S$ is the start variable. $ S \rightarrow XY$ $ X \rightarrow aX \mid a$ $ Y \rightarrow aYb \mid \epsilon$ $\{a^mb^n \mid m \geq n, n > 0 \}$ $ \{ a^mb^n \mid m \geq n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n > 0 \}$

Identify the language generated by the following grammar, where $S$ is the start variable.$ S \rightarrow XY$$ X \rightarrow aX \mid a$$ Y \rightarrow aYb \mid \epsilon$$...

18.4k views

answered Feb 14, 2017

5 votes

8

GATE CSE 2017 Set 2 | Question: 42
The next state table of a $2-$ ... $T_1 = Q_1+Q_0, \quad T_0= \bar{Q_1} \bar{Q_0}$ $T_1 = \bar{Q_1}Q_0, \quad T_0= Q_1 + Q_0$

The next state table of a $2-$bit saturating up-counter is given below.$\begin{array}{cc|cc} Q_1 & Q_0 & Q_1^+ & Q_0^+ \\ \hline 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 0 \\ 1 & 0...

11.1k views

answered Feb 14, 2017

11 votes

9

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

answered Feb 14, 2017

0 votes

10

GATE CSE 2017 Set 2 | Question: 35
Consider two hosts $X$ and $Y$, connected by a single direct link of rate $10^6\; \text{bits/sec}$. The distance between the two hosts is $10,000\;\text{km}$ and the propagation speed along the link is $2 \times 10^8 \;\text{m/sec}$. Host $X$ ... $p$ and $q$ are $p=50$ and $q=100$ $p=50$ and $q=400$ $p=100$ and $q=50$ $p=400$ and $q=50$

Consider two hosts $X$ and $Y$, connected by a single direct link of rate $10^6\; \text{bits/sec}$. The distance between the two hosts is $10,000\;\text{km}$ and the prop...

8.1k views

answered Feb 14, 2017

16 votes

11

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

answered Feb 14, 2017

4 votes

12

GATE CSE 2017 Set 2 | Question: 49
In a B+ Tree , if the search-key value is $8$ bytes long , the block size is $512$ bytes and the pointer size is $2\;\text{B}$ , then the maximum order of the B+ Tree is ____

In a B+ Tree , if the search-key value is $8$ bytes long , the block size is $512$ bytes and the pointer size is $2\;\text{B}$ , then the maximum order of the B+ Tree is ...

10.9k views

answered Feb 14, 2017

14 votes

13

GATE CSE 2017 Set 2 | Question: GA-7
There are three boxes. One contains apples, another contains oranges and the last one contains both apples and oranges. All three are known to be incorrectly labeled. If you are permitted to open just one box and then pull out and inspect ... three boxes? The box labeled Apples' The box labeled Apples and Oranges' The box labeled Oranges' Cannot be determined

There are three boxes. One contains apples, another contains oranges and the last one contains both apples and oranges. All three are known to be incorrectly labeled. If ...

10.8k views

answered Feb 14, 2017

0 votes

14

GATE CSE 2017 Set 2 | Question: GA-6
We lived in a culture that denied any merit to literary works, considering them important only when they were handmaidens to something seemingly more urgent - namely ideology. This was a country where all gestures, even the most private, were ... that ideology is not as important as literature is revealed by the word: culture' seemingly' urgent' political'

“We lived in a culture that denied any merit to literary works, considering them important only when they were handmaidens to something seemingly more urgent – namely...

6.7k views

answered Feb 14, 2017

6 votes

15

GATE CSE 2017 Set 2 | Question: 27
If $w, x, y, z$ are Boolean variables, then which one of the following is INCORRECT? $wx+w(x+y)+x(x +y) = x+wy$ $\overline{w \bar{x}(y+\bar{z})} + \bar{w}x = \bar{w} + x + \bar{y}z$ $(w \bar{x}(y+x\bar{z}) + \bar{w} \bar{x}) y = x \bar{y}$ $(w+y)(wxy+wyz) = wxy+wyz$

If $w, x, y, z$ are Boolean variables, then which one of the following is INCORRECT?$wx+w(x+y)+x(x +y) = x+wy$$\overline{w \bar{x}(y+\bar{z})} + \bar{w}x = \bar{w} + x + ...

10.2k views

answered Feb 14, 2017

4 votes

16

GATE CSE 2017 Set 2 | Question: GA-2
Saturn is ___________ to be seen on a clear night with the naked eye. enough bright bright enough as enough bright bright as enough

Saturn is ___________ to be seen on a clear night with the naked eye.enough brightbright enoughas enough brightbright as enough

4.3k views

answered Feb 14, 2017

0 votes

17

GATE CSE 2017 Set 2 | Question: GA-4
A test has twenty questions worth $100$ marks in total. There are two types of questions. Multiple choice questions are worth $3$ marks each and essay questions are worth $11$ marks each. How many multiple choice questions does the exam have? $12$ $15$ $18$ $19$

A test has twenty questions worth $100$ marks in total. There are two types of questions. Multiple choice questions are worth $3$ marks each and essay questions are worth...

5.4k views

answered Feb 14, 2017

0 votes

18

GATE CSE 2017 Set 2 | Question: GA-1
Choose the option with words that are not synonyms. aversion, dislike luminous, radiant plunder, loot yielding, resistant

Choose the option with words that are not synonyms.aversion, dislikeluminous, radiantplunder, lootyielding, resistant

4.0k views

answered Feb 14, 2017

3 votes

19

GATE CSE 2017 Set 2 | Question: GA-3
There are five buildings called $V$, $W$, $X$, $Y$ and $Z$ in a row (not necessarily in that order). $V$ is to the West of $W$. $Z$ is to the East of $X$ and the West of $V$. $W$ is to the West of $Y$. Which is the building in the middle? $V$ $W$ $X$ $Y$

There are five buildings called $V$, $W$, $X$, $Y$ and $Z$ in a row (not necessarily in that order). $V$ is to the West of $W$. $Z$ is to the East of $X$ and the West of ...

4.6k views

answered Feb 14, 2017

4 votes

20

GATE CSE 2017 Set 2 | Question: 54
Consider the following C program. #include<stdio.h> int main () { int m=10; int n, n1; n=++m; n1=m++; n--; --n1; n-=n1; printf(“%d”, n); return 0; } The output of the program is ______

Consider the following C program.#include<stdio.h int main () { int m=10; int n, n1; n=++m; n1=m++; n ; n1; n-=n1; printf(“%d”, n); return 0; }The output of the prog...

11.9k views

answered Feb 14, 2017

1 votes

21

Test by Bikram | Mock GATE | Test 2 | Question: 59
Select the best alternative for the underlined part: Currently $93,250,000$ billion barrels per year, $\underline{\text{world consumption of oil is rising at a rate of}}$ $4.5$ percent annually. World consumption of oil is rising at a ... world's oil is being consumed at the increasing rate of The rise in the rate of the world's oil consumption is

Select the best alternative for the underlined part:Currently $93,250,000$ billion barrels per year, $\underline{\text{world consumption of oil is rising at a rate of}}$ ...

528 views

answered Jan 28, 2017

1 votes

22

What will be the resulting grammar after removal of left-recursion from the following grammar?$E$ $\rightarrow$ $Ea $|$ Eb $|$ a $|$ b$$E$$\rightarrow$ $aE'$|$ bE'$ ; ...

333 views

answered Jan 26, 2017

0 votes

23

Test by Bikram | Mock GATE | Test 1 | Question: 34
Consider the following grammar for Boolean expression: $E$ $\rightarrow$ $E$ OR $E$ $E$ $\rightarrow$ $E$ AND$E$ $E$ $\rightarrow$ NOT $E$ $E$ $\rightarrow$ $\left ( E \right )$ $E$ $\rightarrow$ TRUE $E$\rightarrow$ FALSE $E$ $\ ... grammar is Ambiguous Non-ambiguous $LL$ $\left ( 1 \right )$ Both$\left ( A \right )$ and $\left ( C \right )$

Consider the following grammar for Boolean expression:$E$ $\rightarrow$ $E$ OR $E$$E$ $\rightarrow$ $E$ AND$E$$E$ $\rightarrow$ NOT $E$$E$ $\rightarrow$ $\left ( E \right...

412 views

answered Jan 26, 2017

0 votes

24

Test by Bikram | Mock GATE | Test 1 | Question: 28
Find True $\left ( T \right )$ or False $\left ( F \right )$of the following statements : If $A$ is recursive then complement of $A$ is also recursive If $A$ and $B$ are recursive sets then $A$ intersection $B$ is not always is recursive set. Every recursive set is recursive enumerable and vice-versa $TTT$ $TFT$ $TFF$ $FFT$

Find True $\left ( T \right )$ or False $\left ( F \right )$of the following statements :If $A$ is recursive then complement of $A$ is also recursiveIf $A$ and $B$ are re...

446 views

answered Jan 26, 2017

1 votes

25

Test by Bikram | Mock GATE | Test 1 | Question: 62
Consider the set of numbers $N= 1,2,3,4,5,6,7,8$. Take every distinct two-element subset of $N$ and write down the number that is smaller. For eg, if you take the subset$\left ( 2,5 \right )$, you will write down $2$. The sum of all the numbers that you write down is ___________.

Consider the set of numbers $N= 1,2,3,4,5,6,7,8$. Take every distinct two-element subset of $N$ and write down the number that is smaller. For eg, if you take the subset$...

749 views

answered Jan 26, 2017

49 votes

26

GATE CSE 2014 Set 1 | Question: 4
Consider the following system of equations: $3x + 2y = 1 $ $4x + 7z = 1 $ $x + y + z = 3$ $x - 2y + 7z = 0$ The number of solutions for this system is ______________

Consider the following system of equations: $3x + 2y = 1 $$4x + 7z = 1 $$x + y + z = 3$$x - 2y + 7z = 0$The number of solutions for this system is ______________

13.0k views

answered Jan 15, 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