For The Given Algorithm Find The Probability Of Finding After K #825
For the given algorithm, find the probability of finding after k iterations: <pre><code class="language-txt"> find_a(array A, n, k) begin i=0 repeat Randomly select one element out of n elements i=i+1 until i=k or a is found end</code></pre>
This multiple choice question (MCQ) is related to the book/course gs gs101 Automata Theory. It can also be found in gs gs101 Other Classes Of Problems - Randomized Algorithm - Quiz No.1.
For the given algorithm, find the probability of finding after k iterations:
find_a(array A, n, k) begin i=0 repeat Randomly select one element out of n elements i=i+1 until i=k or a is found end
(1/2)k
(1-(1/3))k
1-(1/2)k
None of the mentioned
Similar question(s) are as followings:
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101 Automata Theory
Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101 Automata Theory
Online Quizzes