Consider the following program statement consisting of a while loop while ¬B do S Assume that the Boolean expression B takes the value true with probability p and the value false with probability q. Assume that the successive test on B are independent. 1. Find the probability that the loop will be executed k times. 2. Find the expected number of times the loop will be executed. 3. Considering the same above assumptions, suppose the loop is now changed to repeat S until B What is the expected number of times that the repeat loop will be executed?

Consider the following program statement consisting of a while loop while ¬B do S Assume that the Boolean expression B takes the value true with probability p and the value false with probability q. Assume that the successive test on B are independent. 1. Find the probability that the loop will be executed k times. 2. Find the expected number of times the loop will be executed. 3. Considering the same above assumptions, suppose the loop is now changed to repeat S until B What is the expected number of times that the repeat loop will be executed?

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section: Chapter Questions

Problem 1PP: (Probability) The probability that a phone call will last less than t minutes can be pproximated by...

See similar textbooks

Similar questions

A random walk is a random path most often represented as a random number that changes over time. In particular, one common random walk is that in which the starting state is 0 and in each iteration we either add 1 or subtract 1 from the current value with equal probability. That is, in the first step, the next value would be 1 with probability 0.5 and -1 with probability 0.5. Use R to generate a random walk with 100 values starting at value 0 and store the values in a vector called random_walk. This vector should have length 100.
The converse and the inverse of a conditional statement are equivalent Select One True False Let p, q, and r be propostions with the truth values (True, False, False) respectivly, then the truth value of the propositional statement (¬p ↔️ ¬q) ↔️ (q ↔️ r) is Select One True False The biconditional statement p ↔️ q and the statement (p → q ) ∧ (q → p) have different truth values Select One True False Determine whether the following propositions is true or false. if 1+1=3, then 2+2=4 Select One True False Determine whether the following propositions is true or false. 2+1=3 if and only if 5
A proposition Q follows from a proposition P, if Q is never false when P is true. Suppose we want to check this in a particular case. Which of the following is correct? Select one: a. We need to check that whenever P is false, Q is also false. b. We need to check that whenever Q is false, P is also false. c. We need to check that whenever Q is true, P is also true. d. We need to check that Q is true when P is true, and that Q is false when P is false.
Correct answer will be upvoted else downvoted. Computer science. You are given a double string s of length n. Develop two adjusted section successions an and b of length n to such an extent that for all 1≤i≤n: on the off chance that si=1, ai=bi on the off chance that si=0, ai≠bi In case it is inconceivable, you should report about it. Input The principal line contains a solitary integer t (1≤t≤104) — the number of experiments. The primary line of each experiment contains a solitary integer n (2≤n≤2⋅105, n is even). The following line contains a string s of length n, comprising of characters 0 and 1. The amount of n across all experiments doesn't surpass 2⋅105. Output If such two adjusted bracked arrangements exist, output "YES" on the primary line, in any case output "NO". You can print each letter regardless (upper or lower). If the appropriate response is "YES", output the fair section groupings an and b fulfilling the conditions on the following…
strict action will be taken answer only u know else skip dont post existing one
Generate a probability histogram of the number of rolls required of two dice before a sum of “7” appears (graphical answer followed by Matlab code). Note: Don’t plot experiment that took more than 60 rolls.
Show that the following hypothesis lead to the conclusion “If I do not finish writing the program, then I will wake up feeling refreshed” If you send me an e-mail message, then I will finish writing the program. If you do not send me an e-mail message, then I will go to sleep early. If I go to sleep early, then I will wake up feeling refreshed.
It is essential for developers to understand how neural networks simulate intelligent decision-making as well as learning techniques. Describe a Python program that implements a decision network: The action should be of three kinds (e.g., walk, run slowly, run fast). The Bayes net should include 3 elements with a chain of conditional probabilities. Instantiate the appropriate variables and probabilities. Show the MEU equation. Calculate the MEU and interpret.
Consider the functionf :: Int -> Intf n = if n==0then 0else 1 + (f(n-1))Use induction to show that the function f returns the value of n for all possible inputs n ≥0.Here are the steps:1. Verify that f 0 returns 0 to show the base case.2. Show that if f(n-1) returns n −1 then f n returns n.3. Since you have shown the base case and the induction step, you can confidentlystate that the function works for all possible nonnegative input values.Hint: To show that ”if f(n-1) returns n −1 then f n returns n” is valid you need toassume that f(n-1) returns n −1 and then argue that it must follow that f n returnsn. Use the definition of the function and just a little bit of algebra.Criteria for Success: You have clearly written down all three steps of the inductive proof. Your proof contains complete sentences which explain all the steps andthe algebra. I don’t want to see just a bunch of symbols on a page!
Algorithm to An iterative solution to Towers of Hanoi.in: triplet S = s0, s1, s2 representing the current game stateout: triplet R = r0, r1, r2 representing the new game statelocal: pole indices a, b, z ∈ {0, 1, 2}; disc numbers g, h ∈ [2, n]; last(Q) = Q|Q|−1, if1 ≤ |Q|, otherwise, last(Q) = +∞
What Python code will solve the following: The goal of this section is to estimate the probabilities Pij (transition probabilities) associated with finding food from any location (i, j) inside the maze. A rat will be considered successful in finding food if the probability of finding food from a given location exceeds 0.5. 1. Use Equation (1) to write down equations for each probability Pij for i = 1, 2, · · · , 6, j = 1, 2, 3, · · · , 5. Equation 1 is : Pij = 1/4Pi-1j + 1/4 Pi+1j +1/4 Pij-1 + 1/4Pij+1 2. Notice that your equations constitutes a system of linear equations with 30 equations and 30 unknowns, with the unknowns as the transition probabilities. Identify the coefficient matrix for the system of equations and write your system in the form Ap = b, where b is some constant vector and p the vector of transition probabilities, ordered from the upper left hand corner of the maze to the lower right hand corner. The goal is to solve the system for p. 2 3. How would you characterize…
Please do in python. Correct answer will upvoted else downvoted It is given a positive integer n. In 1 maneuver, one can choose any single digit and eliminate it (for example one chooses some situation in the number and eliminates the digit situated at this position). The activity can't be performed if by some stroke of good luck one digit remains. In the event that the subsequent number contains driving zeroes, they are naturally taken out. For example on the off chance that one eliminates from the number 32925 the 3-rd digit, the subsequent number will be 3225. On the off chance that one eliminates from the number 20099050 the primary digit, the subsequent number will be 99050 (the 2 zeroes going close to the main digit are naturally taken out). What is the base number of steps to get a number with the end goal that it is distinct by 25 and positive? It is ensured that, for every n happening in the input, the appropriate response exists. It is ensured that the number n has no…