Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

- Probability Powerpoint by spike2904 89827 views
- Sample space and probablity by Tarun Gehlot 40752 views
- Probability by Rushina Singhi 4466 views
- Probability basics and bayes' theorem by Balaji P 4681 views
- Probability concept and Probability... by Bijaya Bhusan Nanda 17713 views
- PROBABILITY AND IT'S TYPES WITH RULES by Bhargavi Bhanu 24330 views

4,445 views

4,259 views

4,259 views

Published on

Sample Space And Events

Published in:
Education

No Downloads

Total views

4,445

On SlideShare

0

From Embeds

0

Number of Embeds

5

Shares

0

Downloads

0

Comments

0

Likes

2

No embeds

No notes for slide

- 1. 1.1 Sample Space and events<br />
- 2. Sample Space and Events<br />A set of all possible outcomes of an experiment is called a sample space. It is denoted by S.<br />A particular outcome, i.e. an element in S is called a sample point.<br />An experiment consists of the simple process of noting outcomes.<br />The outcome of an experiment may be a simple choice between two alternatives; it may be result of a direct measurement or count; or it may be answer obtained after extensive measurements and calculations.<br />
- 3. Sample Space and Events<br />A sample space is said to be discrete if it has finitely many or a countable (denumerable) infinity of elements.<br />If the elements of a sample space constitute a continuum, the sample space is said to be continuous. For example, all points on a line, all points on a line segment, or all points in a plane.<br />Any subset of a sample space is called an event.<br />The subset {a} consisting of a single sample point a S is called an elementary event.<br /> and S itself are subsets of S and so are events.<br />
- 4. Sample Space and Events<br />Example 1: A technician has to check the suitability of 3 solid crystal lasers and 2 CO2 lasers for a given task.<br /> Let (a,b) represent the event that the technician will find a of the solid crystal lasers and b of the CO2 lasers suitable for the task, then the sample space will be<br /> S = {(0,0), (0,1), (0,2), (1,0), (1,1), (1,2), (2,0), (2,1), (2,2), (3,0), (3,1), (3,2)}.<br />
- 5. Sample Space and Events<br />R = {(0,0), (1,1), (2,2)}<br /> is the event that equally many solid crystal lasers and CO2 lasers are suitable.<br />T = {(0,0), (1,0), (2,0), (3,0)} <br /> is the event that none of the CO2 lasers are suitable for the task.<br />U = {(0,1), (0,2), (1,2)}<br /> is the event that fewer solid crystal laser than the CO2 lasers are suitable for the task.<br />
- 6. Sample Space and Events<br />If two events have no element in common, they are called mutually exclusive events, i.e. they cannot occur simultaneously.<br />In above example R &T are not mutually exclusive events while R & U and T & U are mutually exclusive events.<br />In order to discuss the basic concepts of the probabilistic model which we wish to develop, it will be very convenient to have available some ideas and concepts of mathematical theory of sets. <br />Sample spaces and events, particularly relationship among events are depicted by means of Venn diagrams<br />
- 7. Sample Space and Events<br />If A and B are any two sets in a sample space S,<br /> A B= {x S | x A or x B (or both)};<br /> AB = {x S | x A and x B}; <br /> The complement of A i.e.<br /> A B = A – B = {x S | x A and x B}<br /> The symmetric difference of sets A and B i.e. <br /> A B = A B B A = A B - AB<br /> A set is called empty set and denoted by which has no elements.<br />
- 8. Venn Diagrams<br />Venn diagrams<br />S<br />S<br />A<br />A<br />A<br />
- 9. Venn Diagrams<br />Venn diagrams<br />S<br />S<br />A<br />B<br />B<br />A<br />AB<br />AB<br />
- 10. Venn Diagrams<br />Venn diagrams<br />S<br />S<br /> A<br />B<br />B<br />A<br />AB or A - B<br />A B<br />
- 11. Events<br />RU = {(0,0), (1,1), (2,2), (0,1), (0,2), (1,2)}<br /> is the event that the number of suitable CO2 lasers is grater than or equal to the number of suitable solid crystal lasers.<br />RT = {(0,0)} <br /> is the event that neither CO2 laser nor solid crystal laser is suitable. <br /> = {(0,1), (0,2), (1,1), (1,2), (2,1), (2,2), (3,1), (3,2)}<br /> is the event that at least one CO2 laser is suitable.<br />
- 12. At times it can be quite difficult, or at least tedious to determine the number of elements in a finite sample space by direct enumeration.<br />Suppose a consumer testing service, rates lawn mowers <br /> a) as being easy, average or difficult to operate;<br /> b) as being expensive or inexpensive; and<br /> c) as being costly, average or cheap to repair.<br />Events<br />
- 13. Tree Diagram<br />To handle this kind of problem systematically we use tree diagram.<br />E1, E2, and E3 denotes three alternatives for ease of operation.<br />P1 and P2 denote two alternatives of price. <br />C1, C2, and C3 denotes three alternatives for cost of repair.<br />
- 14. Tree Diagram<br />Tree Diagram for rating of lawn mowers<br />E2<br />E3<br />E1<br />P1<br />P1<br />P1<br />P2<br />P2<br />P2<br />C2<br />C3<br />C1<br />C1<br />C1<br />C1<br />C1<br />C1<br />C2<br />C2<br />C2<br />C2<br />C2<br />C3<br />C3<br />C3<br />C3<br />C3<br />
- 15. Tree Diagram<br />Following a given path from top to bottom along a branch of the tree, we obtain a particular rating, namely, a particular element of the sample space.<br />This result could also have been obtained by observing that there are three E-branches, that E-branch forks into two P-branches, and that P-branch forks into three C-branches.<br />Thus there are 3.2.3 = 18 combination of branches or paths<br />

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment