1
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following regular expressions over $$\left\{ {0,\,\,1} \right\}$$ denotes the set of all strings not containing $$100$$ as substring?
A
$${0^ * }{\left( {1 + 0} \right)^ * }$$
B
$${0^ * }\,\,{1010^ * }$$
C
$${0^ * }\,\,{1^ * }\,\,{01^ * }$$
D
$${0^ * }{\left( {10 + 1} \right)^ * }$$
2
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6
Which of the following languages over $$\left\{ {a,b,c} \right\}$$ is accepted by Deterministic push down automata?
A
$$\left\{ {w \subset {w^R}\left| {w \in \left\{ {a,b} \right\}{}^ * } \right.} \right\}$$
B
$$\left\{ {w{w^R}\left| {w \in \left\{ {a,b,c} \right\}{}^ * } \right.} \right\}$$
C
$$\left\{ {{a^n}{b^n}{c^n}\left| {n \ge 0} \right.} \right\}$$
D
$$\left\{ {w\left| w \right.} \right.$$ is palindrome over $$\left. {\left\{ {a,b,c} \right\}} \right\}$$
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12