ANAL UP ALUUm FINAL PART1 ouesnoN13 which ot the following is QUESTION14. Which

Question

ANAL UP ALUUm FINAL PART1 ouesnoN13 which ot the following is QUESTION14. Which of the following is not in P? E. Max Cut D. Minimum Spanning Tree C. Min Cut B. 2-SAT Linear Programming QUESTION15. How many NP problems did Karp include in his tree hierarchy? E. 31 D. 22 A. 1 QUESTION16. Which of the following is not one of Karp's original NP problems? C. Feedback Arc Set D. Feedback N Set E. Partition B. Node Cover Arc Cover QUESTION17. Which is not a property of a problem in the NP class of algorithms? A. The true solution can be obtained through a brute force method. B Can be unsolvable. C. There must be a Turing machine that solves D. A polynomial time algorithm may exist. E. A deterministic algorithm exists that can solve it. the problem. QUESTION18. Which is not a property of random algorithms? A deterministic algorithm exists that solves the same problem B. Some cannot be accomplished in polynomial time. C. The computer makes a choice. D. A finite number of steps E. The computer always get the right answer. QUESTION19. Which is not true about the P NP question? A. A prize exists to the person who solves the question B. The "P" on both sides of the equation refers to time complexity C. P NP, then there exist NP-complete problems that are not solvable. D Both sides refer to Turing machines. E. If P NP, then there exists some deterministic polynomial timed algorithm for any NP problem.

Explanation / Answer

1. Which of the following is (x4)

Solution: (x4)1

2. Which of the following is not in P

Solution: Max cut

3. How many NP problems did Karp include in his tree hierarchy

Solution : 21

4. Which of the following is not one of the Karp’s original NP problems

Solution: Arc cover and Node cover

Explanation

Karp’s 21 problems

Solution: The true solution can be obtained through a brute force method

6. Which is not a property of random algorithms

Solution: The computer always gets the right answer

Unsolvable problems by computer science

Solution: If P NP, then there exist NP- complete problems that are not solvable

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.