1
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6
Which one of the following is not decidable?
2
GATE CSE 1994
MCQ (Single Correct Answer)
+2
-0.6
Which of the following conversions is not possible (algorithmically)?
3
GATE CSE 1992
MCQ (More than One Correct Answer)
+2
-0
In which of the cases stated below is the following statement true?
“For every non-deterministic machine $${M_1}$$ there exists an equivalent deterministic machine $${M_2}$$ recognizing the same language“.
“For every non-deterministic machine $${M_1}$$ there exists an equivalent deterministic machine $${M_2}$$ recognizing the same language“.
4
GATE CSE 1990
MCQ (Single Correct Answer)
+2
-0.6
Recursive languages are:
Questions Asked from Recursively Enumerable Language and Turing Machine (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2022 (1)
GATE CSE 2021 Set 1 (1)
GATE CSE 2019 (1)
GATE CSE 2018 (2)
GATE CSE 2016 Set 1 (1)
GATE CSE 2016 Set 2 (1)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 1 (1)
GATE CSE 2008 (1)
GATE CSE 2006 (2)
GATE CSE 2005 (1)
GATE CSE 2003 (2)
GATE CSE 2002 (2)
GATE CSE 1997 (1)
GATE CSE 1994 (1)
GATE CSE 1992 (1)
GATE CSE 1990 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages