You are on the west bank of a river with a bag of corn, a goose, and a fox. There is a boat on this shore. You want to move all three of these to the other side of the river, but you can only bring one of these things at a time in the boat. If the goose is left alone with the corn, the corn will be eaten. If the fox is left alone with the goose, the goose will be eaten. Prepare a scenario for safely bringing these three items across the river by placing the following steps in the correct order. Note: to disambiguate the answer, bring the fox across the river before bringing the corn

Three missionaries and three cannibals are standing at one side of a river and need to be transferred to the other side. There is only one boat available where maximum of two persons can occupy the boat at a time. At any point of time, the number of cannibals should not outnumber the number of missionaries at that side.   Draw the state space considering all the possible actions that can be perform at each state. For simplicity, stop after showing 4 levels. I need the tree !

There are 4 balls in a jar (2 black and 2 white). You randomly choose three balls (one by one with no replacement) and paint them according to one of the following methods (a-c) and replace them in the jar. You ask your friend to pick a ball. What is the probability that this ball is white? a. You paint them all black. b. You paint them all the same color as the first ball that is picked c. You look at the majority color (among the 3 selected ones) and paint them all that color. Write a MATLAB code to simulate each of the above 3 cases in MATLAB for 10,000 times and estimate the probability of getting a white ball in each of those cases

Let's revisit our first problem, where we want to set up a series of chess matches so we can rank six players in our class. As we did before, we will assume that everyone keeps their chess rating a private secret; however, when two players have a chess match, the person with the higher rating wins 100% of the time. But this time, we are only interested in identifying the BEST of these six players and the WORST of these six players. (We don't care about the relative ordering or ranking of the middle four players.) Your goal is to devise a comparison-based algorithm that is guaranteed to identify the player with the highest rating and the player with the lowest rating. Because you are very strong at Algorithm Design, you know how to do this in the most efficient way. Here are five statements. A. There exists an algorithm to solve this problem using 6 matches, but there does not exist an algorithm using only 5 matches. B. There exists an algorithm to solve this problem using 7 matches,…

Consider the experiment where a penny is flipped, a quarter is flipped, and a 6-sided die is rolled. Let d be the number of possible outcomes of this experiment. What is the value of d? (Give your answer as a single integer with no words.) Let E be the event that both the penny and the quarter come up Tails, and the die comes up an odd number. If p(E) = , where d is your answer above, what is the value of x? Enter your answer as a single integer with no words:

Four individuals wish to traverse an unstable bridge; they all start on the same side. You have 17 minutes to get everyone to the opposite side. Night has fallen, and they have only one torch. Two individuals may cross the bridge at once at most. Any crossing party, whether one or two individuals, must carry a torch. The torch must be carried back and forth; it cannot, for instance, be hurled. Person 1 crosses the bridge in one minute, person 2 in two minutes, person 3 in five minutes, and person 4 in ten minutes. A dyad must trek together at the slower individual's cadence. Create the algorithm specification that solves the problem.

Q1. Let’s play a dice game with a pair of dice following these rules:1. At the beginning, you throw a pair of dice. If the two numbers add up to 5, 6, 7, 8, or 9, thegame immediately stops.2. If your first throw does not meet those 5 totals, you would continue until you get either 11 or12.Get 1000 simulations of this paired dice game. What is the average number of dice throw per game?You can use the sample() function to simulate the dice.

Different kinds of plants live on a planet. If the nutrient of a plant runs out (its nutrient level becomes zero), the plant wastes away. There are three kinds of radiation on the planet: alpha, delta, no radiation. The different species of plants react to radiation differently. The reaction involves a change in the nutrient level of the plant and the radiation the next day. The radiation of the next day will be alpha radiation if the sum of the demand for alpha radiation over all plants is greater than the sum of the demand for delta radiation by at least three. If the demand for delta radiation is greater by at least three than the demand for alpha radiation, the radiation will be delta. If the difference is less than three, there will be no radiation. There is no radiation the first day. Each plant has a name (string), a nutrient level (int), and a boolean that denotes whether it's alive. The plant species are wombleroot, wittentoot and woreroot. The different plant species react to…

In the game of 10-pin bowling the bowler has two attempts to knock down pins for every frame of 10-pins, and scores a point for each pin knocked down. If all the pins are knocked down with two attempts, the bowler gets a bonus - whatever score they obtain with their next bowl is doubled. If all the pins are knocked down on the 1st attempt, no 2nd attempt is allowed, and the bowler gets a bonus – whatever score they obtain on their next two bowls are doubled. A student attempts to capture this scoring system in VHDL code, a fragment of which is shown in Figure Q4. Q4 (a) Draw the state transition diagram described by the VHDL of Figure Q4. Discuss whether the VHDL of Figure Q4 correctly scores a game of 10-pin bowling. (b) elsif CLK='1' and CLK'event and UPD='1' then case present state is when throwl => frame := frame + 1; + resize (unsigned (N), 9) score := score if N = w1010" then present state score := score + resize (unsigned (N), 9) present state + resize (unsigned (N),9) if N =…

Sabrina is on a game show and is presented with a drawer containing 10 red socks, 10 blue socks, 10 green socks, and 10 yellow socks. Sabrina is to take socks out of the drawer and put them in a bag. She will win $1 for every sock she puts in the bag, as long as the bag does not contain 5 or more socks of one color and 5 or more socks of another color. For example, if she takes 5 red, 4 blue, 3 green, and 2 yellow socks, she would win $14. However, if she took 5 red, 5 blue, 3 green, and 2 yellow socks, she would not win anything because there are two colors (red and blue) that have 5 or more socks each. What is the most money that Sabrina can win? Enter your answer as a single integer only (no words, no dollar signs). A/ What is the minimum number n such that if n socks are removed from the drawer and put into a bag, that the bag will necessarily contain at least 5 socks of one color and at least 5 socks of another color? Enter n as a single integer, no words.