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?

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter21: Simulation

Section21.4: An Example Of Monte Carlo Simulation

Problem 3P

See similar textbooks

Similar questions

Subject: Machine Learning Question Number 5 : What are Ensemble Algorithms? Write an algorithm for BOOSTING method. Assume that two individuals offer to sell you their predictive models M1 and M2. The confusion matrices produced by each model are as follows. What is the accuracy of each model? Assuming that precision is of paramount importance in your application, which of the two models would you buy? Why?
solve with matlab.suppose that two fair dice are tossed repeatedly and the sum of the two uppermost faces is determined on each toss. what is the probability that we obtain a sum of 3 before we obtain a sum of 7? Please just write matlab code that solves this problem using simulation
please try to simulate the probability of rolling a Die with Sample Space* S={1,2,3,4,5,6} and the probability of each sample point has a 1/6 chance of occurring, i.e., you need to verify that your simulation converges to 1/6 when you select one point of sample space. When X is a random variable for sample point of rolling a Die, Pr(X<=4)=2/3. Please verify this result by simulation. Please let me know how to make an Excel file as stated above.
In this assignment, you will need to write an agent that uses logical inference to find the answers to the givenquestions based on the data given in the below table:1. Python Code Filename: ID.py ID Name GPA Program City 123 Ahmed 3.56 BS-CS Gujranwala 456 Zahid 2.85 BS-SE Lahore 789 Baber 3.70 BS-DS Gujranwala 321 Shahid 2.99 BS-CS Gujranwala 654 Jamal 3.33 BS-DS Lahore Use the given code puzzle.py and amend the code so that it finds the answer to these questions:a. Who lives in Lahore?b. Who studies in the BS-DS program?c. Who has the minimum GPA and who has the maximum GPA? You are restricted to using only the kanren logical AI library and the given code for the LogicalProgramming lectures. You may use any mathematical library (if needed) for any math related work.2. Write a report (ID.pdf) that describes the logic of your solution. Make sure to describe all main steps thatyour code uses to find the answers of the given questions. puzzle.py; from kanren import…
Write a program that calculates (using a Monte Carlo simulation) what the probability is that two bishops, randomly placed on an 8 by 8 chessboard, are in an attacking position? On a chessboard, bishops can move in a diagonal line. So two bishops are in attacking position if they both sit on the same diagonal line. On the 8x8 chessboard below, B1 and B2 are in attacking position. B3 is NOT in attacking position of either B1 or B2. B4 and B1 are also in attacking position to each other. But B4 is not in attacking position to B2, or B3.
Implement an algorithmic solution, indicating which states are valid and which are not, and model the space of the following problem: An interest group from a small town decided to sue a company for commercial abuse. For this, the people have organized themselves and decided to send 3 representatives, who will have to travel in a Van to the city where the lawsuit will be filed. The company to be sued, upon learning of these actions, has decided to send 3 lawyers to persuade the representatives, who will also travel in the same Van for that purpose. The community must file the class action suit under these conditions: - The three applicants must reach the destination city; - Only two people can travel per trip in the Van (small town - city, city - small town); - There can never be more lawyers than plaintiffs in any one place (either in the small town or city) because the lawyers can persuade the plaintiffs and as a consequence, the lawsuit would not be made; - The Van cannot be…
Using R, Use the Monte Carlo simulation to estimate the probability that all six faces appear exactly once in six tosses of fair dice.
Assume we have a game that uses synchronized simulation. If we want to extendthe game by including new players, which will become the limiting factor first: thenumber of human players or the number of synthetic players?
Assume a very good NBA team has a 70% chance of winning in each game it plays. Use simulation to answer these questions, where each iteration of the simulation generates the outcomes of all 82 games. Use simulation with 10,000 iterations to answer the questions. For part a, write your numerical answer with no decimal or commas (e.g., if your computed answer is 101,021.128, write your answer as 101021). For part b, write your probability answer to two decimal places with a leading 0 (e.g., write a probability of 90.02% as 0.90). a. During an 82-game season what is the average length of the team's longest winning streak? The average length of the winning streak is . b. What is the probability that the team has a winning streak of at least 16 games? The probability is
Fill in the bubbles for ALL correct choices: there may be more than one correct choice, but there is always at least one correct choice. Which of the following are true for the k-nearest neighbor (k-NN) algorithm? A: k-NN can be used for both classification and regression. B: As k increases, the bias usually increases. C: The decision boundary looks smoother with smaller values of k. D: As k increases, the variance usually increases.
Simulated annealing is an extension of hill climbing, which uses randomness to avoid getting stuck in local maxima and plateaux. a) For what types of problems will hill climbing work better than simulated annealing? In other words, when is the random part of simulated annealing not necessary? b) For what types of problems will randomly guessing the state work just as well as simulated annealing? In other words, when is the hill-climbing part of simulated annealing not necessary? c) Reasoning from your answers to parts (a) and (b) above, for what types of problems is simulated annealing a useful technique? In other terms, what assumptions about the shape of the value function are implicit in the design of simulated annealing? d) As defined in your textbook, simulated annealing returns the current state when the end of the annealing schedule is reached and if the annealing schedule is slow enough. Given that we know the value (measure of goodness) of each state we visit,…
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…