CS6515 Exam 3 Actual Set Questions & Revised Correct Answers PASSED!!
CS6515 Exam 3 Actual Set Questions & Revised Correct Answers PASSED!! What is a P problem? - ANSWER : 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? - ANSWER : NP = NonDeterministically Polynomial -A problem where the Solution can be VERIFIED in Polynomial-Time What are differences in P and NP? - ANSWER : 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? - ANSWER : 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? - ANSWER : 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. NP-Hard problems don't have to be NP problems.
Información del documento
- Subido en
- 17 de mayo de 2024
- Número de páginas
- 5
- Escrito en
- 2023/2024
- Tipo
- Examen
- Contiene
- Preguntas y respuestas
