Professional Documents
Culture Documents
Ooeo Oeeo Eoeo Eeeo Ooee Oeee Eoee Eeee S
Ooeo Oeeo Eoeo Eeeo Ooee Oeee Eoee Eeee S
Section 2-1
2-1. Let "a", "b" denote a part above, below the specification
S = {aaa, aab, aba, abb, baa, bab, bba, bbb}
2-2. Let "e" denote a bit in error
Let "o" denote a bit not in error ("o" denotes okay)
⎧eeee, eoee, oeee, ooee, ⎫
⎪eeeo, eoeo, oeeo, ooeo, ⎪
⎪ ⎪
S=⎨ ⎬
⎪eeoe, eooe, oeoe, oooe, ⎪
⎪⎩eeoo, eooo, oeoo, oooo ⎪⎭
2-5. If only the number of tracks with errors is of interest, then S = {0,12
, ,...,24}
2-6. A vector with three components can describe the three digits of the ammeter. Each digit can be
0,1,2,...,9. Then S is a sample space of 1000 possible three digit integers, S = {000,001,...,999}
2-7. S is the sample space of 100 possible two digit integers.
2-8. Let an ordered pair of numbers, such as 43 denote the response on the first and second question. Then, S
consists of the 25 ordered pairs {1112
, ,...,55}
2-9. S = {0,1,2,...,1E 09} in ppb.
2-10. S = {0,1,2,...,} in milliseconds
2-11. S = {1.0,1.1,1.2, …14.0}
2-12. s = small, m = medium, l = large; S = {s, m, l, ss, sm, sl, ….}
2-13 S = {0,1,2,...,} in milliseconds.
2-14.
automatic standard
transmission transmission
red blue black white red blue black white red blue black white red blue black white
2-1
2-15.
PRESS 1 2
CAVITY
1 2 3 4 5 6 7 8 1 2 3 4 5 6 7 8
2-16.
memory
4 8 12
disk storage
b)
c)
2-2
d)
e)
2.20 a)
2-3
b)
c)
d)
e)
2-4
2-21. a) S = nonnegative integers from 0 to the largest integer that can be displayed by the scale.
Let X represent weight.
A is the event that X > 11 B is the event that X ≤ 15 C is the event that 8 ≤ X <12
S = {0, 1, 2, 3, …}
b) S
c) 11 < X ≤ 15 or {12, 13, 14, 15}
d) X ≤ 11 or {0, 1, 2, …, 11}
e) S
f) A ∪ C would contain the values of X such that: X ≥ 8
Thus (A ∪ C)′ would contain the values of X such that: X < 8 or {0, 1, 2, …, 7}
g) ∅
h) B′ would contain the values of X such that X > 15. Therefore, B′ ∩ C would be the empty set. They
have no outcomes in common or ∅
i) B ∩ C is the event 8 ≤ X <12. Therefore, A ∪ (B ∩ C) is the event X ≥ 8 or {8, 9, 10, …}
2-22. a)
A B
C
b)
A B
C
c)
d)
A B
2-5
e) If the events are mutually exclusive, then A∩B is equal to zero. Therefore, the process does not
produce product parts with X=50 cm and Y=10 cm. The process would not be successful.
2-23. Let "d" denoted a distorted bit and let "o" denote a bit that is not distorted.
⎧dddd, dodd, oddd, oodd, ⎫
⎪ ⎪
⎪dddo, dodo, oddo, oodo,⎪
a) S = ⎨ ⎬
⎪ddod, dood, odod, oood, ⎪
⎪⎩ddoo, dooo, odoo, oooo ⎪⎭
⎧dddd , dodd ,⎫
⎪dddo, dodo ⎪
⎪ ⎪
c) A1 = ⎨ ⎬
⎪ddod , dood ⎪
⎪⎩ddoo, dooo ⎪⎭
⎧oddd , oodd ,⎫
⎪oddo, oodo, ⎪
⎪ ⎪
d) A1′ = ⎨ ⎬
⎪odod , oood ,⎪
⎪⎩odoo, oooo ⎪⎭
e) A1 ∩ A2 ∩ A3 ∩ A4 = {dddd }
2-24
Let w denote the wavelength. The sample space is {w | w = 0, 1, 2, …}
2-25
2-6
Surface 1
G
Edge 1 E
G
E
G E
Surface 2 E
G
Edge 2 E
E G
G
E G E G
E G
E G
E G E G
E G E G
E G
2-32.a.) The sample space contains all points in the positive X-Y plane.
b)
10 A
c)
20
d)
2-7
B
20
10 A
e)
B
20
10 A
2-33 a)
b)
c)
2-8
d)
2-34.212 = 4096
2-35. From the multiplication rule, the answer is 5 × 3 × 4 × 2 = 120
2-39. From the multiplication rule and equation 2-1, the answer is 5!5! = 14,400
7!
2-40. From equation 2-3, = 35 sequences are possible
3! 4!
2-41. a) From equation 2-4, the number of samples of size five is ( ) = 5140
140
5
!
!135!
= 416,965,528
b) There are 10 ways of selecting one nonconforming chip and there are ( ) = 4130
130
4
!
!126!
= 11,358,880
ways of selecting four conforming chips. Therefore, the number of samples that contain exactly one
nonconforming chip is 10 × 4 ( )
130
= 113,588,800
c) The number of samples that contain at least one nonconforming chip is the total number of samples
2-9
( ) ( )
That is 140
5 - 130
5 =
140! 130!
−
5!135! 5!125!
= 130,721,752
2-42. a) If the chips are of different types, then every arrangement of 5 locations selected from the 12 results in a
12!
different layout. Therefore, P512 = = 95,040 layouts are possible.
7!
b) If the chips are of the same type, then every subset of 5 locations chosen from the 12 results in a different
layout. Therefore, 12( )
5
=
12!
5! 7!
= 792 layouts are possible.
7!
2-43. a) = 21 sequences are possible.
2!5!
7!
b) = 2520 sequences are possible.
1!1!1!1!1!2!
c) 6! = 720 sequences are possible.
2-44. a) Every arrangement of 7 locations selected from the 12 comprises a different design.
12!
P712 = = 3991680 designs are possible.
5!
12!
b) Every subset of 7 locations selected from the 12 comprises a new design. = 792 designs are
5!7!
possible.
c) First the three locations for the first component are selected in ( ) = 312!9!! = 220 ways. Then, the four
12
3
locations for the second component are selected from the nine remaining locations in ( ) = 49!5!! = 126
9
4
ways. From the multiplication rule, the number of designs is 220 ×126 = 27,720
2-45. a) From the multiplication rule, 10 = 1000 prefixes are possible
3
2-10
b) The number of samples that contain no tank with high viscosity is ( ) = 418
18
4
!
!14!
= 3060. Therefore, the
3060
requested probability is 1 − = 0.712 .
10626
c) The number of samples that meet the requirements is ( )( )( ) = 16!5!! × 14!3!! × 214
6
1
4
1
14
2
!
!12!
= 2184 .
2184
Therefore, the probability is = 0.206
10626
90/220 = 0.409.
b) The number of samples with no nonconforming part is ( ) = 310!7!! = 120. The probability of at least one
10
3
120
nonconforming part is 1 − = 0.455 .
220
5 4
2-49. a) The probability that both parts are defective is × = 0.0082
50 49
50! 50 × 49
b) The total number of samples is 2 =
50
( ) 2!48!
=
2
. The number of samples with two defective
5× 4
5! 5 × 4 5× 4
()
parts is 2 =
5
2!3!
=
2
. Therefore, the probability is
2
50× 49
=
50 × 49
= 0.0082 .
2
2-11