DOC PREVIEW
UT Dallas CS 6313 - probs 2-3

This preview shows page 1-2-3-4-5-6 out of 17 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 17 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 17 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 17 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 17 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 17 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 17 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 17 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

From the 5 defective parts, select 4, and the number of ways to complete this step is 5!/(4!1!) = 5From the 45 non-defective parts, select 6, and the number of ways to complete this step is 45!/(6!39!) = 8,145,060Therefore, the number of samples that contain exactly 4 defective parts is 5(8,145,060) = 40,725,300Similarly, from the 5 defective parts, the number of ways to select 5 is 5!(5!1!) = 1From the 45 non-defective parts, select 5, and the number of ways to complete this step is 45!/(5!40!) = 1,221,759Therefore, the number of samples that contain exactly 5 defective parts is 1(1,221,759) = 1,221,759Finally, the number of samples that contain at least 4 defective parts is 40,725,300 + 1,221,759 = 41,947,059Total possible: 1016, but only 108are valid. Therefore, P(valid) = 108/1016= 1/108Apply addition rule: (a) P(unsatisfactory) = (5 + 10 – 2)/130 = 13/130(b) P(both criteria satisfactory) = 117/130 = 0.90, No(a) P = (8-1)/(350-1)=0.020(b) P = (8/350) [(8-1)/(350-1)]=0.000458(c) P = (342/350) [(342-1)/(350-1)]=0.9547(a) (0.88)(0.27) = 0.2376(b) (0.12)(0.13+0.52) = 0.0.078P(X = 10 million) = 0.3, P(X = 5 million) = 0.6, P(X = 1 million) = 0.1The sum of the probabilities is 1 and all probabilities are greater than or equal to zero: f(-10) = 0.25, f(30) = 0.5, f(50) = 0.25a) P(X50) = 1b) P(X40) = 0.75c) P(40  X  60) = P(X=50)=0.25d) P(X<0) = 0.25e) P(0X<10) = 0f) P(10<X<10) = 0Let X denote the number of trials to obtain the first successful alignment. Then X is a geometric random variable with p = 0.8 a) 0064.08.02.08.0)8.01()4(33XP b) )4()3()2()1()4(  XPXPXPXPXP 8.0)8.01(8.0)8.01(8.0)8.01(8.0)8.01(3210 9984.08.02.0)8.0(2.0)8.0(2.08.032 c) )]3()2()1([1)3(1)4(  XPXPXPXPXP ]8.0)8.01(8.0)8.01(8.0)8.01[(1210


View Full Document

UT Dallas CS 6313 - probs 2-3

Documents in this Course
ch09-01

ch09-01

24 pages

ch08-2

ch08-2

19 pages

ch08-1

ch08-1

17 pages

ch07-3

ch07-3

19 pages

ch07-2

ch07-2

11 pages

ch04

ch04

51 pages

ch02

ch02

50 pages

ch01

ch01

28 pages

ch11-3

ch11-3

26 pages

ch11-2

ch11-2

17 pages

ch11-1

ch11-1

13 pages

ch10-02

ch10-02

29 pages

ch10-01

ch10-01

28 pages

ch09-04

ch09-04

22 pages

ch09-03

ch09-03

17 pages

ch09-02

ch09-02

22 pages

ch11-3

ch11-3

26 pages

ch11-2

ch11-2

17 pages

ch11-1

ch11-1

13 pages

ch10-02

ch10-02

29 pages

ch10-01

ch10-01

28 pages

ch09-04

ch09-04

22 pages

ch09-03

ch09-03

17 pages

ch09-02

ch09-02

22 pages

ch09-01

ch09-01

24 pages

ch08-2

ch08-2

19 pages

ch08-1

ch08-1

17 pages

ch07-3

ch07-3

19 pages

ch07-2

ch07-2

11 pages

ch04

ch04

51 pages

ch02

ch02

50 pages

ch01

ch01

28 pages

PS-10

PS-10

18 pages

PS-9

PS-9

14 pages

PS-7

PS-7

11 pages

PS-6

PS-6

12 pages

PS-5

PS-5

8 pages

PS-4

PS-4

8 pages

ch09-02

ch09-02

22 pages

ch09-01

ch09-01

24 pages

ch08-2

ch08-2

19 pages

ch08-1

ch08-1

17 pages

ch07-3

ch07-3

19 pages

ch07-2

ch07-2

11 pages

ch04

ch04

51 pages

ch02

ch02

50 pages

ch01

ch01

28 pages

PS-10

PS-10

18 pages

PS-4

PS-4

8 pages

probs 2-3

probs 2-3

17 pages

ch11-3

ch11-3

26 pages

ch11-2

ch11-2

17 pages

ch11-1

ch11-1

13 pages

ch10-02

ch10-02

29 pages

ch10-01

ch10-01

28 pages

ch09-04

ch09-04

22 pages

ch09-03

ch09-03

17 pages

SCAN0004

SCAN0004

12 pages

SCAN0001

SCAN0001

12 pages

Prob9

Prob9

12 pages

prob10

prob10

3 pages

Load more
Download probs 2-3
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view probs 2-3 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view probs 2-3 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?