1
GATE CSE 2013
MCQ (Single Correct Answer)
+2
-0.6
Which of the following is/are undecidable?
$$1.$$ $$G$$ is a $$CFG.$$ Is $$L\left( G \right) = \Phi ?$$
$$2.$$ $$G$$ is a $$CFG.$$ Is $$L\left( G \right) = \sum {{}^ * } ?$$
$$3.$$ $$M$$ is a Turing Machine. Is $$L(M)$$ regular?
$$4.$$ $$A$$ is a $$DFA$$ and $$N$$ is an $$NFA.$$
Is $$L(A)=L(N)?$$
A
$$3$$ only
B
$$3$$ and $$4$$ only
C
$$1,2$$ and $$3$$ only
D
$$2$$ and $$3$$ only
2
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
Consider three decision problems $${P_1},$$ $${P_2}$$ and $${P_3}.$$ It is known that $${P_1}$$ is decidable and $${P_2}$$ is un-decidable. Which of the following is TRUE?
A
$${P_3}$$ is decidable if $${P_1}$$ is reducible to $${P_3}$$
B
$${P_3}$$ is in-decidable if $${P_3}$$ is reducible to $${P_2}$$
C
$${P_3}$$ is un-decidable if $${P_2}$$ is reducible to $${P_3}$$
D
$${P_3}$$ is decidable if $${P_3}$$ is reducible to $${P_2}'s$$ complement
3
GATE CSE 2001
MCQ (Single Correct Answer)
+2
-0.6
Consider the following problem $$X.$$ Given a Turing machine $$M$$ over the input alphabet $$\sum , $$ any state $$q$$ of $$M$$ And a word $$w\,\,\varepsilon \,\,\sum {^ * ,} $$ does the computation of $$M$$ on $$w$$ visit the state $$q''$$

Which of the following statements about $$X$$ is correct?

A
$$X$$ is decidable
B
$$X$$ is undecidable but partially decidable
C
$$X$$ is undecidable and not even partially decidable
D
$$X$$ is not a decision problem
4
GATE CSE 2000
MCQ (Single Correct Answer)
+2
-0.6
Consider the following decision problems :

$${P_1}$$ Does a given finite state machine accept a given string

$${P_2}$$ Does a given context free grammar generate an infinite number of stings.

Which of the following statements is true?

A
Both $${P_1}$$ and $${P_2}$$ are decidable
B
Neither $${P_1}$$ and $${P_2}$$ are decidable
C
Only $${P_1}$$ is decidable
D
Only $${P_2}$$ is decidable
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP