The complexity class P consist of all the decision problems that can b – McqOptions

MCQOPTIONS

1.	The complexity class P consist of all the decision problems that can be solved by ___________using polynomial amount of computation time.
A.	Push Down automata
B.	DFA
C.	NDFA
D.	Deterministic Turing machine
Answer» E.

Discussion

No Comment Found

Related MCQs

State true or false?Statement: Given a turing machine, an input for the machine, and a number T(unary), does that machine halt on that input within the first T-steps?
Which of the following is a P-complete type of problem?
A problem X belongs to P complexity class if there exist ________ algorithm to solve that problem, such that the number of steps of the algorithms bounded by a polynomial in n, where n is the length of the input.
The complexity class P consist of all the decision problems that can be solved by ___________using polynomial amount of computation time.
If the number of steps required to solve a problem is O(nk), then the problem is said to be solved in: