Register

Recent questions tagged gatecse-2013

113 votes
9 answers
31
GATE CSE 2013 | Question: 30
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is $\Theta(1)$ $\Theta(\sqrt{\log} n)$ $\Theta(\frac{\log n}{\log \log n})$ $\Theta(\log n)$
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is$\Theta(1)$$\Theta(\sqrt{\log} n)$$\Theta(\frac{\log n}{\log \log n})$$\Theta(\log n)...
User Avatar
53 votes
8 answers
34
GATE CSE 2013 | Question: 27
What is the logical translation of the following statement? "None of my friends are perfect." $∃x(F (x)∧ ¬P(x))$ $∃ x(¬ F (x)∧ P(x))$ $ ∃x(¬F (x)∧¬P(x))$ $ ¬∃ x(F (x)∧ P(x))$
What is the logical translation of the following statement?"None of my friends are perfect."$∃x(F (x)∧ ¬P(x))$$∃ x(¬ F (x)∧ P(x))$$ ∃x(¬F (x)∧¬P(x))$$ ¬�...
User Avatar
25 votes
2 answers
36
GATE CSE 2013 | Question: 25
Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q: Sum of degrees of all vertices is even. P only Q only Both P and Q Neither P nor Q
Which of the following statements is/are TRUE for undirected graphs?P: Number of odd degree vertices is even.Q: Sum of degrees of all vertices is even. P only Q only Both...
User Avatar
61 votes
6 answers
37
GATE CSE 2013 | Question: 24
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\dfrac{1}{2}.$ What is the expected number of unordered cycles of length three? $\dfrac {1}{8}$ $1$ $7$ $8$
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\dfrac{1}{2}.$ What is the expected number of ...
User Avatar
17 votes
4 answers
39
GATE CSE 2013 | Question: 22
Which one of the following functions is continuous at $x = 3?$ $f(x) = \begin{cases} 2,&\text{if $x = 3$ } \\ x-1& \text{if $x > 3$}\\ \frac{x+3}{3}&\text{if $x < 3$ } \end{cases}$ ... $} \end{cases}$ $f(x) = \begin{cases} \frac{1}{x^3-27}&\text{if $x \neq 3$ } \end{cases}$
Which one of the following functions is continuous at $x = 3?$$f(x) = \begin{cases} 2,&\text{if $x = 3$ } \\ x-1& \text{if $x 3$}\\ \frac{x+3}{3}&\text{if $x < 3$ } \end...
User Avatar
31 votes
7 answers
40
GATE CSE 2013 | Question: 21
Which one of the following expressions does NOT represent exclusive NOR of $x$ and $y$? $xy + x′ y′$ $x\oplus y′$ $x′\oplus y$ $x′\oplus y′$
Which one of the following expressions does NOT represent exclusive NOR of $x$ and $y$?$xy + x′ y′$$x\oplus y′$$x′\oplus y$$x′\oplus y′$
User Avatar
34 votes
4 answers
42
GATE CSE 2013 | Question: 19
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices? $\theta(n^2)$ $\theta(n^2\log n)$ $\theta(n^3)$ $\theta(n^3\log n)$
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?$\theta(n^2)$ $\theta(n^2\log n)$ $\theta(n^3)...
User Avatar
83 votes
13 answers
52
GATE CSE 2013 | Question: 9
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilon$ and $A \rightarrow a$) to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^{n}$
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production (i.e., of type $A \rightarrow \epsilo...
User Avatar
50 votes
5 answers
53
GATE CSE 2013 | Question: 8
Consider the languages $L_1 = \phi$ and $L_2 = \{a\}$. Which one of the following represents $L_1 {L_2}^* \cup {L_1}^*$ ? $\{\epsilon\}$ $\phi$ $a^*$ $\{\epsilon, a\}$
Consider the languages $L_1 = \phi$ and $L_2 = \{a\}$. Which one of the following represents $L_1 {L_2}^* \cup {L_1}^*$ ?$\{\epsilon\}$$\phi$$a^*$$\{\epsilon, a\}$
User Avatar
41 votes
4 answers
54
GATE CSE 2013 | Question: 7
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of $n$ nodes? $O(1)$ $O(\log n)$ $O(n)$ $O(n \log n)$
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of $n$ nodes?$O(1)$$O(\log n)$...
User Avatar
37 votes
2 answers
55
GATE CSE 2013 | Question: 6
Which one of the following is the tightest upper bound that represents the number of swaps required to sort $n$ numbers using selection sort? $O(\log n$) $O(n$) $O(n \log n$) $O(n^{2}$)
Which one of the following is the tightest upper bound that represents the number of swaps required to sort $n$ numbers using selection sort?$O(\log n$)$O(n$)$O(n \log n$...
User Avatar
28 votes
3 answers
56
GATE CSE 2013 | Question: 5
In the following truth table, $V = 1$ ... What function does the truth table represent? Priority encoder Decoder Multiplexer Demultiplexer
In the following truth table, $V = 1$ if and only if the input is valid.$$\begin{array}{cc}\textbf{Inputs}&\textbf{Outputs}\\ \begin{array}{|c|c|c|c|} \hline{D_0}&D_1&D_2...
User Avatar
21 votes
2 answers
57
GATE CSE 2013 | Question: 4
The smallest integer that can be represented by an $8\text{-bit}$ number in $2's$ complement form is $-256$ $-128$ $-127$ $0$
The smallest integer that can be represented by an $8\text{-bit}$ number in $2's$ complement form is$-256$$-128$ $-127$$0$
User Avatar
38 votes
6 answers
58
GATE CSE 2013 | Question: 3
Which one of the following does NOT equal $\begin{vmatrix} 1 & x & x^{2}\\ 1& y & y^{2}\\ 1 & z & z^{2} \end{vmatrix} \quad ?$ $\begin{vmatrix} 1& x(x+1)& x+1\\ 1& y(y+1) & y+1\\ 1& z(z+1) & z+1 \end{vmatrix}$ ...
Which one of the following does NOT equal $$\begin{vmatrix} 1 & x & x^{2}\\ 1& y & y^{2}\\ 1 & z & z^{2} \end{vmatrix} \quad ?$$$\begin{vmatrix} 1& x(x+1)& x+1\\ 1& y(y+1...
User Avatar
Page: