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
1
GATE CSE 1989
MCQ (More than One Correct Answer)
+2
-0
Context free languages and regular languages are both closed under the operation(s) of :
A
Union
B
Intersection
C
Concatenation
D
Complementation
2
GATE CSE 1987
MCQ (Single Correct Answer)
+2
-0.6
FORTRAN is:
A
Regular language.
B
Context free language.
C
Context sensitive language.
D
None-of the above.
3
GATE CSE 1987
MCQ (Single Correct Answer)
+2
-0.6
A context-free grammar is ambiguous if:
A
The grammar contains useless non-terminals.
B
It produces more than one parse tree for some sentence.
C
Some production has two non-terminals side by side on the right-hand side.
D
None of the above.
Previous
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