Study guide
6.2 Probability Concepts & Distributions
Certified Quality Engineer CQE
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Management and Leadership
1.1 Quality Philosophies & Foundations 1.2 Leadership & Organizational Systems 1.3 ASQ Code of Ethics & Professional Standards 1.4 Strategic Planning & Deployment 1.5 Management Infrastructure & Project Management 1.6 Quality Information Systems & Communication 1.7 Financial & Cost of Quality
2 Chapter 2: The Quality System
2.1 Quality Management System Elements & Standards 2.2 Quality Documentation Architecture 2.3 Quality Auditing Principles & Types 2.4 Audit Planning, Execution & Reporting 2.5 Corrective Action & Preventive Action Systems 2.6 Supplier Quality Management 2.7 Customer Relations & Customer Value 2.8 Quality Training Program Design & Effectiveness
3 Chapter 3: Product, Process, and Service Design
3.1 Design Input & Requirements 3.2 Design Review & Verification 3.3 Failure Mode and Effects Analysis 3.4 Design of Experiments Foundations 3.5 Robust Design & Taguchi Methods 3.6 Reliability & Maintainability Concepts 3.7 Reliability Modeling & System Evaluation 3.8 Technical Drawings, Specifications & GD&T
4 Chapter 4: Product and Process Control
4.1 Statistical Process Control Principles 4.2 Variable Control Charts 4.3 Attribute Control Charts 4.4 Process Capability & Performance Analysis 4.5 Acceptance Sampling Plans & Standards 4.6 Metrology, Calibration & Measurement Uncertainty 4.7 Measurement System Analysis (MSA) 4.8 Material Control, Traceability & MRB
5 Chapter 5: Continuous Improvement
5.1 Continuous Improvement Methodologies 5.2 Classic Quality Tools 5.3 Management & Planning Tools 5.4 Lean Tools & Waste Elimination 5.5 Problem-Solving Methodologies & Root Cause Analysis 5.6 Risk Management & Assessment 5.7 Change Management & Team Facilitation
6 Chapter 6: Quantitative Methods and Tools
6.1 Descriptive Statistics & Data Summarization 6.2 Probability Concepts & Distributions 6.3 Sampling Distributions & Central Limit Theorem 6.4 Point & Interval Estimation 6.5 Hypothesis Testing Fundamentals 6.6 Specific Statistical Tests 6.7 Regression & Correlation Analysis
7 Chapter 7: Risk Management & Advanced Quality Engineering
7.1 Risk Identification & Hazard Analysis 7.2 Quantitative Risk Analysis & Modeling 7.3 Risk Mitigation & Control Planning 7.4 Special Process Control & Advanced SPC 7.5 Advanced Statistical Design & Analysis 7.6 Computer Applications & Quality Engineering Software
6.2 Probability Concepts & Distributions
Key Takeaways Explain This Topic AI
The Addition Rule P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) P(A \cup B) = P(A) + P(B) - P(A \cap B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) reduces to P ( A ) + P ( B ) P(A) + P(B) P ( A ) + P ( B ) for mutually exclusive events, while Independence requires P ( A ∩ B ) = P ( A ) ⋅ P ( B ) P(A \cap B) = P(A) \cdot P(B) P ( A ∩ B ) = P ( A ) ⋅ P ( B ) .
The Binomial distribution models discrete counts of successes in n n n independent Bernoulli trials with constant probability p p p , featuring mean μ = n p \mu = np μ = n p and variance σ 2 = n p ( 1 − p ) \sigma^2 = np(1-p) σ 2 = n p ( 1 − p ) .
The Poisson distribution governs rare discrete events occurring randomly over a continuous interval at average rate λ \lambda λ , characterized by equal mean and variance ( μ = σ 2 = λ \mu = \sigma^2 = \lambda μ = σ 2 = λ ).
The Normal distribution N ( μ , σ 2 ) N(\mu, \sigma^2) N ( μ , σ 2 ) underpins standard Z-scores Z = X − μ σ Z = \frac{X - \mu}{\sigma} Z = σ X − μ , while the Exponential distribution models continuous failure time with constant hazard rate λ \lambda λ and reliability R ( t ) = e − λ t R(t) = e^{-\lambda t} R ( t ) = e − λ t .
Last updated: July 2026
6.2 Probability Concepts & Distributions
Probability theory quantifies uncertainty, providing the mathematical bridge between descriptive statistics and statistical inference. Quality engineers use probability models to evaluate component failure risk, design acceptance sampling plans, and establish process capability under inherent randomness.
Basic Rules & Axioms of Probability
Probability P ( A ) P(A) P ( A ) measures the likelihood of an event A A A occurring, bounded by 0 ≤ P ( A ) ≤ 1 0 \le P(A) \le 1 0 ≤ P ( A ) ≤ 1 .
1. Complement Rule
The probability that event A A A does not occur is: P ( A c ) = 1 − P ( A ) P(A^c) = 1 - P(A) P ( A c ) = 1 − P ( A )
2. Addition Rule (Union of Events)
For any two events A A A and B B B , the probability that at least one occurs is: P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B ) P(A \cup B) = P(A) + P(B) - P(A \cap B) P ( A ∪ B ) = P ( A ) + P ( B ) − P ( A ∩ B )
If A A A and B B B are mutually exclusive (cannot occur simultaneously, P ( A ∩ B ) = 0 P(A \cap B) = 0 P ( A ∩ B ) = 0 ): P ( A ∪ B ) = P ( A ) + P ( B ) P(A \cup B) = P(A) + P(B) P ( A ∪ B ) = P ( A ) + P ( B )
3. Conditional Probability & Multiplication Rule
The conditional probability of event A A A given event B B B has occurred is: P ( A ∣ B ) = P ( A ∩ B ) P ( B ) , for P ( B ) > 0 P(A|B) = \frac{P(A \cap B)}{P(B)}, \quad \text{for } P(B) > 0 P ( A ∣ B ) = P ( B ) P ( A ∩ B ) , for P ( B ) > 0
Rearranging gives the general Multiplication Rule : P ( A ∩ B ) = P ( A ∣ B ) ⋅ P ( B ) P(A \cap B) = P(A|B) \cdot P(B) P ( A ∩ B ) = P ( A ∣ B ) ⋅ P ( B )
If events A A A and B B B are independent (the occurrence of B B B does not alter the likelihood of A A A , P ( A ∣ B ) = P ( A ) P(A|B) = P(A) P ( A ∣ B ) = P ( A ) ): P ( A ∩ B ) = P ( A ) ⋅ P ( B ) P(A \cap B) = P(A) \cdot P(B) P ( A ∩ B ) = P ( A ) ⋅ P ( B )
Discrete Probability Distributions
Discrete distributions model countable outcomes, such as number of defects, rejected lots, or customer complaints.
1. Binomial Distribution
Models the number of success occurrences ( X = k X = k X = k ) in n n n independent trials, each with constant success probability p p p .
Probability Mass Function (PMF): P ( X = k ) = ( n k ) p k ( 1 − p ) n − k = n ! k ! ( n − k ) ! p k ( 1 − p ) n − k P(X = k) = \binom{n}{k} p^k (1-p)^{n-k} = \frac{n!}{k!(n-k)!} p^k (1-p)^{n-k} P ( X = k ) = ( k n ) p k ( 1 − p ) n − k = k ! ( n − k )! n ! p k ( 1 − p ) n − k
Mean & Variance: μ = n p , σ 2 = n p ( 1 − p ) , σ = n p ( 1 − p ) \mu = np, \quad \sigma^2 = np(1-p), \quad \sigma = \sqrt{np(1-p)} μ = n p , σ 2 = n p ( 1 − p ) , σ = n p ( 1 − p )
Assumptions: Fixed number of trials n n n ; binary outcomes (Success/Failure); independent trials; constant probability p p p .
2. Poisson Distribution
Models the count of rare events occurring randomly across a continuous interval of time, area, or volume at an average rate λ \lambda λ .
Probability Mass Function (PMF): P ( X = k ) = λ k e − λ k ! , k = 0 , 1 , 2 , … P(X = k) = \frac{\lambda^k e^{-\lambda}}{k!}, \quad k = 0, 1, 2, \dots P ( X = k ) = k ! λ k e − λ , k = 0 , 1 , 2 , …
Mean & Variance: μ = λ , σ 2 = λ \mu = \lambda, \quad \sigma^2 = \lambda μ = λ , σ 2 = λ
Key Characteristic: Equal mean and variance ( μ = σ 2 \mu = \sigma^2 μ = σ 2 ). Serves as a limiting approximation to the Binomial distribution when n ≥ 100 n \ge 100 n ≥ 100 and n p ≤ 10 np \le 10 n p ≤ 10 .
3. Hypergeometric Distribution
Models sampling without replacement from a finite population of size N N N containing K K K defective items, where n n n items are sampled.
Probability Mass Function (PMF): P ( X = k ) = ( K k ) ( N − K n − k ) ( N n ) P(X = k) = \frac{\binom{K}{k} \binom{N-K}{n-k}}{\binom{N}{n}} P ( X = k ) = ( n N ) ( k K ) ( n − k N − K )
Distinction: Unlike the Binomial distribution, trial outcomes are dependent because sampling without replacement alters remaining probabilities.
Continuous Probability Distributions
Continuous distributions model measurable variables such as dimension, weight, temperature, or operating lifetime.
1. Normal (Gaussian) Distribution
The cornerstone of statistical quality control, symmetric and bell-shaped, denoted N ( μ , σ 2 ) N(\mu, \sigma^2) N ( μ , σ 2 ) .
Standard Normal Transformation (Z-score): Z = X − μ σ Z = \frac{X - \mu}{\sigma} Z = σ X − μ
Empirical Rule (68-95-99.7 Rule):
μ ± 1 σ \mu \pm 1\sigma μ ± 1 σ contains ≈ 68.27 % \approx 68.27\% ≈ 68.27% of data.
μ ± 2 σ \mu \pm 2\sigma μ ± 2 σ contains ≈ 95.45 % \approx 95.45\% ≈ 95.45% of data.
μ ± 3 σ \mu \pm 3\sigma μ ± 3 σ contains ≈ 99.73 % \approx 99.73\% ≈ 99.73% of data.
2. Exponential Distribution
Models continuous time-to-failure or inter-arrival times for components exhibiting a constant failure rate λ \lambda λ (memoryless property).
Probability Density Function (PDF): f ( t ) = λ e − λ t , t ≥ 0 f(t) = \lambda e^{-\lambda t}, \quad t \ge 0 f ( t ) = λ e − λ t , t ≥ 0
Reliability Function R ( t ) R(t) R ( t ) : R ( t ) = P ( T > t ) = e − λ t R(t) = P(T > t) = e^{-\lambda t} R ( t ) = P ( T > t ) = e − λ t
- Mean Time Between Failures (MTBF): μ = MTBF = 1 λ \mu = \text{MTBF} = \frac{1}{\lambda} μ = MTBF = λ 1
- Distribution Selection Matrix for Quality Engineers
- Variable Type Problem Focus Appropriate Distribution Key Parameter(s)
- Discrete Pass/Fail in sample with replacement Binomial n , p n, p n , p
- Discrete Defects per unit / time interval Poisson λ \lambda λ
- Discrete Lot sampling without replacement Hypergeometric N , K , n N, K, n N , K , n
- Continuous Dimensional measurements Normal μ , σ \mu, \sigma μ , σ
- Continuous Time-to-failure (constant rate) Exponential λ , MTBF \lambda, \text{MTBF} λ , MTBF
- Comprehensive Worked Numerical Examples
- Example 1: Binomial Inspection
A printed circuit board (PCB) assembly line has a historical defect rate of p = 0.05 p = 0.05 p = 0.05 . A sample of n = 10 n = 10 n = 10 boards is inspected. Find the probability of finding exactly 1 defective board. P ( X = 1 ) & = ( 10 1 ) ( 0.05 ) 1 ( 1 − 0.05 ) 10 − 1 & = 10 × 0.05 × ( 0.95 ) 9 & = 0.50 × 0.6302 = 0.3151 (or 31.51 % ) \begin{aligned}
- P(X = 1) \&= \binom{10}{1} (0.05)^1 (1 - 0.05)^{10-1} \\
- \&= 10 \times 0.05 \times (0.95)^9 \\
- \&= 0.50 \times 0.6302 = 0.3151 \text{ (or } 31.51\%\text{)}
\end{aligned} P ( X = 1 ) & = ( 1 10 ) ( 0.05 ) 1 ( 1 − 0.05 ) 10 − 1 & = 10 × 0.05 × ( 0.95 ) 9 & = 0.50 × 0.6302 = 0.3151 (or 31.51% )
Example 2: Poisson Equipment Jam Rate
A high-speed labeling machine experiences an average of λ = 2.0 \lambda = 2.0 λ = 2.0 stoppages per 8-hour shift. Calculate the probability of experiencing at most 1 stoppage during a shift. P ( X ≤ 1 ) & = P ( X = 0 ) + P ( X = 1 ) & = 2.0 0 e − 2.0 0 ! + 2.0 1 e − 2.0 1 ! & = e − 2.0 ( 1 + 2.0 ) = 0.1353 × 3 = 0.4060 (or 40.60 % ) \begin{aligned}
- P(X \le 1) \&= P(X = 0) + P(X = 1) \\
- \&= \frac{2.0^0 e^{-2.0}}{0!} + \frac{2.0^1 e^{-2.0}}{1!} \\
- \&= e^{-2.0} (1 + 2.0) = 0.1353 \times 3 = 0.4060 \text{ (or } 40.60\%\text{)}
\end{aligned} P ( X ≤ 1 ) & = P ( X = 0 ) + P ( X = 1 ) & = 0 ! 2. 0 0 e − 2.0 + 1 ! 2. 0 1 e − 2.0 & = e − 2.0 ( 1 + 2.0 ) = 0.1353 × 3 = 0.4060 (or 40.60% )
Example 3: Exponential Reliability
An avionics power module has a constant failure rate of λ = 0.0005 \lambda = 0.0005 λ = 0.0005 failures per hour (MTBF = 2,000 hours). Calculate the reliability R ( t ) R(t) R ( t ) for a 500-hour mission. R ( 500 ) = e − λ t = e − ( 0.0005 × 500 ) = e − 0.25 ≈ 0.7788 (or 77.88 % ) R(500) = e^{-\lambda t} = e^{-(0.0005 \times 500)} = e^{-0.25} \approx 0.7788 \text{ (or } 77.88\%\text{)} R ( 500 ) = e − λ t = e − ( 0.0005 × 500 ) = e − 0.25 ≈ 0.7788 (or 77.88% )
CQE Exam Tips & Strategy
Distinguish Replacement: Sampling with replacement or from infinite lot = Binomial . Sampling without replacement from small finite lot = Hypergeometric .
Poisson Equality: If an exam question mentions that mean equals variance ( μ = σ 2 \mu = \sigma^2 μ = σ 2 ), immediately recognize the Poisson distribution .
Exponential Memoryless: The exponential distribution assumes no wear-out mechanism. The probability of surviving the next 100 hours is independent of how many hours the part has already operated.