Register
Filter

Answers by Bhagirathi

6 votes
65
GATE IT 2006 | Question: 32
Let $L$ be a context-free language and $M$ a regular language. Then the language $L ∩ M$ is always regular never regular always a deterministic context-free language always a context-free language
Let $L$ be a context-free language and $M$ a regular language. Then the language $L ∩ M$ isalways regularnever regularalways a deterministic context-free languagealways...
0 votes
66
is it context free?
is it cfl L = { a^n b^n c^m | n>=1 , m=2n } ? i did like for stack push and pop " a & b " are coverd and later we are having stack empty? can we write this language as a^n b^n c^2n ?
is it cfl L = { a^n b^n c^m | n>=1 , m=2n } ?i did like for stack push and pop " a & b " are coverd and later we are having stack empty? can we write this language ...
0 votes
69
Matching in graph theory
Can anone please explain what is a perfect matching in graph theory?
Can anone please explain what is a perfect matching in graph theory?
–1 votes
70
Omega notation
Is sqrt(n)+ log n = omega(log n)? If yes then please explain why...?
Is sqrt(n)+ log n = omega(log n)? If yes then please explain why...?
11 votes
72
GATE CSE 2009 | Question: 2
What is the chromatic number of an $n$ vertex simple connected graph which does not contain any odd length cycle? Assume $n > 2$. $2$ $3$ $n-1$ $n$
What is the chromatic number of an $n$ vertex simple connected graph which does not contain any odd length cycle? Assume $n 2$.$2$$3$$n-1$ $n$
3 votes
73
GATE IT 2004 | Question: 54
Which one of the following binary trees has its inorder and preorder traversals as $BCAD$ and $ABCD$, respectively?
Which one of the following binary trees has its inorder and preorder traversals as $BCAD$ and $ABCD$, respectively?
4 votes
74
Is it option A ?
2 votes
76
try to print this in one loop itself.
try to print this in one loop itself.i have already done this in two loops(one nested into another).so please try to do in one loop itself. 1 2 4 3 6 9 4 8 12 16 5 10 15 20 25
try to print this in one loop itself.i have already done this in two loops(one nested into another).so please try to do in one loop itself.12 43 6 94 8 12 165 ...
2 votes
78
GATE IT 2005 | Question: 47
$(34.4)_{8} × \left ( 23.4 \right )_{8}$ evaluates to $(1053.6)_{8}$ $(1053.2)_{8}$ $(1024.2)_{8}$ None of these
$(34.4)_{8} × \left ( 23.4 \right )_{8}$ evaluates to$(1053.6)_{8}$$(1053.2)_{8}$$(1024.2)_{8}$None of these
1 votes
79
GATE IT 2005 | Question: 48
The circuit shown below implements a $\text{2-input}$ NOR gate using two $2-4$ MUX (control signal $1$ selects the upper input). What are the values of signals $x, y$ and $z$? $1, 0, B$ $1, 0, A$ $0, 1, B$ $0, 1, A$
The circuit shown below implements a $\text{2-input}$ NOR gate using two $2-4$ MUX (control signal $1$ selects the upper input). What are the values of signals $x, y$ and...
–2 votes
81
GATE IT 2008 | Question: 11
For problems X and Y, Y is NP-complete and X reduces to Y in polynomial time. Which of the following is TRUE? If X can be solved in polynomial time, then so can Y X is NP-complete X is NP-hard X is in NP, but not necessarily NP-complete
For problems X and Y, Y is NP-complete and X reduces to Y in polynomial time. Which of the following is TRUE?If X can be solved in polynomial time, then so can YX is NP-c...
39 votes
84
GATE IT 2005 | Question: 51
Let $T(n)$ be a function defined by the recurrence $T(n) = 2T(n/2) + \sqrt n$ for $n \geq 2$ and $T(1) = 1$ Which of the following statements is TRUE? $T(n) = \Theta(\log n)$ $T(n) = \Theta(\sqrt n)$ $T(n) = \Theta(n)$ $T(n) = \Theta(n \log n)$
Let $T(n)$ be a function defined by the recurrence$T(n) = 2T(n/2) + \sqrt n$ for $n \geq 2$ and$T(1) = 1$Which of the following statements is TRUE?$T(n) = \Theta(\log n)$...
Page: