- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- A non-deterministic algorithm is said to...

Q. |
## A non-deterministic algorithm is said to be non-deterministic polynomial if the time- efficiency of its verification stage is polynomial. |

A. | true |

B. | false |

Answer» A. true | |

Explanation: one of the properties of np class problems states that a non-deterministic algorithm is said to be non-deterministic polynomial if the time-efficiency of its verification stage is polynomial. |

View all MCQs in:
Design and Analysis of Algorithms

- The worst-case efficiency of solving a problem in polynomial time is?
- Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
- The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
- Problems that can be solved in polynomial time are known as?
- Which algorithm is the most efficient numerical algorithm to obtain lcm?
- The naive pattern searching algorithm is an in place algorithm.
- Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.
- Prim’s algorithm resembles Dijkstra’s algorithm.
- Kruskal’s algorithm is best suited for the sparse graphs than the prim’s algorithm.

Login to Continue

It will take less than 2 minutes

Report MCQ