- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- The choice of polynomial class has led t...

Q. |
## The choice of polynomial class has led to the development of an extensive theory called |

A. | computational complexity |

B. | time complexity |

C. | problem complexity |

D. | decision complexity |

Answer» A. computational complexity | |

Explanation: an extensive theory called computational complexity seeks to classify problems according to their inherent difficulty. |

View all MCQs in:
Design and Analysis of Algorithms

- A non-deterministic algorithm is said to be non-deterministic polynomial if the time- efficiency of its verification stage is polynomial.
- is the class of decision problems that can be solved by non- deterministic polynomial algorithms?
- The worst-case efficiency of solving a problem in polynomial time is?
- Problems that can be solved in polynomial time are known as?
- To which class does the Euler’s circuit problem belong?
- To which of the following class does a CNF-satisfiability problem belong?
- Which of the following sorting algorithm has best case time complexity of O(n2)?
- Every graph has only one minimum spanning tree.
- Consider a complete graph G with 4 vertices. The graph G has spanning trees.
- Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?

Login to Continue

It will take less than 2 minutes

Report MCQ