NEW
New Website Launch
Experience the best way to solve previous year questions with mock tests (very detailed analysis), bookmark your favourite questions, practice etc...
1

GATE CSE 2002

MCQ (Single Correct Answer)
The $$C$$ language is:
A
A context free language
B
A context sensitive language
C
A regular language
D
Parsable fully only by a Turing machine
2

GATE CSE 2002

MCQ (Single Correct Answer)
Which of the following is true?
A
The complement of a recursively language is recursive.
B
The complement of a recursively enumerable language is recursively enumerable.
C
The complement of a recursively language is either recursive or recursively enumerable.
D
The complement of a context-free language is context-free.
3

GATE CSE 1997

MCQ (Single Correct Answer)
Which one of the following is not decidable?
A
Given a Turing machine $$M,$$ a stings s and an integer $$k,$$ $$M$$ accepts $$s$$ within $$k$$ steps
B
Equivalence of two given Turing machines
C
Language accepted by a given finite state machine is not empty
D
Language generated by a context free grammar is non empty
4

GATE CSE 1994

MCQ (Single Correct Answer)
Which of the following conversions is not possible (algorithmically)?
A
Regular grammar to context free grammar
B
Non-deterministic $$FSA$$ to deterministic $$FSA$$
C
Non-deterministic $$PDA$$ to deterministic $$PDA$$
D
Non-deterministic Turing machine to deterministic Turing machine

Joint Entrance Examination

JEE Main JEE Advanced WB JEE

Graduate Aptitude Test in Engineering

GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN

Medical

NEET

CBSE

Class 12