CS6515 EXAM 3 NEWEST VERSION
Complete Questions and Guide Answers
100% Verified Graded A+
1. Search Problem (informal definition)
Answer: Problem where we can eflciently verify solution
2. What is minimum runtime to validate search problem?
Answer: Polynomial time
3. What is NP?
Answer: Class of all search problems. Must be able to validate solution to problem in polynomial time.
4. What is P?
Answer: P is the class of search problems that are solvable in polynomial time
5. Is P a subset of NP? If so why
Answer: Yes, any problem that can be solved in P can be solved in NP
6. What is the benefit of showing P = NP?
Answer: We know that if we can verify a solution for a search problem in polynomial time then we can
solve that problem in polynomial time
, 7. What is Search Problem (formal definition)?
Answer: Given Instance I
- find a solution S for I if one exists
- Output No if I has no solutions
In order to be a search problem. If given I and solution S, then we can verify that S is a solution to I in polynomial time
(polynomial) in |I|
8. How can you prove that problem is a search problem?
Answer: Show/prove that there is an
algorithm that can verify solution in polynomial ||I Time
9. What does NP stand for?
Answer: NP stands for non-deterministic polynomial time (it does not stand for Not Polynomial lol). Non
deterministic machine is one that is allowed to guess at each step!
10. Is P a subset of NP?
Answer: Yes
11. What are the intractable problems?
Answer: NP-complete problems, can be solved in non-deterministic polytime but not polytime
Complete Questions and Guide Answers
100% Verified Graded A+
1. Search Problem (informal definition)
Answer: Problem where we can eflciently verify solution
2. What is minimum runtime to validate search problem?
Answer: Polynomial time
3. What is NP?
Answer: Class of all search problems. Must be able to validate solution to problem in polynomial time.
4. What is P?
Answer: P is the class of search problems that are solvable in polynomial time
5. Is P a subset of NP? If so why
Answer: Yes, any problem that can be solved in P can be solved in NP
6. What is the benefit of showing P = NP?
Answer: We know that if we can verify a solution for a search problem in polynomial time then we can
solve that problem in polynomial time
, 7. What is Search Problem (formal definition)?
Answer: Given Instance I
- find a solution S for I if one exists
- Output No if I has no solutions
In order to be a search problem. If given I and solution S, then we can verify that S is a solution to I in polynomial time
(polynomial) in |I|
8. How can you prove that problem is a search problem?
Answer: Show/prove that there is an
algorithm that can verify solution in polynomial ||I Time
9. What does NP stand for?
Answer: NP stands for non-deterministic polynomial time (it does not stand for Not Polynomial lol). Non
deterministic machine is one that is allowed to guess at each step!
10. Is P a subset of NP?
Answer: Yes
11. What are the intractable problems?
Answer: NP-complete problems, can be solved in non-deterministic polytime but not polytime
