1
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which of the following decision problems are undecidable?

$$\,\,\,\,\,\,\,\,\,\,{\rm I}.\,\,\,\,\,\,\,\,\,\,$$ Given $$NFAs$$ $${N_1}$$ and $${N_2},$$ is $$L\left( {{N_1}} \right) \cap L\left( {{N_2}} \right) = \Phi ?$$
$$\,\,\,\,\,\,\,\,{\rm I}{\rm I}.\,\,\,\,\,\,\,\,\,\,$$Given a $$CFG\,G = \left( {N,\sum {\,,P} ,S} \right)$$ and string $$x \in \sum {^ * } ,$$ does
$$\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,$$ $$x \in L\left( G \right)?$$
$$\,\,\,\,\,\,{\rm I}{\rm I}{\rm I}.\,\,\,\,\,\,\,\,\,\,$$ Given $$CFGs\,\,{G_1}$$ and $${G_2},$$ is $$L\left( {{G_1}} \right) = L\left( {{G_2}} \right)?$$
$$\,\,\,\,\,\,{\rm I}V.\,\,\,\,\,\,\,\,\,\,$$ Given a $$TM$$ $$M,$$ is $$L\left( M \right) = \Phi ?$$

A
$${\rm I}$$ and $${\rm IV}$$ only
B
$${\rm II}$$ and $${\rm I}$$$${\rm I}$$$${\rm I}$$ only
C
$${\rm I}$$$${\rm I}$$$${\rm I}$$ and $${\rm IV}$$ only
D
$${\rm II}$$ and $${\rm IV}$$ only
2
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $$0s$$ and two consecutive $$1s?$$
A
$$\left( {0 + 1} \right){}^ * 0011\left( {0 + 1} \right){}^ * + \left( {0 + 1} \right){}^ * 1100\left( {0 + 1} \right){}^ *$$
B
$$\left( {0 + 1} \right){}^ * \left( {00\left( {0 + 1} \right){}^ * 11 + 11\left( {0 + 1} \right){}^ * \left. {00} \right)} \right.\left( {0 + 1} \right){}^ *$$
C
$$\left( {0 + 1} \right){}^ * 00\left( {0 + 1} \right){}^ * + \left( {0 + 1} \right){}^ * 11\left( {0 + 1} \right){}^ *$$
D
$$00\left( {0 + 1} \right){}^ * 11 + 11\left( {0 + 1} \right){}^ * 00$$
3
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+2
-0.6
Consider the transition diagram of a $$PDA$$ given below with input alphabet $$\sum {\, = \left\{ {a,b} \right\}}$$ and stack alphabet $$\Gamma = \left\{ {X,Z} \right\}.$$ $$Z$$ is the initial stack symbol. Let $$L$$ denote the language accepted by the $$PDA.$$

Which one of the following is TRUE?

A
$$L = \left\{ {{a^n}{b^n}|n \ge 0} \right\}$$ and is not accepted by any finite automata
B
$$L = \left\{ {{a^n}|n \ge 0} \right\} \cup \left\{ {{a^n}{b^n}|n \ge 0} \right\}$$ and is not accepted by any deterministic $$PDA$$
C
$$L$$ is not accepted by any Turing machine that halts on every input
D
$$L = \left\{ {{a^n}|n \ge 0} \right\} \cup \left\{ {{a^n}{b^n}|n \ge 0} \right\}$$ and is deterministic context-free
4
GATE CSE 2016 Set 1
MCQ (Single Correct Answer)
+2
-0.6
Consider the following context-free grammars:
\eqalign{ & {G_1}:\,\,\,\,\,S \to aS|B,\,\,B \to b|bB \cr & {G_2}:\,\,\,\,\,S \to aA|bB,\,\,A \to aA|B|\varepsilon ,\,\,B \to bB|\varepsilon \cr}

Which one of the following pairs of languages is generated by $${G_1}$$ and $${G_2}$$, respectively?

A
$$\left\{ {{a^m}{b^n}|m > 0\,\,\,\,} \right.$$ or $$\,\,\,\,$$$$n > \left. 0 \right\}$$ and $$\left\{ {{a^m}{b^n}|m > 0\,\,\,\,} \right.$$ and $$\,\,\,\,n > \left. 0 \right\}\,\,\,\,$$
B
$$\left\{ {{a^m}{b^n}|m > 0\,\,\,\,} \right.$$ and $$\,\,\,n > \left. 0 \right\}\,\,\,\,$$ and $$\left\{ {{a^m}{b^n}|m > 0\,\,\,\,} \right.$$ or $$\,\,\,\,n \ge \left. 0 \right\}$$
C
$$\left\{ {{a^m}{b^n}|m \ge 0\,\,\,\,} \right.$$ or $$\,\,\,\,n > \left. 0 \right\}\,\,\,\,$$ and $$\left\{ {{a^m}{b^n}|m > 0\,\,\,\,} \right.\,$$ and $$\,\,\,\,n > \left. 0 \right\}\,\,\,\,$$
D
$$\left\{ {{a^m}{b^n}|m \ge 0\,\,\,\,} \right.$$ and $$\,\,\,n > \left. 0 \right\}\,\,\,\,$$ and $$\left\{ {{a^m}{b^n}|m > 0\,\,\,\,} \right.\,$$ or $$\,\,\,\,n > \left. 0 \right\}\,\,\,\,$$
GATE CSE Papers
2023
2022
2020
2019
2018
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988
1987
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
CBSE
Class 12
© ExamGOAL 2024