P and NP Problems

The set of problems that can be solved in polynomial time is ------------------------

• P Problems

• NP-Complete Problems

• NP Problems

• NP Hard Problems

The set of decision problems that can be verified in polynomial time but necessarily solvable in polynomial time is ------------ Problems

• P

• NP

• NP-Hard

• NP-Complete

------------------------ problems have exponential time solutions

• P

• NP

• NP-Complete

• NP-Hard

Graph Coloring Problem is an example of ------------------- problem

• P

• NP

• NP-Complete

• NP-Hard

Traveling Sales Man Problem is the best example of NP-Hard problem

• True

• False

Which is the hardest Problem ?

• P

• NP

• NP Complete

• NP Hard

Which is the least Hardest Problem?

• P

• NP

• NP-Complete

• NP Hard

Binary and Linear Search is the example of ----------- Problem

• P

• NP

• NP Complete

• NP Hard

Integer Factorization is an example of --------- Problem

• P

• NP

• NP-Complete

• NP-Hard

Which is quicker to verify and slow to solve ?

• P Problem

• NP Problem

• NP-Complete Problem

• NP -Hard Problem