Which of the following statements is are FALSE n 1 For every non deterministic Turing machine there exists an equivalent

Gate Question Papers:

Gate Select Another Category Select Another Topic

Exam

Gate Question Topics

Category (172)

General Ability (20)

General Knowledge(5)

HR Interview (166)

Interview(7)

Logical Reasoning (36)

Numerical Ability (131)

Programming (13)

Verbal Ability (13)

Advertisements

Previous Question: Which of the following statements are TRUE? (1) The problem of determining whether there exists a cycle in an undirected graph is in P. (2) The problem of determining whether there exists a cycle in an undirected graph is in NP. (3) If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A. Option (A) 1,2 and 3 (B) 1 and 2 only (C) 2 and 3 only (D) 1 and 3 only Next Question: An index is clustered, if (A) it is on a set of fields that form a candidate key. (B) it is on a set of fields that include the primary key. (C) the data records of the file are organized in the same order as the data entries of the index. (D) the data records of the file are organized not in the same order as the data entries of the index.

(#M40029618) GATE question GATE - CS Keep an EYE

Which of the following statements is/are 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.

Option
(A) 1 and 4 only
(B) 1 and 3 only
(C) 2 only
(D) 3 only: Asked In Gate Rats (10 years ago); Unsolved; Is this Puzzle helpful? (2) (1) Submit Your Solution

Dimple

India

Punjab

Time: 00:01:33

Points

Maths Quotes

THE ESSENCE OF MATHEMATICS IS NOT TO MAKE SIMPLE THINGS DIFFICULT BUT TO MAKE DIFFICULT THINGS SIMPLE.

anne.11

In mathematics you don't understand things. You just get used to them.

Johann von Neumann

Placed User Comments

M4Math helped me a lot.

Vipul Chavan 3 years ago

Thanks m4 maths for helping to get placed in several companies.
I must recommend this website for placement preparations.

yash mittal 4 years ago

Latest Gate Aptitude Question SOLUTION: Which of the following statements is/are FALSE? (1) For every non-deterministic Turing machine, there exists an equivalent deterministic Turing machine. (2) Turing recognizable lan

Gate Question Papers:

Exam

Gate Question Topics

Category (172)

General Ability (20)

HR Interview (166)

Logical Reasoning (36)

Numerical Ability (131)

Programming (13)

Verbal Ability (13)

(#M40029618) GATE question GATE - CS Keep an EYE

Sponsored Links

Challenger of the Day

Maths Quotes

Placed User Comments

Site Links

Useful Info

Placement papers