CS6515 EXAM 3 STUDY GUIDE 2026/2027 ACTUAL QUESTIONS WITH VERIFIED ANSWERS.

CS6515 EXAM 3 STUDY GUIDE
2026/2027 ACTUAL QUESTIONS
WITH VERIFIED ANSWERS.

What problems are known NP-Hard? - correct answer-1. Max-
Independent-Set problem.




What problems are known NP-Complete? - correct answer-1.
Max-Independent-Set
2. Clique
3. Vertex Cover
4. SAT
5. 3SAT
6. Independent Set




What problems are known NP? - correct answer-




What problems are known P? - correct answer-

, What is Vertex Cover? - correct answer-A set of vertices where
every edge is "covered".
-For every edge, at least one vertex is in the VC




How to prove a problem is NP-Complete? - correct answer-1.
Prove the problem is in NP
-Given problem and solution, Verify solution in Polynomial
Time.
2. Prove problem is as hard as any NP-Complete problem. (K
nown → New)
-Show reduction from known NP-Complete problem to this
problem.
-Use a problem similar to this one.
-Prove forward and backward implication.




What is Euler Path Problem? - correct answer-Find a PATH that
contains each EDGE exactly once.
-Can be solved in Polynomial Time




What is Rudrata Cycle problem? - correct answer-Find a
CYCLE that visits each VERTEX exactly once.
-No Known Polynomial Time algorithm