Suppose you have two boxes A and B. Box A contains 7 black marbles, 4 white marbles. Box B contains 7 white and 4 black marbles. A random experiment is performed in two sequential trials by first drawing a marble randomly from box A and putting into Box B. In the second trial after the first trial, a marble is drawn randomly from box B. If we reverse the scenario, then what is the probability of drawing a black marble from box A given that a white marble is drawn from box B.

Suppose you have two boxes A and B. Box A contains 7 black marbles, 4 white marbles. Box B contains 7 white and 4 black marbles. A random experiment is performed in two sequential trials by first drawing a marble randomly from box A and putting into Box B. In the second trial after the first trial, a marble is drawn randomly from box B. If we reverse the scenario, then what is the probability of drawing a black marble from box A given that a white marble is drawn from box B.

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter17: Markov Chains

Section17.6: Absorbing Chains

Problem 7P

See similar textbooks

Similar questions

EXERCISE - You go to a market to pick out some gourds to decorate your house for Halloween. The market has a special October deal where you get 3 randomly chosen gourdss for $10. Each gourd can either be an orange pumpkin, a green pumpkin or a squash. The probabilities for picking each one of them are: P(orange pumpkin) = 0.6, P(green pumpkin) = 0.3, and P(squash) = 0.1. A: What is the probability that the first gourd is an orange pumpkin, the second is a green pumpkin, and the third is a squash? B: What is the probability that you get all 3 as orange pumpkins? C: What is the probability that you get no squashes? D: What is the probability that you get at least one orange pumpkin? (ANSWERE USING PYTHON)
So I have the following roshambo strategy function to return a random play, and tests for when one of the length of plays is less than 3 and otherwise. I have tried running it many times on a single scenario to estimate the probability for each return but the results are somehow confusing. Question: Write a series for the roshambo function below to test that it works as expected. (this could be testthat::expect_equal or testthat::expect_true or testthat::expect_error tests). Thank you. roshambo <- function(plays){ # return random play if (length(plays) < 3){ return(sample(c("R", "P", "S"), 1)) } # else find most common most_common <- names(which.max(table(plays))) if (most_common == "S"){ return("R") } else if (most_common == "R"){ return("P") } else { return("S") }}
The null and alternative hypotheses for a hypothesis test of the difference in two population proportions are: Null Hypothesis: Alternative Hypothesis: Notice that the alternative hypothesis is a one-tailed test. Suppose proportions_ztest method from statsmodels is used to perform the test and the output is (1.13, 0.263). What is the P-value for this hypothesis test? Select one. A 0.1315 B 0.263 C 1.13 D -1.13
There are N people numbered from 1 to N around a round table. Everyone has a different number in their hands between 1 and N. We start with the first person and count the number in his hand and ask the related person to leave the table. If the number in the card odd, we count clockwise. if it is even, we count counterclockwise. Ensure that all people leave the table. The first person to leave the table is the first person. In the sample scenario, the first integer value in the table_in.txt file indicates the number of people around the table, it is 5. The value of the card in the first person’s hand is written on the next line, it is 3. The value of the second person’s card is written on the next line, it is 1. In the table_out.txt file, print the order of people leaving the table. Sample scenario: table_in.txt 5 3 1 2 2 1 table_out.txt 1 4 2 3 5 Constraints N < 1,000,000 Do the solution in C/C++ with the Doubly Circular Linked List. Your codes should also be able to…
A set of 30 event tickets are placed in a bag. There are 6 baseball tickets, 4 hockey tickets, 4 basketball tickets, 2 football tickets, 3 symphony tickets, 2 opera tickets, 4 ballet tickets, and 5 theater tickets. One ticket is selected without looking. Find each probability. (Show your work) a)P(not a basketball tickets ) b)P(opera or ballet) c) P(not a symphony or not sport ) d)P( not Baseball and not Sport )
Consider the following scenario:A high school has 1000 students and 1000 lockers, one locker for each student. On the first day of school, the principal plays the following game: She asks the first student to open all the lockers. She then asks the second student to close all the even-numbered lockers. The third student is asked to check every third locker. If it is open, the student closes it; if it is closed, thestudent opens it. The fourth student is asked to check every fourth locker. If it is open, the student closes it; if it is closed, the student opens it. The remaining students continue this game. In general, the nth student checks every nth locker. If it is open, the student closes it; if it is closed, the student opens it. After all the students have taken turns, some of the lockers are open and some are closed. The program see in the photo, when ran, should ask the user to enter the number of lockers in the school. The program will output the number of lockers and the…
A hallway has 100 locked lockers. A guy begins by opening each of the 100 lockers.He then shuts every other locker. Then, on his third pass, he toggles every third locker (closes if open, opens if closed). This method is repeated for 100 passes, such that the man toggles every ith locker on each pass i. How many lockers are open after his 100th journey along the corridor, in which he toggles just locker #100?
Suppose a person can buy a chocolate bar from the vending machine for $1 each. Inside every chocolate bar is a coupon. A person can redeem 3 coupons for one chocolate bar from the machine. This means that once a person has started buying chocolate bars from the machine, he/she always has some coupons. A person would like to know how many chocolate bars can be bought, if a person starts with N dollars and always redeem coupons, if he/she has enough for an additional chocolate bar. For example: With 3 dollars a person could buy 4 chocolate bars after purchasing 3 bars giving him/her 3 coupons and then redeeming the 3 coupons for one bar. This would leave him/her with one extra coupon. Thus, will have 4 chocolate bars and still have one coupon leftover. For 11 dollars, a person can have 16 chocolate bars and still have one coupon leftover. For 12 dollars, a person can have 17 chocolate bars and have two coupons leftover. Write a complete Python program that prompts a buyer to input…
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.
Let's consider a long, quiet country road with houses scattered very sparsely along it. (Picture the road as a long line segment with an eastern endpoint and a western endpoint.) Further let’s suppose that despite the bucolic setting, the residents of all these houses are avid cell phone users. You want to place cell phone base stations at certain points along the road, so that every house is within four miles of one of the base stations. Give an efficient algorithm that achieves this goal using as few base stations as possible. Prove its correctness and explain its time complexity.
Three coins are tossed at the same time, each equally likely to come up heads or tails. What is the probability of getting 1 head and 2 tails?
Mastermind is a code-breaking game for two players. In the original real-world game, one player A selects 4 pegs out of 6 colors and puts them in a certain fixed order; multiples of colors are possible (for example, red-green red-green). His opponent B does not know the colors or order but has to find out the secret code. To do so, B makes a series of guesses, each evaluated by the first player. A guess consists of an ordered set of colors which B believes is the code. The first player A evaluates the guess and feeds back to B how many positions and colors are correct. A position is correct ("black") if the guess and the secret code have the same color. Additional colors are correct ("white"), if they are in the guess and the code, but not at the same location. For example1 2 3 4secret: red-green red greenguess: red blue green purpleresults in one correct position ("black = 1") for the red peg at position one and one additional correct color ("white=1") for the green peg in the guess.…