exercise:0a296dc30d: Difference between revisions
From Stochiki
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
There are 10 applicants for the director of computing. The applicants are interviewed independently by each member of the three-person search committee and ranked from 1 to 10. A candidate will be hired if he or she is ranked first by at least two of the three interviewers. Find the probability that a candidate | There are 10 applicants for the director of computing. The applicants are interviewed independently by each member of the three-person search committee and ranked from 1 to 10. A candidate will be hired if he or she is ranked first by at least two of the three interviewers. Find the probability that the search will be conclusive (a candidate is chosen) if the members of the committee really have no ability at all to judge the candidates and just rank the candidates randomly. | ||
<ul | <ul class="mw-excansopts"> | ||
<li>0.18</li> | <li>0.18</li> | ||
<li>0.22</li> | <li>0.22</li> | ||
Latest revision as of 15:26, 15 February 2025
There are 10 applicants for the director of computing. The applicants are interviewed independently by each member of the three-person search committee and ranked from 1 to 10. A candidate will be hired if he or she is ranked first by at least two of the three interviewers. Find the probability that the search will be conclusive (a candidate is chosen) if the members of the committee really have no ability at all to judge the candidates and just rank the candidates randomly.
- 0.18
- 0.22
- 0.25
- 0.28
- 0.3
References
Doyle, Peter G. (2006). "Grinstead and Snell's Introduction to Probability" (PDF). Retrieved June 6, 2024.