Course Content

Other Courses

Tribhuvan university > CSIT - 2074 Syllabus > Theory of Computation > Old Questions > 2074

Theory of Computation - Old Questions

Syllabus Notes Old Questions Unit Wise Questions Question Bank

13.  Define class P and NP with example. Show that: If P1 is NP complete and there is a polynomial time reduction of p1 to P2 then P2 is NP-complete.

8 marks | Asked in 2074