Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Solved Assignments
Asked Questions
Answered Questions
what is the expected value of the constant random variable x that has xs c for every member s of the sample space we
assuming that the process of answering the questions on a five-question quiz is an independent trials process and that
in an independent trials process consisting of six trials with probability p of success what is the probability that
suppose you hash n items into a hash table of size k it is natural to ask about the time it takes to find an item in
what is the expected number of empty slots when we hash 2k items into a hash table with k slots what is the expected
prove as tight upper and lower bounds as you can onfor this purpose it is useful to remember the definition of the
let a be an array of length n - 1 whose elements are chosen from some ordered set sorted into increasing order let b be
write a computer program that prints out a table of values of the expected number of collisions with n keys hashed into
when we hash n items into k locations what is the probability that all n items hash to different locations what is the
again as in the previous exercise we have c children choosing from among ample supplies of d different kinds of candy
a candy machine in a school has d different kinds of candy assume for simplicity that all these kinds of candy are
in real applications it is often the case that the hash table size is not fixed in advance since you dont know in
in a card game we remove the jacks queens kings and aces from a deck of ordinary cards and shuffle them you draw a card
given an array a of length n chosen from some set that has an underlying ordering we can select the largest element of
consider an algorithm that given a list of n numbers prints them all out then it picks a random integer between 1 and 3
i have two nickels and two quarters in my left pocket and 4 dimes in my right pocket suppose i flip a penny and take
let a1 n denote the elements in positions 1 to n of the array a a recursive description of insertion sort is that to
it is also possible to write a version of the randomized selection algorithm analogous to slower quicksort that is when
one idea that is often used in selection is that instead of choosing a random pivot element we choose three random
what is the variance and standard deviation for the number of right answers for someone taking a 100 question short
suppose someone who knows 60 of the material covered in a chapter of a textbook is taking a five question objective
estimate the probability that a person who knows 60 of the material gets a grade strictly between 50 and 70 in the test
you are a contestant in the game show lets make a deal in this game show there are three curtains behind one of the
on a true-false test the score is often computed by subtracting the number of wrong answers from the number of right
this problem derives an intuitive law of probability known as the law of large numbers from chebyshevs law informally