Quick review of some key ideas CEE 11 Spring 2002 Dr. Amelia Regan These notes draw liberally from the class text, Probability and Statistics for Engineering.

Slides:



Advertisements
Similar presentations
Unit 0, Pre-Course Math Review Session 0.2 More About Numbers
Advertisements

Chapter 2 Probability. 2.1 Sample Spaces and Events.
Chapter 4 Probability and Probability Distributions
AP Statistics Chapter 16. Discrete Random Variables A discrete random variable X has a countable number of possible values. The probability distribution.
Topic 6: Introduction to Hypothesis Testing
Topic 3: Counting Techniques CEE 11 Spring 2002 Dr. Amelia Regan These notes draw liberally from the class text, Probability and Statistics for Engineering.
Chapter Two Probability. Probability Definitions Experiment: Process that generates observations. Sample Space: Set of all possible outcomes of an experiment.
1-1 Copyright © 2015, 2010, 2007 Pearson Education, Inc. Chapter 15, Slide 1 Chapter 15 Random Variables.
Class notes for ISE 201 San Jose State University
Key Concepts of the Probability Unit
Copyright © 2010, 2007, 2004 Pearson Education, Inc. Section 4-2 Basic Concepts of Probability.
AP STATISTICS.   Theoretical: true mathematical probability  Empirical: the relative frequency with which an event occurs in a given experiment  Subjective:
Chapter 4 Probability Copyright © 2014 by The McGraw-Hill Companies, Inc. All rights reserved.McGraw-Hill/Irwin.
Chapter 4 Probability 4-1 Overview 4-2 Fundamentals 4-3 Addition Rule
Census A survey to collect data on the entire population.   Data The facts and figures collected, analyzed, and summarized for presentation and.
PBG 650 Advanced Plant Breeding
L Berkley Davis Copyright 2009 MER301: Engineering Reliability Lecture 5 1 MER301: Engineering Reliability LECTURE 5: Chapter 3: Probability Plotting,The.
10/1/20151 Math a Sample Space, Events, and Probabilities of Events.
Topic 1: Descriptive Statistics CEE 11 Spring 2001 Dr. Amelia Regan These notes draw liberally from the class text, Probability and Statistics for Engineering.
Principles of Statistics Chapter 2 Elements of Probability.
Probability Notes Math 309. Sample spaces, events, axioms Math 309 Chapter 1.
CSCI 115 Chapter 3 Counting. CSCI 115 §3.1 Permutations.
Lecture 03 Prof. Dr. M. Junaid Mughal Mathematical Statistics.
CS6825: Probability Distributions An Introduction.
Ch Counting Techniques Product Rule If the first element or object of an ordered pair can be used in n 1 ways, and for each of these n1 ways.
Probability. Basic Concepts of Probability and Counting.
Discrete Random Variables. Numerical Outcomes Consider associating a numerical value with each sample point in a sample space. (1,1) (1,2) (1,3) (1,4)
Summary -1 Chapters 2-6 of DeCoursey. Basic Probability (Chapter 2, W.J.Decoursey, 2003) Objectives: -Define probability and its relationship to relative.
Topic 2: Intro to probability CEE 11 Spring 2002 Dr. Amelia Regan These notes draw liberally from the class text, Probability and Statistics for Engineering.
Chapter 9 Statistics.
Chapter 7 Point Estimation of Parameters. Learning Objectives Explain the general concepts of estimating Explain important properties of point estimators.
From Randomness to Probability Chapter 14. Dealing with Random Phenomena A random phenomenon is a situation in which we know what outcomes could happen,
Probability You’ll probably like it!. Probability Definitions Probability assignment Complement, union, intersection of events Conditional probability.
13.3 Conditional Probability and Intersections of Events Understand how to compute conditional probability. Calculate the probability of the intersection.
Conditional Probability and Intersection of Events Section 13.3.
Introduction to Probability (Dr. Monticino). Assignment Sheet  Read Chapters 13 and 14  Assignment #8 (Due Wednesday March 23 rd )  Chapter 13  Exercise.
Review of Probability. Important Topics 1 Random Variables and Probability Distributions 2 Expected Values, Mean, and Variance 3 Two Random Variables.
STA 2023 Module 5 Discrete Random Variables. Rev.F082 Learning Objectives Upon completing this module, you should be able to: 1.Determine the probability.
AP Statistics Chapter 16. Discrete Random Variables A discrete random variable X has a countable number of possible values. The probability distribution.
Topic 5: Continuous Random Variables and Probability Distributions CEE 11 Spring 2002 Dr. Amelia Regan These notes draw liberally from the class text,
Random Variables. Numerical Outcomes Consider associating a numerical value with each sample point in a sample space. (1,1) (1,2) (1,3) (1,4) (1,5) (1,6)
Topic 6: The distribution of the sample mean and linear combinations of random variables CEE 11 Spring 2002 Dr. Amelia Regan These notes draw liberally.
+ Chapter 5 Overview 5.1 Introducing Probability 5.2 Combining Events 5.3 Conditional Probability 5.4 Counting Methods 1.
Introduction Remember that probability is a number from 0 to 1 inclusive or a percent from 0% to 100% inclusive that indicates how likely an event is to.
Chapter 14 From Randomness to Probability. Dealing with Random Phenomena A random phenomenon: if we know what outcomes could happen, but not which particular.
Section 1.3 Each arrangement (ordering) of n distinguishable objects is called a permutation, and the number of permutations of n distinguishable objects.
CSCI 115 Chapter 3 Counting. CSCI 115 §3.1 Permutations.
Chapter 2: Probability. Section 2.1: Basic Ideas Definition: An experiment is a process that results in an outcome that cannot be predicted in advance.
STROUD Worked examples and exercises are in the text Programme 29: Probability PROGRAMME 29 PROBABILITY.
7.2 Means & Variances of Random Variables AP Statistics.
1 Probability- Counting Techniques Dr. Jerrell T. Stracener, SAE Fellow EMIS 7370 STAT 5340 Probability and Statistics for Scientists and Engineers Leadership.
Copyright ©2004 The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4-1 Probability and Counting Rules CHAPTER 4.
Copyright © 2011 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill/Irwin Chapter 4 Probability.
Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 4-1 CHAPTER 4 Counting Techniques.
Review Day 2 May 4 th Probability Events are independent if the outcome of one event does not influence the outcome of any other event Events are.
Chapter 15 Random Variables.
Linear Algebra Review.
Chapter Two Probability
Math a - Sample Space - Events - Definition of Probabilities
Chapter 4 Probability.
Chapter 16 Random Variables.
Chapter 15 Random Variables.
Lecture Slides Elementary Statistics Twelfth Edition
Chapter 4 – Part 3.
Introduction Remember that probability is a number from 0 to 1 inclusive or a percent from 0% to 100% inclusive that indicates how likely an event is to.
How to Interpret Probability Mathematically, the probability that an event will occur is expressed as a number between 0 and 1. Notationally, the.
6. Multistage events and application of probability
Probability Notes Math 309.
Probability Notes Math 309.
Probability Notes Math 309 August 20.
Presentation transcript:

