TASK 1. Estimate the following probabilities by simulation (we don't want to see any analytical approaches!) In your report explain your code and show your answers. a. You have all the black cards from a normal deck, I have all the red cards. We cach choose one card from our half decks - the highest card wins. But I have managed to sneak out and throw away your 9 Of Clubs! Simulate 1000 games - how many did I win? (Ace is low.) b. There are 87 people on a bus - what is the likelihood that two of them share a birthday? c. How many people would you need to gather together before there is a 90% chance that one of them was born on the Ist Jan?

TASK 1. Estimate the following probabilities by simulation (we don't want to see any analytical approaches!) In your report explain your code and show your answers. a. You have all the black cards from a normal deck, I have all the red cards. We cach choose one card from our half decks - the highest card wins. But I have managed to sneak out and throw away your 9 Of Clubs! Simulate 1000 games - how many did I win? (Ace is low.) b. There are 87 people on a bus - what is the likelihood that two of them share a birthday? c. How many people would you need to gather together before there is a 90% chance that one of them was born on the Ist Jan?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

TYPEWRITTEN ONLY PLEASE UPVOTE. DOWNVOTE FOR HANDWRITTEN. DO NOT ANSWER IF YOU ALREADY ANSWERED THIS. THE BIG NUMBER IN THE SIDE IS FOR NUMBERING.
Question: You are asked to learn the concept of "Malaysian Economy Car" from the following data: CAR Origin Manufacturer Colour Decade Туре IsMalaysianEconomyCar Malaysia Proton Silver 1990 Economy Yes Malaysia Perodua Blue 2000 Sports No Malaysia Perodua Silver 2010 Economy Yes Japan Toyota Red 1990 Economy No Malaysia Proton White 2000 Economy Yes Implement the Candidate-Elimination algorithm on the CAR decision system above. Show the tracing steps on each training example to obtain the final result. Answer: Training Tracing Steps Examples The final hypotheses is:
Does anyone know the coding process for this problem? Any help is appreciated.
Can you please help me fimd Tn?
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,…
solve this
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 =…
● Simulate the game (this will require using while and if statements as we learned in class) by using the round and trial counters you have established. ● Store a win for Player 1 or Player 2 after each round (indicate a win by a 1 and a loss by a 0). ● Store the cumulative wins of each player after each round (“P1Wins_Talley” and “P2Wins_Talley”). ● Store the overall game results in a matrix called “store_results”. Column 1 lists the round number , Column 2 lists the total number of trials in that round , Column 3 records which player won that round (1 or 2) , Column 4 records the value of Dice 1 , Column 5 records the value of Dice 2 , Column 6 records the sum of the two dice at the end of that round (which should equal the value in Column 1) I am creating a game where two players try to roll two die that equal the current round. For example, if the round is 3, the players must roll a 2 and a 1. I have written this code so far, but I am not getting the end result I need. I was hoping…
There are 22 gloves in a drawer: 5 pairs of red gloves, 4 pairs of yellow, and 2 pairs of green. You select the gloves in the dark and can check them only after a selection has been made. What is the smallest number of gloves you need to select to have at least one matching pair in the best case? in the worst case?
X-Kingdom has trapped n number of soldiers of their opponent. They want to execute them. They created a strategy so that the prisoners will kill each other and at the end one prisoner will be alive and eventually released. As part of the process, they assigned each trapped soldier a sequence number starting from 1 and ending at n. If n = 5 and k = 2, then the safe position is 3. Firstly, the person at position 2 is killed, then person at position 4 is killed, then person at position 1 is killed. Finally, the person at position 5 is killed. So, the person at position 3 survives. If n = 7 and k = 3, then the safe position is 4. The people at positions 3, 6, 2, 7, 5, 1 are killed in order, and the person at position 4 survives. Input:n and k Output:Print the list of prisoners in reverse order from n to 1Then reverse the list to print it in correct order from 1 to nDisplay the position number who will survive. You must have to use circular doubly linked list for your solution.
Simulate the game by using the round and trial counters you have established. ● Store a win for Player 1 or Player 2 after each round (indicate a win by a 1 and a loss by a 0). ● Store the cumulative wins of each player after each round (“P1Wins_Talley” and “P2Wins_Talley”). I am trying to simulate a dice rolling game where players compete to roll two six-sided die and try to get the value based on the round number. For eample if it is round 2, the players are trying to roll snake eyes. I have submitted a file of what I have so far. Not sure if I should begin the simulation with a loop or while and if statments. How should I approach the simulation? Thank you.
program