(a) Define NP-Hard and NP-Complete Problems. (b) What are the steps used to show a given problem is NP-Complete ? (c) State and explain Cook's theorem.

(a) Define NP-Hard and NP-Complete Problems. (b) What are the steps u…

Previous year question with solution for Analysis & Design of Algorithms.