1

GATE CSE 2014 Set 2

MCQ (Single Correct Answer)

+1

-0.3

Let $$A\,\,{ \le _m}\,\,B$$ denotes that language $$A$$ is mapping reducible (also known as many-to-one reducible) to language $$B.$$ Which one of the following is FALSE?

2

GATE CSE 2013

MCQ (Single Correct Answer)

+1

-0.3

Which of the following statements is/are

$$1.$$ For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine

$$2.$$ Turing recognizable languages are closed under union and complementation

$$3.$$ Turing decidable languages are closed under intersection and complementation

$$4.$$ Turing recognizable languages are closed under union and intersection

**FALSE**?$$1.$$ For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine

$$2.$$ Turing recognizable languages are closed under union and complementation

$$3.$$ Turing decidable languages are closed under intersection and complementation

$$4.$$ Turing recognizable languages are closed under union and intersection

3

GATE CSE 2008

MCQ (Single Correct Answer)

+1

-0.3

Which of the following is true for the language $$\left\{ {{a^p}} \right.\left| P \right.$$ prime $$\left. \, \right\}$$?

4

GATE CSE 2003

MCQ (Single Correct Answer)

+1

-0.3

Nobody knows yet if $$P=NP$$. Consider the language $$L$$ defined as follows

$$L = \left\{ {\matrix{ {{{\left( {0 + 1} \right)}^ * }\,\,\,if\,\,P = NP} \cr {\,\,\,\,\,\,\,\phi \,\,\,\,Otherwise} \cr } } \right.$$

$$L = \left\{ {\matrix{ {{{\left( {0 + 1} \right)}^ * }\,\,\,if\,\,P = NP} \cr {\,\,\,\,\,\,\,\phi \,\,\,\,Otherwise} \cr } } \right.$$

Which of the following statement is true?

Questions Asked from Recursively Enumerable Language and Turing Machine (Marks 1)

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