CS6515 EXAM 3 STUDY GUIDE QUESTIONS AND ANSWERS GRADED A+ 2026

CS6515 EXAM 3 STUDY GUIDE
QUESTIONS AND ANSWERS GRADED A+
2026




What is a P problem? - ANS P = Polynomial

-A problem that can be solved in Polynomial time.

-There is a Polynomial time algorithm to solve it.



What is a NP problem? - ANS NP = Non-Deterministically Polynomial

-A problem where the Solution can be VERIFIED in Polynomial-Time



What are differences in P and NP? - ANS All P problems are in NP but all NP problems are not
in P. P is a subset of NP.

-Problems may be verifiable in Polynomial-Time but not solvable in Polynomial-Time



What are NP-Complete Problems? - ANS The hardest problems in the NP class.

A problem is NP-Complete if it is in NP and in NP-Hard.



What are NP-Hard problems? - ANS A problem at least as hard as every problem in the class
NP.

A problem is NP-Hard if all other problems in NP can be polynomially reduced to it.

@COPYRIGHT 2026/2027 ALLRIGHTS RESERVED 1