Professional Documents
Culture Documents
MMW Reviewer
MMW Reviewer
Lesson 5.1: Statistics - Quick but rough, it's the difference between the
highest and lowest values.
Numerical information, termed data, is the focus of Example: Houston's range in temperature (103° -
statistics. Statistics encompasses collecting, 33°) is 70°.
organizing, analyzing, and interpreting data. It
divides into Descriptive Statistics, dealing with Standard Deviation
data presentation, and Inferential Statistics, - A more detailed measure, dependent on all data
drawing conclusions from data. items.
- Calculated by finding each data item's deviation
from the mean.
Populations and Samples
Computing the Standard Deviation
Population is the entire group for conclusions. 1. Find the mean of the data items.
Sample is a subset collected from the population. 2. Find the deviation of each data item from the
mean (data item - mean).
Random sampling ensures every population 3. Square each deviation.
member has an equal chance. 4. Sum the squared deviations.
5. Divide the sum by (n – 1) (number of data items).
Frequency Distributions 6. Take the square root of the quotient to get the
- After collecting data, statisticians use frequency standard deviation.
distributions.
- These distributions list data values and their Lesson 6: Simple Interest
frequencies.
- When you deposit or borrow money, interest is the
Measures of Central Tendency cost or compensation for the use of funds.
Principal - The amount deposited or borrowed.
Measures like mean, median, mode, and Interest Rate - Given as a percentage, representing
midrange represent average or typical values. the cost or earnings over a period.
Mean - is calculated by summing all data items and Simple Interest Formula: I = Prt
dividing by the number of items. - Where I is interest, Pis principal, r the interest rate,
and t is the time period.
Median - Arranging data from smallest to largest,
the median is the middle item (or mean of middle
items).
Measures of Dispersion
Lesson 8: Graphs
Equivalent Graphs
- Two graphs are equivalent if they have the same
vertex connections, regardless of vertex placement.