Question 14133 – NIC-NIELIT STA 2020
November 30, 2023Question 16138 – Cache
November 30, 2023Question 14136 – NIC-NIELIT STA 2020
Which of the following problems is not NP complete but undecidable?
Correct Answer: B
Question 61 Explanation:
NP Complete problems:
1. Partition Problem
2. Hamiltonian Circuit
3. Bin Packing
4. Travelling salesman problem.
1. Partition Problem
2. Hamiltonian Circuit
3. Bin Packing
4. Travelling salesman problem.
Partition Problem
Halting Problem
Hamiltonian Circuit
Bin Packing
Subscribe
Login
0 Comments