- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- How many stages of procedure does a non-...

Q. |
## How many stages of procedure does a non- deterministic algorithm consist of? |

A. | 1 |

B. | 2 |

C. | 3 |

D. | 4 |

Answer» B. 2 | |

Explanation: a non-deterministic algorithm is a two-stage procedure- guessing stage and verification stage. |

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?
- What procedure is being followed in Floyd Warshall Algorithm?
- How many sub arrays does the quick sort algorithm divide the entire array into?
- Which algorithm is the most efficient numerical algorithm to obtain lcm?
- Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?
- The naive pattern searching algorithm is an in place algorithm.
- Rabin Karp algorithm and naive pattern searching algorithm have the same worst case time complexity.
- Kruskal’s algorithm is best suited for the dense graphs than the prim’s algorithm.
- Prim’s algorithm resembles Dijkstra’s algorithm.

Login to Continue

It will take less than 2 minutes

Report MCQ