Quick review of some key ideas CEE 11 Spring 2002 Dr. Amelia Regan These notes draw liberally from the class text, Probability and Statistics for Engineering and the Sciences by Jay L. Devore, Duxbury 1995 (4th edition)

mean n The mean of a sample or data set is simply the arithmetic average of the values in the set, obtained by summing the values and dividing by the number of values. The mean of the sample of weights is pounds

mean of a frequency distribution n When we summarize a data set in a frequency distribution, we are approximating the data set by "rounding" each value in a given class to the class mark. The mean of the weight data obtained in this way is

shortcut formula for the variance n Its sometimes more convenient to use the following formula for the variance

properties of S 2 n Let x 1, x 2, x,...,x n be a sample and c be any nonzero constant. n If y 1 = x 1 + c, y 2 = x 2 + c,...,y n = x n + c, then S 2 y = S 2 x n If y 1 = cx 1, y 2 = cx 2,...,y n = cx n, then S 2 y = c 2 S 2 x, S y = |c|S 2 x In other words -- if we add a constant to a sample we do not increase the variance -- if we multiply by a constant we increase the variance by the square of the constant

related properties of the sample mean n Let x 1, x 2, x,...,x n be a sample and c be any nonzero constant. n If y 1 = x 1 + c, y 2 = x 2 + c,...,y n = x n + c then n If y 1 = cx 1, y 2 = cx 2,...,y n = cx n, then In other words if we add or multiply the sample by a constant we add or multiply the mean by the same constant

Class exercise (new) n Without using your calculators, calculate the mean and variance of the following data Xi | fi |43251 n Hint, shift the observations “to the left” by subtracting a constant and then divide by another constant

Class exercise (new) n Without using your calculators, calculate the mean and variance of the following data Step 1 yi | Step 2 yi | n Divide by 3, then subtract 9 yi | fi |43251

yi | (yi) 2 | fi |43251

conditional probability n For any two events A and B with P(B) > 0, the conditional probability of A given that B has occurred is defined by n The multiplication rule for P(A intersection B) follows directly

independence n Remember that in general n However, if A and B are independent then n In fact, A and B are independent if and only if the above is true

Counting Techniques n When the various outcomes of an experiment are equally likely then the task of computing probabilities reduces to counting. In particular, if N is the number of outcomes in the sample space and N(A) is the number of outcomes contained in an event A, then

Permutations n Any ordered sequence of k objects taken from a set of n distinct objects is called a permutation of size k of the objects. The number of permutations of size k that can be constructed from the n objects is denoted by P k,n n The number of permutations of size k that can be constructed from n objects is equal to n(n-1)(n-2)…(n- k+1)

combinations n Given a set of n distinct objects, any unordered subset of size k of the objects is called a combination. The number of combinations of size k that can be formed from n distinct objects is denoted by or sometimes by C k,n