- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- is the class of decis...

Q. |
## is the class of decision problems that can be solved by non- deterministic polynomial algorithms? |

A. | np |

B. | p |

C. | hard |

D. | complete |

Answer» A. np | |

Explanation: np problems are called as non- deterministic polynomial problems. they are a class of decision problems that can be solved using np algorithms. |

View all MCQs in:
Design and Analysis of Algorithms

- A non-deterministic algorithm is said to be non-deterministic polynomial if the time- efficiency of its verification stage is polynomial.
- Problems that can be solved in polynomial time are known as?
- Which of the following problems can’t be solved using recursion?
- Which of the following problems can be solved using the longest subsequence problem?
- The choice of polynomial class has led to the development of an extensive theory called
- How many stages of procedure does a non- deterministic algorithm consist of?
- Which of the following problems is NOT solved using dynamic programming?
- Which of the following problems should be solved using dynamic programming?
- Problems that cannot be solved by any algorithm are called?
- In what time can the Hamiltonian path problem can be solved using dynamic programming?

Login to Continue

It will take less than 2 minutes

Report MCQ