- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Problems that can be solved in polynomia...

Q. |
## Problems that can be solved in polynomial time are known as? |

A. | intractable |

B. | tractable |

C. | decision |

D. | complete |

Answer» B. tractable | |

Explanation: problems that can be solved in polynomial time are known as tractable. |

View all MCQs in:
Design and Analysis of Algorithms

- is the class of decision problems that can be solved by non- deterministic polynomial algorithms?
- A non-deterministic algorithm is said to be non-deterministic polynomial if the time- efficiency of its verification stage is polynomial.
- Which of the following problems can’t be solved using recursion?
- Which of the following problems can be solved using the longest subsequence problem?
- In what time can the Hamiltonian path problem can be solved using dynamic programming?
- 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?
- The worst-case efficiency of solving a problem in polynomial time is?
- Fractional knapsack problem can be solved in time O(n).

Login to Continue

It will take less than 2 minutes

Report MCQ