chapter 1 Flashcards
(44 cards)
the process which an observation (or measurement) data is obtained through either uncontrolled events in nature or controlled situations in a laboratory.
Experiment
the set whose elements are all the possible outcomes of an experiment.
Sample Space
elements in a sample space.
Sample Points
has a finite number of outcomes.
ex. Outcomes of a single coin tossed
Finite Sample Space
has an infinite number of outcomes.
ex. Waiting time at the bus stop
Infinite Sample Space
a subset of the sample space.
Event
an event that contains one
sample point.
Simple Event
has no outcomes,
cannot occur.
Null Space {} or Empty Set Ø
What are the three (3) set operations?
Union, intersection, complement
Set Operations
The ________ of two events consists of all outcomes that are contained in one event or the other, denoted as 𝑬𝟏∪𝑬𝟐.
Union
Set Operations
The ________ of two events consists of all outcomes that are contained in one event and 𝑬𝟏∩𝑬𝟐.
Intersection
Set Operations
The _____________ of an event is the set of outcomes in the sample space that are not contained in the event, denoted as 𝑬’
Complement
Events A and B are ______________________ or disjoint because they share no common outcomes.
mutually exclusive
The occurrence of one event precludes the occurrence of the other.
mutually exclusive
Symbolically, A ∩B = Ø
mutually exclusive
mutually exclusive
A∪B= B∪A and A∩B= B∩A
Commutative Law (Event Order Is Unimportant)
mutually exclusive
(A ∪B) ∩ C= (A ∩ C) ∪(B∩C)
(A ∩B) ∪ C= (A∪ C) ∩(B∪C)
Distributive Law
mutually exclusive
(A ∪B) ∪ C = A ∪(B ∪ C)
(A ∩B) ∩ C= A ∩(B∩C)
Associative Law (Like In Algebra)
mutually exclusive
(A ∪B)’ = A’∩ B’ the complement of the union is the intersection of the complements.
(A ∩B)’= A’∪B’ the complement of the intersection is the union of the complements
Demorgan’s Law
mutually exclusive
(A’)’ = A
Complement Law
The negation of a disjunction is the conjunction of the negations;
The negation of a conjunction is the disjunction of the negations;
True or false?
throat.
Basic Counting Techniques
There are three special rules, or counting techniques, used to determine the number of outcomes in events. They are :
- Multiplication rule
- Permutation rule
- Combination rule
Basic Counting Techniques
“If a certain experiment can be performed in n1 ways and corresponding to each of these ways another experiment can be performed in n2 ways, then the combined experiment can be performed in n1* n2ways.”
Multiplication rule
Basic Counting Techniques
Arrangement of objects w/ regards to order.
Permutation