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 1999
MCQ (More than One Correct Answer)
+2
-0
If $${L_1}$$ is a context free language and $${L_2}$$ is a regular which of the following is/are false?
A
$${L_1} - {L_2}$$ is not context free
B
$${L_1} \cap {L_2}$$ is context free
C
$$ \sim {L_1}$$ is context free
D
$$ \sim {L_2}$$ is regular
2
GATE CSE 1998
MCQ (Single Correct Answer)
+2
-0.6
Let $$L$$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimum state deterministic finite-state automation accepting $$L$$ is
A
$$2$$
B
$$5$$
C
$$8$$
D
$$3$$
3
GATE CSE 1998
MCQ (Single Correct Answer)
+2
-0.6
Which of the following statements is false?
A
Every finite subset of a non-regular set is regular
B
Every subset of a regular set is regular
C
Every finite subset of a regular set is regular
D
The intersection of two regular sets is regular
4
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\}$$
Previous Next
Questions Asked from Marks 2
GATE CSE 2025 Set 1 (1) GATE CSE 2024 Set 2 (1) GATE CSE 2024 Set 1 (1) GATE CSE 2023 (2) GATE CSE 2022 (2) GATE CSE 2021 Set 2 (1) GATE CSE 2021 Set 1 (1) GATE CSE 2020 (1) GATE CSE 2019 (1) GATE CSE 2018 (1) GATE CSE 2016 Set 1 (1) GATE CSE 2015 Set 3 (1) GATE CSE 2014 Set 3 (1) GATE CSE 2013 (1) GATE CSE 2011 (1) GATE CSE 2010 (1) GATE CSE 2008 (3) GATE CSE 2007 (3) GATE CSE 2006 (1) GATE CSE 2005 (3) GATE CSE 2004 (3) GATE CSE 1999 (1) GATE CSE 1998 (2) GATE CSE 1997 (1) GATE CSE 1996 (2) GATE CSE 1994 (1) GATE CSE 1992 (1) GATE CSE 1989 (1) GATE CSE 1987 (2)
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