EE3713

APPLIED'PROBABILITY'AND'STATISTICS'FOR'ELECTRICAL'

ENGINEERS!!

What happens with more subexperiments?

Experiment E has k subexperiments E1, E2,…, Ek. Each subexperiment Ei has ni outcomes. How many outcomes does E have?

k-permutations

An ordered sequence of k distinguishable objects is called a k-permutation. For example, choosing 7 cards in sequence from a 52 card deck (all cards are distinguishable). It is denoted (n)k it is also sometimes referred to as nPk.

Sampling without replacement

Choosing objects randomly from a collection is called sampling, and the chosen objects are known as a sample. For k-permutations, once we choose an object we remove the object from the collection and we cannot choose it again. This procedure is called sampling without replacement.