ExamSIDE
Questions (Powered by ExamGOAL)
Theory of Computation
Finite Automata and Regular Language
Marks 1Marks 2Marks 5
Push Down Automata and Context Free Language
Marks 1Marks 2
Undecidability
Marks 1Marks 2
Recursively Enumerable Language and Turing Machine
Marks 1Marks 2
Previous Next
1
GATE CSE 1992
MCQ (Single Correct Answer)
+2
-0.6
If $$G$$ is a context-free grammar and $$w$$ is a string of length $$n$$ in $$L(G),$$ how long is a derivation of $$w$$ in $$G,$$ if $$G$$ is Chomsky normal form?
A
$$2n$$
B
$$2n+1$$
C
$$2n-1$$
D
$$n$$
2
GATE CSE 1992
MCQ (Single Correct Answer)
+2
-0.6
Which of the following regular expression identities are true?
A
$$r\left( {^ * } \right) = r{}^ * $$
B
$$\left( {r{}^ * s{}^ * } \right){}^ * = \left( {r + s} \right){}^ * $$
C
$$\,\left( {r + s} \right){}^ * = r{}^ * + s{}^ * $$
D
$$r{}^ * s{}^ * = r{}^ * + s{}^ * $$
3
GATE CSE 1991
MCQ (Single Correct Answer)
+2
-0.6
Let $$r = 1\,{\left( {1 + 0} \right)^ * },s = {11^ * }\,0$$ and $$\,t = {1^ * }\,0$$ be three regular expressions. Which one of the following is true?
A
$$L\left( s \right) \subseteq L\left( r \right)\,\,$$ and $$L\left( s \right) \subseteq L\left( t \right)\,\,$$
B
$$L\left( r \right) \subseteq L\left( s \right)\,\,$$ and $$L\left( s \right) \subseteq L\left( t \right)\,\,$$
C
$$L\left( s \right) \subseteq L\left( t \right)\,\,$$ and $$L\left( s \right) \subseteq L\left( r \right)\,\,$$
D
$$L\left( t \right) \subseteq L\left( s \right)\,\,$$ and $$L\left( s \right) \subseteq L\left( r \right)\,\,$$
4
GATE CSE 1990
MCQ (Single Correct Answer)
+2
-0.6
Let $${R_1}$$ and $${R_2}$$ be regular sets defined over the alphabet $$\sum \, $$ then:
A
$${R_1} \cap R{}_2$$ is not regular.
B
$${R_1} \cup R{}_2$$ is regular.
C
$$\sum {^{^ * }} $$ $$-$$ $${R_1}$$ is regular.
D
$${R_1}{}^ * $$ is not regular.
Previous Next
Questions Asked from Marks 2
GATE CSE 2025 Set 2 (2) GATE CSE 2025 Set 1 (3) GATE CSE 2024 Set 2 (2) GATE CSE 2024 Set 1 (2) GATE CSE 2023 (1) GATE CSE 2021 Set 2 (3) GATE CSE 2021 Set 1 (1) GATE CSE 2020 (1) GATE CSE 2019 (1) GATE CSE 2018 (2) GATE CSE 2016 Set 2 (2) GATE CSE 2016 Set 1 (1) GATE CSE 2015 Set 2 (3) GATE CSE 2015 Set 1 (2) GATE CSE 2014 Set 2 (2) GATE CSE 2014 Set 1 (1) GATE CSE 2013 (1) GATE CSE 2012 (1) GATE CSE 2011 (2) GATE CSE 2010 (2) GATE CSE 2009 (2) GATE CSE 2008 (3) GATE CSE 2007 (4) GATE CSE 2006 (2) GATE CSE 2005 (1) GATE CSE 2004 (1) GATE CSE 2003 (2) GATE CSE 2002 (2) GATE CSE 2001 (2) GATE CSE 2000 (1) GATE CSE 1998 (1) GATE CSE 1997 (1) GATE CSE 1995 (2) GATE CSE 1994 (2) GATE CSE 1992 (2) GATE CSE 1991 (1) GATE CSE 1990 (1) GATE CSE 1989 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization