EC5: if we throw uniformly at random a point on segment [0,1], then its expected position is 1/2. What are the expected positions of two random points on segment [0,1]? Due 01/27 EC6: Two women met after not seeing each othe for ages . One asks another: How many kids do you have? 2. At least one of them is a boy? Yes. What is the probability that the other is a boy? EC # 7. In a box there are two coins: a standard coin with head and tail and a 2-headed coin. You randomly pick one of the coins, toss it and see a head. What is the probability that the other side of this coin is a bead?

EC5: if we throw uniformly at random a point on segment [0,1], then its expected position is 1/2. What are the expected positions of two random points on segment [0,1]? Due 01/27 EC6: Two women met after not seeing each othe for ages . One asks another: How many kids do you have? 2. At least one of them is a boy? Yes. What is the probability that the other is a boy? EC # 7. In a box there are two coins: a standard coin with head and tail and a 2-headed coin. You randomly pick one of the coins, toss it and see a head. What is the probability that the other side of this coin is a bead?

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

Let A be the set of all strings of decimal digits of length 5. For example 00312 and 19483 are two strings in A . You pick a string from A at random. What is the probability that the string has no 4 in it?
This problem is taken from the delightful book "Problems for Mathematicians, Young and Old" by Paul R. Halmos. Suppose that 931 tennis players want to play an elimination tournament. That means: they pair up, at random, for each round; if the number of players before the round begins is odd, one of them, chosen at random, sits out that round. The winners of each round, and the odd one who sat it out (if there was an odd one), play in the next round, till, finally, there is only one winner, the champion. What is the total number of matches to be played altogether, in all the rounds of the tournament? Your answer: Hint: This is much simpler than you think. When you see the answer you will say "of course".
Pick one million sets of 12 uniform random numbers between 0 and 1. Sum up the 12 numbers in each set. Make a histogram with these one million sums, picking some reasonable binning. You will find that the mean is (obviously?) 12 times 0.5 = 6. Perhaps more surprising, you will find that the distribution of these sums looks very much Gaussian (a "Bell Curve"). This is an example of the "Central Limit Theorem", which says that the distribution of the sum of many random variables approaches the Gaussian distribution even when the individual variables are not gaussianly distributed. mean Superimpose on the histogram an appropriately normalized Gaussian distribution of 6 and standard deviation o = 1. (Look at the solutions from the week 5 discussion session for some help, if you need it). You will find that this Gaussian works pretty well. Not for credit but for thinking: why o = 1 in this case? (An explanation will come once the solutions are posted).
There are 7 balls hidden in a box (3 blue and 4 green). If you first select a green ball and do not replace in the box, what is the probability that the second ball you select from the box will also be green? [Your answer can be written either as a fraction or decimal]
A group of people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed. After x number of passes, the person holding the hot potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins. For example: number of passes = 1 and number of players = 5, the order of elimination is 2, 4, 1, 5. Write a program for general values of X and N. Ask a user for the number of people and number of passes To speed up the input and debugging, you may wish to store the names of the people in a file. Make sure no two names start the same letter ( Alex and Ana are not OK). Alternatively, you can number the players. Output number and/or the name of a person being eliminated Output number and the name of the winner Do not expect a user to do the right thing, error check the user input; among other things, what do you think a reasonable…
A group of people, numbered 1 to N, are sitting in a circle. Starting at person 1, a hot potato is passed. After x number of passes, the person holding the hot potato is eliminated, the circle closes ranks, and the game continues with the person who was sitting after the eliminated person picking up the hot potato. The last remaining person wins. For example: number of passes = 1 and number of players = 5, the order of elimination is 2, 4, 1, 5. Write a program for general values of X and N. Ask a user for the number of people and number of passes To speed up the input and debugging, you may wish to store the names of the people in a file. Make sure no two names start the same letter ( Alex and Ana are not OK). Alternatively, you can number the players. Output number and/or the name of a person being eliminated Output number and the name of the winner Do not expect a user to do the right thing, error check the user input; among other things, what do you think a reasonable…
Q _1 Suppose we want to pick two numbers from {1,2,⋯,100} randomly. What is the probability that the sum of the two picked numbers is divisible by 5.?
Write a program that takes five students' quizzes in a course. Consider each student has given ten quizzes. Find Best student Worst student Average studen t nt
If 3 books are picked at random from a shelf containing 5 novels, 3 books of poems, and a dictionary, what is the probability that: the dictionary is selected?
A math class has 25 students. Assuming that all of the students were born in the first half of the year – between January 1st and June 30th– what is the probability that at least two students have the same birthday? Assume that nobody was born on leap day, so there are 181 possible birthdays.
Suppose for an international football tournament, you wish to find the probability of the country who can win the final game. You can find the odds for winning from your local bookie [A bookie sets odds, accepts and places bets, and pays out winnings on behalf of other people]. Odds are mathematically treated as a fraction. If the odds for the Morocco vs Argentina game are 5 to 1, the fraction is 1 / 5. So to convert the fraction into probability of winning, take the numerator and divide it by the denominator plus 1. Use the Frac.class in Java to help you convert any given odds into probability. Display your result as a percentage on you console.
Alex is playing Poker card game. He starts with a deck of N cards, where for each valid (i), the ith card has an integer A¡ written on it. Now the dealer starts dealing the cards one by one in the order from card 1 to card N. Alex wins if at some moment in time, the sum of all the cards dealt so far is between X and Y inclusive; if this never happens, Alex loses. You are now helping Alex to win the game, so without him noticing, you will swap some pairs of cards before the game starts. Develop a python script to find the smallest number of swaps we need so that Alex would win the game, or find that it is impossible to make Alex win. Display a single line containing one integer i.e., the smallest required number of swaps or -1 if Alex cannot win. Input: 5 15 22 10 15 22 4 19 Output: 1