1

GATE CSE 2001

MCQ (Single Correct Answer)

+2

-0.6

Consider the following problem $$X.$$ Given a Turing machine $$M$$ over the input alphabet $$\sum , $$ any state $$q$$ of $$M$$ And a word $$w\,\,\varepsilon \,\,\sum {^ * ,} $$ does the computation of $$M$$ on $$w$$ visit the state $$q''$$

Which of the following statements about $$X$$ is correct?

2

GATE CSE 1991

MCQ (Single Correct Answer)

+2

-0.6

Which one of the following is the strongest correct statement about a finite language over some finite alphabet $$\sum ? $$

3

GATE CSE 1990

MCQ (More than One Correct Answer)

+2

-0.6

It is decidable whether:

4

GATE CSE 1989

MCQ (More than One Correct Answer)

+2

-0.6

Which of the following problems are un-decidable?

Questions Asked from Undecidability (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

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