Review Session1-2-3 - Review Session Selected problems from...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Review Session Selected problems from Chapters 1, 2 and 3 Engineering Probability MTH 3301
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Problem 1- Independence A project consists of three independent tasks and the probabilities of these tasks being completed on time are .90, .80 and .95, respectively. Find the probabilities that: (i) All three tasks will be completed on time. (ii) The first two tasks will be completed on time and the third one will not. (iii) Either the first or last task will be completed on time.
Background image of page 2
Problem 1- Independence Solution. Let Ci denote the event that task i is completed on time. The independence of the tasks translates into the independence of the events C1, C2, C3. Then by the definition of independent events, the first two probabilities are: 1- P(C1 and C2 and C3) = (.9)(.8)(.95) = 0.684 2- P(C1 and C2 and Cc 3) = ( .9)(.8)(.05) = 0.036 3- P(C1 UC3) = P(C1) + P(C3) - P(C1 and C3) = .9 + .95 - (.9)(.95) = 0.995.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Problem 2- Conditional Probability The probabilities that a student in this class will expend a high, medium or low amount of effort in
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/05/2012 for the course ENGINEERIN mth 3301 taught by Professor Dr.k during the Spring '12 term at Al Akhawayn University.

Page1 / 11

Review Session1-2-3 - Review Session Selected problems from...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online