Answered: What does it mean "a problem belongs to…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Concept explainers

Question

Formal language (Tractability, Satisfiability, P and NP)

1.What does it mean "a problem belongs to the complexity class NP"?

Select one or more:

a)There exists no program that can solve the problem..

b)The problem can be solved by a deterministic program in non-polynomial time.

c)The problem can be solved by a deterministic program in polynomial time.

d)The problem can be solved by a non-deterministic program in polynomial time.

2. A problem is undecidable when:

Select one or more:

a)we cannot construct a Turing machine for it that would always halt answering either yes or no.

b)we cannot construct a pushdown automaton for solving it.

c)we are not sure if there exists a Turing machine that is able to solve it.

d)we are not able to decide whether to use a Turing machine or a pushdown automaton to solve it.

3. A language is said to be recursive is there exists a "recursive Turing machine" that accepts it.

Select one:

a)True

b)False

4. There exist languages that no Turing machine accepts.

Select one:

a)True

b)False

5. Every problem from the complexity class NP can be reduced to a problem from the complexity class P in polynomial time.

Select one:

a)True

b)False

6. A Turing machine that stops and answers either "yes" or "no" for every input word is also called an algorithm.

Select one:

a)True

b)False

7. Which of the listed problems belong only to the complexity class NP?

Select one or more:

a)The problem of sorting a sequence of numbers.

b)The problem of searching a number in a sequence of numbers.

c)The travelling salesman problem.

d)The knapsack problem.

8. It is always possible to reduce a problem that is solvable by a Turing machine to a problem that is solvable by a pushdown automaton with two stacks and vice-versa.

Select one:

a)True

b)False

9. The Universal Turing machine is:

Select one:

a) A Turing machine that "simulates" the operation of another (given) Turing machine on a given input.

b)An "ordinary" Turing machine that accepts the diagonalization language.

c)A Turing machine that accepts languages that are not accepted by pushdown automata.

d) A Turing machine that accepts all the languages.

10. Turing machines accept exactly the set of context-free languages.

Select one:

a)True

b)False

Expert Solution

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions