NP Hard AND NP Complete problems Questions

NP Hard AND NP Complete problems
1.How to write  deterministic and non-deterministic algorithms with example.
2.How to write  Non-deterministic algorithm for Searching and Sorting.
3.what is 0/1 Knapsack Decision problem ?
4.write non-deterministic algorithms with the example .

5. Short notes  on
i.Decision probleme.
ii.Optimization problem.
iii.Polynomial complexity of an algorithm .
iv.Reducibility
v. Examples of reducibility

7.Explain P,NP.NP-HARD AND NP-Complete problem and relationship
between them.
8. explain in brief
1)Cooks theorem with example.

Share This