question archive Circle true or false a) true false The concepts of non-deterministic algorithms and randomized algorlthms have no difference
Subject:Computer SciencePrice:2.86 Bought3
Circle true or false a) true false The concepts of non-deterministic algorithms and randomized algorlthms have no difference. b) true false NPC problems are always NP-hard. 0) true false P = NP if SAT can be veri?ed in polynomial time. d) true false The algorithm of using skip lists discussed in class is a randomized algorithm because for the same input, the execution time is different ?om run to run. e) true false If there is an augmenting path in a residual network, then there is no cut in the current ?ow f with a capacity of |f].
a. False, Non deterministic algorithms and randomized algorithms vary in that the rationale contains a degree of randomness in randomized
algorithms, but in non deterministic algorithms
b. False ,
The set of NP problem and NP hard problem are the NP complete problem, not just the NP hard problem.
c.True,
It is known that SAT is in NP and if P=NP, then all of the NP problems can be solved in polynomial time.
d.True,
The algorithm of using skip lists discussed in the class is a randomized algorithm.
e.True,
An augmented path in a residual network that finds a positive capacity path from source to sink and adds it to the current flow so that there is no cut in the current flow with a capacity of |f|.