Please, answer the whole question. Suppose you toss n biased coins independently. Given positive integers n and k, along with a set of non-negative real numbers p1,..., pn in [0, 1], where pi is the probability that the ith coin comes up head, your goal is to compute the probability of obtaining exactly k heads when tossing these n biased coins. Design an O(nk)-time algorithm for this task. Explain the algorithm, write down the pseudo code and do run time analysis.

Please, answer the whole question. Suppose you toss n biased coins independently. Given positive integers n and k, along with a set of non-negative real numbers p1,..., pn in [0, 1], where pi is the probability that the ith coin comes up head, your goal is to compute the probability of obtaining exactly k heads when tossing these n biased coins. Design an O(nk)-time algorithm for this task. Explain the algorithm, write down the pseudo code and do run time analysis.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter23: Simulation With The Excel Add-in @risk

Section: Chapter Questions

Problem 9RP

See similar textbooks

Similar questions

What is the difference between Transform and Conquer & Divide and Conquer? Justify your answer by providing at one example for each algorithm in solving a problem.
2. Prove from the definition that 2n2 + 100n log n + 1000 = O(n2) 3. For what values of n is 50 n lg n greater than 0.5 n2? Why do we say that 0.5 n2 is asymptotically larger, if 50 n lg n is larger for many values? (Hint: you may need to graph the functions or play around with your calculator.)
Use R to answer the following question According to the central limit theorem, the sum of n independent identically distributed random variables will start to resemble a normal distribution as n grows large. The mean of the resulting distribution will be n times the mean of the summands, and the variance n times the variance of the summands. Demonstrate this property using Monte Carlo simulation. Over 10,000 trials, take the sum of 100 uniform random variables (with min=0 and max=1). Note: the variance of the uniform distribution with min 0 and max 1 is 1/12. Include: 1. A histogram of the results of the MC simulation 2. A density plot of a normal distribution with the appropriate mean and standard deviation 3. The mean and standard deviation of the MC simulation. ps(plz do not use chatgpt)
Question 2:Typically we assume in analyzing a randomized algorithm that we haveaccess to genuinely random bits r, and don’t ask too carefully how we canget these random bits. but where does the randomness come from? There are basically threechoices:a. physical randomness b. cryptographically-secure pseudorandomnessc. statistical pseudorandomnessDefine and differentiate these sources of randomness by citing examples.
Question 15 pap Suppose we have a Monte Carlo algorithm, A, and a deterministic algorithm, B, for testing if the output of A is correct. How can we use A and B to construct a Las Vegas algorithm? Also, if A succeeds with probability ½ and both A and B run O(n) time, what is the expected running time of the Las Vegas algorithm that is produced? Full explain this question and text typing work only We should answer our question within 2 hours takes more time then we will reduce Rating Dont ignore this line
Take into account the MAXMIN methodology below. It uses how many comparisons? Is it more likely to operate quicker or slower in practise than the divide-and-conquer algorithm? procedure The remark maxmin2(S) calculates the maximum and minimum of S[1..n] in max and min, respectively. 1. if n is odd then max:=S[n]; min:=S[n] 2. else max:=−∞; min:=∞ 3. for i := 1 to n/2 do 4. if S[2i − 1] ≤ S[2i] 5. then small:=S[2i − 1]; large:=S[2i] 6. else small:=S[2i]; large:=S[2i − 1] 7. if small < min then min:=small 8. if large > max then min:=small
Assume that the probability distribution of our input is known to be uniform (continuous) over the range [0, 100]. We want to bucket-sort 10,000 real numbers using the BUCKET − SORT algorithm in CLRS, Section8.4 (i.e., with 10, 000 buckets). What is the probability that bucket 0 will remain empty? What is the probability that the rst 5 buckets will all remain empty? Express your answers to four decimal places
I need the analysis of time from the following algorithm. The best and worst time table. a = 3; while (a > n){cout << a; for (b = 3; b <= 10; b++){cout<< b; } a++; }
Small witnesses are easy to findThe definition of NP requires that the number of bits of the witness is at most polynomialin the number of bits of the input, i.e., |w| = poly(n). Suppose a decision problemA ∈ NP has the property that witnesses, when they exist, are at most logarithmic size,i.e., |w| = O(log n). Show that this implies A ∈ P.
Running Time Analysis: Give the tightest possible upper bound for the worst case running time for each of the following in terms of N. You MUST choose your answer from the following (not given in any particular order), each of which could be reused (could be the answer for more than one of a) – f)): O(N2), O(N3 log N), O(N log N), O(N), O(N2 log N), O(N5), O(2N), O(N3), O(log N), O(1), O(N4), O(NN), O(N6)
You will analyze three algorithms to solve the maximum contiguous subsequence sum problem, and then evaluate the performance of instructor-supplied implementations of those three algorithms. You will compare your theoretical results to your actual results in a written report. What is the maximum contiguous subsequence sum problem? Given a sequence of integers A1, A2, ..., An (where the integers may be positive or negative), find a subsequence Aj, ... , Ak that has the maximum value of all possible subsequences. The maximum contiguous subsequence sum is defined to be zero if all of the integers in the sequence are negative. Consider the sequence shown below. A1: -2 A2: 11 A3: -4 A4: 13 A5: -5 A6: 2 The maximum contiguous subsequence sum is 20, representing the contiguous subsequence in positions 2, 3, and 4 (i.e. 11 + (-4) + 13 = 20). The sum of the values in all other contiguous subsequences is less than or equal to 20. Consider a second sequence, shown below. A1: 1…
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies. Design a bottom-up (non-recursive) O(nk)-time algorithm that makes change for any set of k different coin denominations. Write down the pseudocode and analyze its running time. Argue why your choice of the array and the order in which you fill in the values is the correct one. Notice how it is a lot easier to analyze the running time of…