This preview shows pages 1–8. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: n +2 comparisons are performed to determine this. What is the averagecase computational complexity of this algorithm if the probability that x is in the list is p and it is equally likely that x is any of the n elements of the list? 8 Among 20 boxes 4 contain a prize. Jakub is randomly picking a box (one at the time and without returning it) until he finds a prize or has picked three boxes. What is the probability that Jakub finds a prize before picking third box? What is the probability that Jakub finds a prize in the first box if we know that if he would pick two boxes, he would find a prize?...
View
Full
Document
This note was uploaded on 04/11/2011 for the course MACM 201 taught by Professor Marnimishna during the Spring '09 term at Simon Fraser.
 Spring '09
 MarniMishna

Click to edit the document details