1.

Which of the following is incorrect for the given phrase
Phrase : solvable by non deterministic algorithms in polynomial time

A. NP Problems
B. During control flow, non deterministic algorithm may have more than one choice
C. If the choices that non deterministic algorithm makes are correct, the amount of time it takes is bounded by polynomial time.
D. None of the mentioned
Answer» E.


Discussion

No Comment Found