11. An algorithm whose worst-case time complexity is bounded above by a polynomial function of its input size is called a(n) 11. An algorithm whose worst-case time complexity is bounded above by a polynomial function of its input size is called a(n) 12. The set P is the set of all decision problems that cannot be solved by polynomial – time algorithms. (True or False) 13. Computing the nth Fibonacci number is in P. (True or False) 14. A(n) that is not guaranteed to give optimal solutions, but rather yields solutions that are reasonably close to optimal. for an NP-hard optimization problem is an algorithm 15. Write the time complexity of a verification algorithm for the Graph Coloring problem in terms of the number of nodes (n). Answer: 16. Write the time complexity of a verification algorithm for the Hamiltonian Circuits problem in terms of the number of nodes (n) Answer:



Source link

Leave a Reply

Your email address will not be published. Required fields are marked *