标题: Reading 8: Probability Concepts - LOS n, (Part 2) ~ Q1-3 [打印本页]
作者: mayanfang1 时间: 2009-1-9 09:58 标题: [2009] Session 2 - Reading 8: Probability Concepts - LOS n, (Part 2) ~ Q1-3
Q1. A supervisor is evaluating ten subordinates for their annual performance reviews. According to a new corporate policy, for every ten employees, two must be evaluated as “exceeds expectations,” seven as “meets expectations,” and one as “does not meet expectations.” How many different ways is it possible for the supervisor to assign these ratings?
A) 10,080.
B) 5,040.
C) 360.
Q2. A firm wants to select a team of five from a group of ten employees. How many ways can the firm compose the team of five?
A) 120.
B) 252.
C) 25.
Q3. A portfolio manager wants to eliminate four stocks from a portfolio that consists of six stocks. How many ways can the four stocks be sold when the order of the sales is important?
A) 180.
B) 24.
C) 360.
作者: mayanfang1 时间: 2009-1-9 09:58
答案和详解如下:
Q1. A supervisor is evaluating ten subordinates for their annual performance reviews. According to a new corporate policy, for every ten employees, two must be evaluated as “exceeds expectations,” seven as “meets expectations,” and one as “does not meet expectations.” How many different ways is it possible for the supervisor to assign these ratings?
A) 10,080.
B) 5,040.
C) 360.
Correct answer is C)
The number of different ways to assign these labels is:
Q2. A firm wants to select a team of five from a group of ten employees. How many ways can the firm compose the team of five?
A) 120.
B) 252.
C) 25.
Correct answer is B)
This is a labeling problem where there are only two labels: chosen and not chosen. Thus, the combination formula applies: 10! / (5! × 5!) = 3,628,800 / (120 × 120) = 252.
With a TI calculator: 10 [2nd][nCr] 5 = 252.
Q3. A portfolio manager wants to eliminate four stocks from a portfolio that consists of six stocks. How many ways can the four stocks be sold when the order of the sales is important?
A) 180.
B) 24.
C) 360.
Correct answer is C)
This is a choose four from six problem where order is important. Thus, it requires the permutation formula: n! / (n − r)! = 6! / (6 − 4)! = 360.
With TI calculator: 6 [2nd][nPr] 4 = 360.
作者: jacky_z 时间: 2009-2-12 02:37
Thanks
作者: ff1980 时间: 2009-2-14 10:45
thanks
作者: dullmul 时间: 2009-3-24 11:25
answers
作者: hjl2000 时间: 2009-3-29 11:31
d
作者: connie198226 时间: 2009-4-2 12:46
ss
作者: maxv2 时间: 2009-4-2 18:38
CBC?
作者: kgbvvsscia 时间: 2009-4-6 19:33
谢谢了 哈哈
作者: hollyhe 时间: 2009-4-9 13:52
cbc
作者: gracesun 时间: 2009-4-11 07:10
thanks
作者: fange520 时间: 2009-4-11 09:14
cbc
作者: alecliang 时间: 2009-4-15 08:07
3
作者: big36999 时间: 2009-4-15 09:31
x
作者: amyamyamy 时间: 2009-4-19 11:54
thank you
作者: bartzzr 时间: 2009-4-19 12:23
thanks
作者: whoami158 时间: 2009-4-20 04:36
s
作者: ruyueyu 时间: 2009-4-20 11:05
answer is ..........
作者: liwenlan 时间: 2009-4-28 13:45
cbc
作者: vivianegao 时间: 2009-5-8 02:12
pass
作者: cynthia85 时间: 2009-5-8 10:22
c
作者: Michjay 时间: 2009-5-10 01:40
a
作者: deqiang 时间: 2009-5-11 09:05
ok
作者: julian1983 时间: 2009-5-19 17:19
3x
作者: helloalan 时间: 2009-5-22 10:22
cb
作者: itispig2 时间: 2009-5-31 14:59
1
作者: coffeebeanmm 时间: 2009-6-1 12:36
cbc
作者: jw564 时间: 2009-6-2 20:54
thx
作者: dxxiao 时间: 2009-6-4 11:27
thx
作者: RickDing 时间: 2009-6-4 20:21
dd
作者: kin009 时间: 2009-6-6 19:11
p
作者: ch_914 时间: 2009-7-20 19:51
THANKS
作者: smm911 时间: 2009-7-22 16:55
thanks
作者: jzwx 时间: 2009-7-26 10:29
thanks
作者: 流浪狗 时间: 2009-8-7 00:50
thanks
作者: josephine_loh 时间: 2009-8-9 15:05
tq
作者: huangyichun 时间: 2009-8-31 00:22
thanks
作者: luodan0103 时间: 2009-8-31 16:14
thanks
作者: maximus200409 时间: 2009-9-2 18:07
many thanks
作者: ohwow_my 时间: 2009-9-9 17:33
thanks
作者: tobuketsu 时间: 2009-9-11 19:51 标题: re
th
作者: zaestau 时间: 2009-9-13 22:50
cc
作者: loyalvirgo 时间: 2009-10-8 11:12
thx
作者: garmun 时间: 2009-10-13 22:24
tq
作者: htpeng 时间: 2009-10-20 12:30
喂喂喂
作者: doralin 时间: 2009-10-26 14:34
[em60]
作者: casey11 时间: 2009-10-27 16:53
11
作者: lqx1211 时间: 2009-10-28 22:44
aa
作者: solitute 时间: 2009-10-30 15:24
thanks
作者: tin_wo 时间: 2009-11-4 13:35
thanks
作者: haisian 时间: 2009-11-7 22:39
作者: xdsunjia 时间: 2009-11-14 06:11
Thx
作者: xmwang 时间: 2009-11-15 06:24
dsfdsa
作者: shjens 时间: 2009-11-18 01:12 标题: asd
fgh
作者: mellsa 时间: 2009-11-18 09:56
ff
作者: sibrinall 时间: 2009-11-18 16:03
[em58]
作者: frych 时间: 2009-11-24 15:51
gg
作者: gayson1121 时间: 2009-11-25 16:32
thanks
作者: shametospeak 时间: 2009-11-28 06:31
hf
作者: jiangcfa 时间: 2009-11-28 23:56
thx
作者: yangxi_sisi 时间: 2009-11-29 19:56
d
作者: jrxx99 时间: 2009-12-10 11:14
反复反复反复反复反复反复反复
作者: Vicky724 时间: 2009-12-15 06:20
w xiang kan
作者: jerrywang0 时间: 2010-4-9 15:13
qqq
作者: hanghang1211 时间: 2010-4-12 03:12
ok
作者: zhyue_2000 时间: 2010-4-12 09:28
thx
作者: shuru1207 时间: 2010-5-5 06:10
thnx
作者: 0939 时间: 2010-5-9 18:14
[em56]
作者: chenxu200312 时间: 2010-5-22 08:06
d
作者: IvanShen 时间: 2010-5-22 15:42
thx
作者: creativepharos 时间: 2010-6-2 08:29
thank you
作者: casiofd 时间: 2010-8-16 17:36
x
作者: Anyone2010 时间: 2010-9-3 14:41
ta
作者: scofield1985 时间: 2010-10-13 22:05
d
作者: seraphiris0116 时间: 2010-11-7 16:46
thanks
作者: xwsh0325 时间: 2010-11-16 03:36
d
作者: jingh1981 时间: 2010-11-23 01:24
thanks
作者: ludanjun 时间: 2010-11-23 10:54
大幅
作者: tctsr 时间: 2010-11-23 17:38
up
作者: leoniegolly 时间: 2010-11-25 19:02
3x
作者: jc1188 时间: 2010-11-27 13:41
d
作者: 祈愿修神 时间: 2011-4-1 16:45
3
作者: dapeng0731 时间: 2011-4-7 03:23
ghfhfgh
作者: zsd425 时间: 2011-4-20 23:25
谢谢了
作者: kepei7763 时间: 2011-5-28 06:12
thx
作者: FOREVER396 时间: 2011-6-19 16:39
HAVE A LOOK
作者: unknown 时间: 2011-6-25 10:55
thanks for sharing
作者: shing1314 时间: 2011-8-23 21:46
thanks for sharing
欢迎光临 CFA论坛 (http://forum.theanalystspace.com/) |
Powered by Discuz! 7.2 |