CS6515 FINAL STUDY GUIDE EXAM 3
VERSION C 2026 COMPLETE QUESTIONS
WITH ACCURATE ANSWERS GRADED A+
⩥What is minimum runtime to validate search problem? Answer:
Polynomial time
⩥What is NP? Answer: Class of all search problems. Must be able to
validate solution to problem in polynomial time.
⩥What is P? Answer: P is the class of search problems that are solvable
in polynomial time
⩥Is P a subset of NP? If so why Answer: Yes, any problem that can be
solved in P can be solved in NP
⩥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
⩥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|
⩥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
⩥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!
⩥Is P a subset of NP? Answer: Yes
⩥What are the intractable problems? Answer: NP-complete problems,
can be solved in non-deterministic polytime but not polytime
⩥Are NP complete problems the hardest problems in NP class? Answer:
Yes
⩥If P != NP what does that mean? Answer: If P != NP then all NP-
complete problems are not in P
VERSION C 2026 COMPLETE QUESTIONS
WITH ACCURATE ANSWERS GRADED A+
⩥What is minimum runtime to validate search problem? Answer:
Polynomial time
⩥What is NP? Answer: Class of all search problems. Must be able to
validate solution to problem in polynomial time.
⩥What is P? Answer: P is the class of search problems that are solvable
in polynomial time
⩥Is P a subset of NP? If so why Answer: Yes, any problem that can be
solved in P can be solved in NP
⩥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
⩥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|
⩥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
⩥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!
⩥Is P a subset of NP? Answer: Yes
⩥What are the intractable problems? Answer: NP-complete problems,
can be solved in non-deterministic polytime but not polytime
⩥Are NP complete problems the hardest problems in NP class? Answer:
Yes
⩥If P != NP what does that mean? Answer: If P != NP then all NP-
complete problems are not in P
