concise.notes - IE230 CONCISE NOTES Revised January 9, 2011...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
IE230 CONCISE NOTES Revised January 9, 2011 Purpose: These concise notes contain the definitions and results for Purdue University’s course IE 230, "Probability and Statistics for Engineers, I". The purpose of these notes is to provide a complete, clear, and concise compendium. The purpose of the lectures, textbook, homework assignments, and office hours is to help understand the meanings and implications of these notes via discussion and examples. Essentially everything here is in Chapters 2–7 of the textbook, often in the highlighted blue boxes. Topic order roughly follows the textbook. Textbook: D.C. Montgomery and G.C. Runger, Applied Statistics and Probability for Engineers Table of Contents Topic Pages Textbook iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii Set-Theory Review 2 None Probability Basics 3–5 Chapter 2 sample space and events 3 event probability 4 conditional probability, independence 5 Discrete Random Variables 6–8 Chapter 3 pmf, cdf, moments 6 uniform, Bernoulli trials, Poisson process 7 summary table: discrete distributions 8 Continuous Random Variables 9–12 Chapter 4 pdf, cdf, moments, uniform, triangular 9 normal distribution, central limit theorem 10 normal approximations, continuity correction 11 exponential, Erlang, gamma, Weibull 11 Chebyshev’s inequality 11 None summary table: continuous distributions 12 Random Vectors 13–18 Chapter 5 discrete joint and marginal distributions 13 conditional distributions 14 multinomial distribution 14 continuous distributions 15 conditional distributions 16 covariance, correlation 17 bivariate normal 17 linear combinations, sample mean, central limit theorem 18 Descriptive Statistics 19 Chapter 6 Point Estimation 20–22 Chapter 7 parameter estimator and their properties 20 summary table: point estimators, sampling distribution 21 fitting distributions, MOM, MLE 22 iiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii Purdue University – 1 of 22 – B.W. Schmeiser
Background image of page 1

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

View Full DocumentRight Arrow Icon
IE230 CONCISE NOTES Revised January 9, 2011 Set-Theory Review A set is a collection of items; each such item is called a member of the set. If a set A has members x , y , and z , we can write A = { x , y , z } and, for example, x A . If a set has members defined by a condition, we write A = { x | x satisfies the condition}. The vertical line is read "such that". The largest set is the universe , the set containing all relevant items. The smallest set is the empty set (or, sometimes, the null set ), the set containing no items; it is denoted by or, occasionally, by {}. If all members of a set A are contained in a set B , then A is a subset of B , written A B . If two sets
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/25/2011 for the course IE 230 taught by Professor Xangi during the Spring '08 term at Purdue University-West Lafayette.

Page1 / 22

concise.notes - IE230 CONCISE NOTES Revised January 9, 2011...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online