{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Lecture3_CountingConditional

# Lecture3_CountingConditional - ECE 340 Probabilistic...

This preview shows pages 1–7. Sign up to view the full content.

ECE 340 Probabilistic Methods in Engineering M/W 3-4:15 Prof. Vince Calhoun Prof. Vince Calhoun Lecture 3: Counting/Conditional Lecture 3: Counting/Conditional

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

View Full Document
Review of Last Time • Section 2.1 • Examples of experiments •D i s c r e t e • Continuous •E v e n t s E x a m p l e s • Certain event • Null event • Set Operations • Union
Reading • This class: Section 2.3-2.4 • Next class: Section 2.5-2.5 (Jean Liu)

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

View Full Document
Outline • Section 2.3 • Counting • Permutations of n objects • Section 2.4 • Conditional probability •Ba
Enumeration or Counting Technologies When the various outcomes of an experiment are equally likely (the same probability is assigned to each sample event). Then the task of computing probabilities reduces to counting. In particular, if N(S) is the # of outcomes contained in an event A, then ) ( ) ( ) ( S N A N A P =

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

View Full Document
Product Rule Suppose that a set consists of an ordered collection of r elements, and that there are n 1 ways to choose the first element, n 2 ways to choose the second element, … n r ways to choose the r-th element, then there are n 1 × n 2 × n r possible r-tuples. Note:
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 44

Lecture3_CountingConditional - ECE 340 Probabilistic...

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

View Full Document
Ask a homework question - tutors are online