Pagini recente » Diferente pentru onis-2016/finala intre reviziile 2 si 1 | Diferente pentru problema/trans intre reviziile 3 si 4 | Atasamentele paginii Munte2 | fractii2 | Diferente pentru blog/probability-shortlist intre reviziile 15 si 14
Nu exista diferente intre titluri.
Diferente intre continut:
# (von Neumann’s biased coin) You’re given a biased coin. It falls heads with an unknown probability p and tails with the probability 1 - p. Can you come up with a way to generate fair 0 and 1 results?
# A rand5() function gives uniform integer results between 1 and 5. How can you use it to build a rand7() function?
# Build a function rand(x, y, r) that returns a uniformly random point in the circle given by the (x,y) center and the r radius.
# What’s the expected number of times line 4 is executed if p is a uniform random permutation of numbers 1 to n.
#_ What’s the expected number of times line 4 is executed if p is a uniform random permutation of numbers 1 to n.
==code(python) |
min = p[0]
==
# Build an algorithm that returns a uniform random permutation of numbers 1 to n.
#_ Build an algorithm that returns a uniform random permutation of numbers 1 to n.
# Given a stream of integers build an algorithm that returns a uniform random sample of size k using O(k) memory.
# (Coupon collector’s problem) Suppose a kid wants to collect all the cartoon characters in a kinder surprise series. Given that there are n different characters in total and they are distributed uniformly random
# (Balls and bins problem) m balls are thrown into n bins. Each ball has 1/n probability of falling into each bin. What’s the expected number of empty bins?
Nu exista diferente intre securitate.
Topicul de forum nu a fost schimbat.