Teaching HPSC Lecturer (Technical) Mock Test 2024 Algorithms Asymptotic Worst Case Time and Time Complexity Introduction
It is given that, A is an NP – complete problem and B and C be two other problems not known to be in NP. B is polynomial time reducible to A and A is polynomial – time reducible to C. Which one of the following statements is true?
1
C is NP – hard
2
B is NP – complete
3
B is NP – hard
4
C is NP – complete
5
Question Not Attempted