Travelling Salesperson Problem is an example of-

Travelling Salesperson Problem is an example of-

a) Polynomial time Problem
b) NP Complete
c) NP
d) NP-Hard

From the BPSC Sub-Assistant Maintenance Engineer October 2022 – Written exam, question 15 of 103.

More from this paper

Previous: An organization is granted a block; one address is 2.2.2.64/20. The organization needs 10 subnets. What is the subnet prefix length?
Next: Which of the following is a private IP address?
All questions in BPSC Sub-Assistant Maintenance Engineer October 2022 – Written