Teaching HPSC Lecturer (Technical) Mock Test 2024 Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
For problems A and B , B is NP complete problem, and A is reducible to B in polynomial time. Which of the following is true?
1
A is NP – hard
2
A in NP complete
3
A is in NP, but not necessarily in NP complete.
4
If A can be solved in polynomial time, then so can B.
5
Question Not Attempted