Download QUANTITATIVE-APTITUDE

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts
no text concepts found
Transcript
QUANTITATIVE APTITUDE
PERMUTATION AND COMBINATION
Permutation is used where arrangements of things is relevant for e.g. arrangement in a
queue, words, no’s, sitting arrangements etc. Permutation of n things taken 𝓇 at a time is π‘›π‘ƒπ‘Ÿ
𝑛
𝑛!
π‘ƒπ‘Ÿ = (π‘›βˆ’π‘Ÿ)!
𝑛
π‘ƒπ‘Ÿ has r factors.
For eg : 9𝑃3 has 3 factors i.e. 9𝑃3 = 9 × 8 × 7
10
𝑃2 has 2 factors i.e. 10𝑃2 = 10 × 9
Combination is used where selection is relevant for eg : Selection of a team, committee etc.
Combination of n things taken r at a time is π‘›πΆπ‘Ÿ
𝑛
𝑛
𝑛!
πΆπ‘Ÿ = π‘Ÿ !(π‘›βˆ’π‘Ÿ)! =
10
𝐢3 =
10
𝑃3
3!
=
π‘ƒπ‘Ÿ
π‘Ÿ!
10×9×8
3×2×1
Note : Fundamental Principles of counting
a. Multiplication Rule – [AND] – When things are within same arrangement and all things
are required then choices are multiplied.
b. Addition Rule – [OR] – When there are different arrangements and either of the
arrangement can work then choices are added.
Factorial
0! =1
1!=1
2!=2
3!=6
4 ! = 24
5 ! = 120
6 ! = 720
7 ! = 5040
8 ! = 40320
Note : 1) Factorial cannot be calculated for a –ve no.
2) Factorial cannot be calculated for a fractional no. Example – 7
Note : 1) Sum of all 4 digit no. which can be formed using a,b,c,d is (a+b+c+d) X 6666
2) Sum of all 3 digit no. which can be formed using a,b,c is (a+b+c) X 222
Circular Permutation
1) n things can be arranged in a line in n ! ways.
2) n things can be arranged in a circle in (n – 1) ! ways.
1
3) n persons can be arranged in a circle so that no person has same 2 neighbors in 2 (𝑛 βˆ’ 1)!
ways.
1
4) OR no, of necklaces that can be formed with n beads of different colors in2 (𝑛 βˆ’ 1)! ways.
Permutation with Restriction : In case of restriction in an arrangement first of all position
with restriction should be considered.
Note : 1) No. of ways in which n things can be arranged so that 2 particular things are never
together = total ways – ways in which 2 particular things are always together.
2) Above formula cannot be applied for more than 2 things.
Properties of Combination :
1) π‘›πΆπ‘œ = 𝑛𝐢𝑛 = 1
2) π‘›πΆπ‘Ÿ = π‘›πΆπ‘›βˆ’π‘Ÿ
3) π‘›πΆπ‘Ÿ = π‘›βˆ’1πΆπ‘Ÿβˆ’1 + π‘›βˆ’1πΆπ‘Ÿ
𝑛
πΆπ‘Ÿ (π‘‘π‘œπ‘‘π‘Žπ‘™ π‘€π‘Žπ‘¦π‘ ), π‘›βˆ’1πΆπ‘Ÿβˆ’1 (π‘œπ‘›π‘’ π‘π‘Žπ‘Ÿπ‘‘π‘–π‘π‘’π‘™π‘Žπ‘Ÿ π‘‘β„Žπ‘–π‘›π‘” 𝑖𝑠 𝑠𝑒𝑙𝑒𝑐𝑑𝑒𝑑), π‘›βˆ’1πΆπ‘Ÿ (π‘œπ‘›π‘’ π‘π‘Žπ‘Ÿπ‘‘π‘–π‘π‘’π‘™π‘Žπ‘Ÿ π‘‘β„Žπ‘–π‘›π‘” π‘›π‘œπ‘‘ 𝑠𝑒𝑙𝑒𝑐𝑑𝑒
Note : Permutation = Selection with arrangement
Combination = Selection without arrangement
Properties of Permutation
𝑛
π‘ƒπ‘Ÿ = π‘›βˆ’1π‘ƒπ‘Ÿ + π‘Ÿ. π‘›βˆ’1π‘ƒπ‘Ÿβˆ’1
SEQUENCE AND SERIES
Sequence – 1, 3, 5, 7, 9, . . . . . . .
2, 4, 8, 16, 32, . . . . . .
Series – 1 + 3 + 5 + 7 + 9 .. . . . . . .
2 + 4 + 8 + 16 + 32 . . . . . . . .
ARITHMETIC PROGRESSION (A.P.)
a, (a+d), (a+2d), (a+3d), . . . . . . . .
nth term of A.P.
𝑇𝑛 = π‘Ž + (𝑛 βˆ’ 1)𝑑
π‘€β„Žπ‘’π‘Ÿπ‘’ π‘Ž = 𝐼 π‘‘π‘’π‘Ÿπ‘š,
Sum of n terms
𝑛
𝑛
𝑆𝑛 = 2 [2π‘Ž + (𝑛 βˆ’ 1)𝑑] = 2 [π‘Ž + 𝑙]
𝑑 = π‘π‘œπ‘šπ‘šπ‘œπ‘› π‘‘π‘–π‘“π‘“π‘’π‘Ÿπ‘’π‘›π‘π‘’
Where 𝑙= 𝑇𝑛 = π‘Ž + (𝑛 βˆ’ 1)𝑑
Arithmetic Mean (A.M.)
A.M. between 2 no.s a & b is
π‘Ž+𝑏
2
and if n A.M. are inserted between 2 no.s a & b then a, A₁, Aβ‚‚, A₃, Aβ‚„. . . . . . . . 𝐴𝑛 , b are in
A.P.
Note : 1) In case of A.P., Tβ‚‚ - T₁ = T₃ - Tβ‚‚ = d
2) T₁ + Tβ‚… = 2T₃ or Tβ‚‚ + T₁₀ = 2T₆ and so on.
3) If 3 terms are in A.P., then terms are (a-d), a, (a+d)
4) If 4 terms are in A.P., then terms are (a-3d), (a-d), (a+d), (a+3d)
5) If 4 terms are in A.P., then terms are (a-2d), (a-d), a, (a+d), (a+2d)
Note : 1) Sum of first n natural no.s
1+2+3+4.........n=
𝑛(𝑛+1)
2
2) Sum of squares of first n natural no.s
1²+2²+3²+4² . . . . . . . . . . . n² =
𝑛(𝑛+1)(2𝑛+1)
6
3) Sum of cubes of first n natural no.s
1³+2³+3³+4³+ . . . . . . . . . . . n³= [
𝑛(𝑛+1)
2
]²
Note : When d= -ve, we get two answers for n. In such case, first value of n better
option.
GEOMETRIC PROGRESSION (G.P.)
π‘Ž, π‘Žπ›Ύ, π‘Žπ›Ύ 2 , π‘Žπ›Ύ 3 , … … … … …
nth term of G.P.
𝑇𝑛 = π‘Žπ‘Ÿ π‘›βˆ’1
Sum of n term of G.P.
𝑆𝑛 =
𝑆𝑛 =
π‘Ž(π‘Ÿ 𝑛 βˆ’1)
, 𝐼𝑓 π‘Ÿ > 1
π‘Ÿβˆ’1
π‘Ž(1βˆ’π‘Ÿ 𝑛 )
, 𝐼𝑓 π‘Ÿ < 1
1βˆ’π‘Ÿ
Sum of Infinity
π‘Ž
π‘†βˆž = 1βˆ’π‘Ÿ
, 𝐼𝑓 π‘Ÿ < 1
Geometric Mean (G.M.)
G.M. of 2 no.s a & b is βˆšπ‘Žπ‘
If n G.M. are inserted between a & b then a, G₁, Gβ‚‚, G₃, . . . . . . . . . . 𝐺𝑛 , b are in G.P.
𝑇
𝑇
Note : 1) In G.P. 𝑇2 = 𝑇3 = π‘Ÿ
1
2
2) T₁ + T₉ = (Tβ‚…)²
π‘Ž
3) 3 terms in a G.P. are π‘Ÿ , π‘Ž, π‘Žπ‘Ÿ
π‘Ž
π‘Ž
4) 4 terms in G.P. are π‘Ÿ 3 , π‘Ÿ , π‘Žπ‘Ÿ, π‘Žπ‘Ÿ 3
π‘Ž
π‘Ž
5) 5 terms in a G.P. are π‘Ÿ 2 , π‘Ÿ , π‘Žπ‘Ÿ, π‘Žπ‘Ÿ 2
Note : 1) For 2 equal no.s
A.M. = G.M. = H.M.
2) For 2 unequal no.s
A.M. > G.M. > H.M.
3) For 2 no.s
A.M. β‰₯ G.M. β‰₯ H.M
RATIO, PROPORTION, INDICES & LOGARITHMS
RATIO – 3 : 4 β‰  4 : 3
Ratio has no unit
π‘Ž
𝑏
1) Inverse Ratio of 𝑏 𝑖𝑠 π‘Ž
2) Compound Ratio of
π‘Ž
π‘Ž
𝑏
𝑐
𝑐
𝑖𝑠 𝑑 & 𝑑 𝑖𝑠
π‘Ž 2
3) Duplicate ratio of 𝑏 𝑖𝑠 (𝑏)
π‘Ž
𝑏
𝑐
×𝑑
π‘Ž 3
π‘Ž
4) Triplicate ratio of 𝑏 𝑖𝑠 (𝑏)
1
π‘Ž
π‘Ž 2
5) Sub duplicate ratio of 𝑏 𝑖𝑠 (𝑏)
1
6) Sub triplicate ratio of
π‘Ž
π‘Ž 3
𝑖𝑠
(
)
𝑏
𝑏
7) Continued ratio is ratio of more than 2 things, 2 : 3 : 4
8) Ratio of 2 integers is said to be commensurable and ratio of 2 non-integers is
incommensurable.
2
:. 3 is commensurable and
√2
√3
is incommensurable.
Proportion – An equality of 2 ratios is called proportion.
π‘Ž
𝑐
E.g. : 𝑏 = 𝑑 then a, b, c, d are proportionate
i.e. a : b = c : d or a : b : : c : d
Product of Extreme = Product of mean
π‘Ž×𝑑 =𝑏×𝑐
Mean proportion of 2 no.s a, b is βˆšπ‘Ž × π‘
Properties of Proportion :
π‘Ž
𝑐
1) 𝑏 = 𝑑 β‡’ π‘Ž × π‘‘ = 𝑏 × π‘
π‘Ž
𝑐
𝑏
𝑑
𝑐
π‘Ž
𝑐
𝑏
𝑐
𝑐
𝑑
π‘Ž+𝑏
𝑐+𝑑
𝑐
𝑏
π‘Žβˆ’π‘
π‘Ž
𝑐
𝑏
π‘Ž+𝑏
π‘Ž
𝑐
𝑒
2) 𝑏 = 𝑑 β‡’ π‘Ž =
π‘Ž
3) 𝑏 = 𝑑 β‡’
π‘Ž
4) 𝑏 = 𝑑 β‡’
π‘Ž
5) 𝑏 = 𝑑 β‡’
=
=
=
(πΌπ‘›π‘£π‘’π‘Ÿπ‘‘π‘’π‘›π‘‘π‘œ)
(π΄π‘™π‘‘π‘’π‘Ÿπ‘›π‘’π‘›π‘‘π‘œ)
𝑑
π‘βˆ’π‘‘
𝑑
𝑐+𝑑
6) 𝑏 = 𝑑 β‡’ π‘Žβˆ’π‘ = π‘βˆ’π‘‘
(πΆπ‘œπ‘šπ‘π‘œπ‘›π‘’π‘›π‘‘π‘œ)
(π·π‘–π‘£π‘–π‘‘π‘’π‘›π‘‘π‘œ)
(πΆπ‘œπ‘šπ‘π‘œπ‘›π‘’π‘›π‘‘π‘œ & π·π‘–π‘£π‘–π‘‘π‘’π‘›π‘‘π‘œ)
π‘Ž+𝑐+𝑒
(π΄π‘‘π‘‘π‘’π‘›π‘‘π‘œ)
7) 𝑏 = 𝑑 β‡’ 𝑓 … … … … …. … … = 𝑏+𝑑+𝑓
𝑏
π‘₯
Note : Third proportion of a X b is x such that π‘Ž = 𝑏
:. X =
𝑏2
π‘Ž
INDICES/INDEX
Laws :
1) π‘Žπ‘š × π‘Žπ‘› = π‘Žπ‘š+𝑛
2) π‘Žπ‘š ÷ π‘Žπ‘› = π‘Žπ‘šβˆ’π‘›
3) (π‘Žπ‘š )𝑛 = π‘Žπ‘š×𝑛
4) (π‘Ž × π‘)𝑛 = π‘Žπ‘› × π‘ 𝑛
5) π‘Ž° = 1
6) π‘Ž π‘₯ = 𝑏 𝑦 β‡’ π‘₯ = 𝑦
1
7) π‘Ž π‘₯ = 𝑏 β‡’ π‘Ž = 𝑏 π‘₯
LOGARITHM
1) Ifπ‘Ž π‘₯ = 𝑛, then log π‘Ž 𝑛 = π‘₯
log π‘₯
log 𝑒 π‘₯
{ 10
}
𝑒 = 2.7183
2) log π‘Ž π‘š × π‘› = log π‘Ž π‘š + log π‘Ž 𝑛
3) log π‘Ž
π‘š
𝑛
= log π‘Ž π‘š βˆ’ log π‘Ž 𝑛
4) log π‘Ž (π‘šπ‘› ) = 𝑛 log π‘Ž π‘š
5) log π‘Ž π‘Ž = 1
6) log π‘Ž 1 = 0
7) Base changing formula
log 𝑛 π‘š =
logπ‘Ž π‘š
logπ‘Ž 𝑛
common base means base = 10.
EQUATION
Quadratic Equation
π‘Žπ‘₯ 2 + 𝑏π‘₯ + 𝑐 = 0
π‘₯=
βˆ’π‘±βˆšπ‘ 2 βˆ’4π‘Žπ‘
2π‘Ž
= π‘…π‘œπ‘œπ‘‘π‘  π‘œπ‘“ π‘’π‘žπ‘’π‘Žπ‘‘π‘–π‘œπ‘›
8 Nature of Roots :
1) If 𝑏 2 βˆ’ 4π‘Žπ‘ < 0 π‘‘β„Žπ‘’π‘› π‘Ÿπ‘œπ‘œπ‘‘π‘  π‘Žπ‘Ÿπ‘’ π‘–π‘šπ‘Žπ‘”π‘–π‘›π‘Žπ‘Ÿπ‘¦ π‘œπ‘Ÿ π‘’π‘›π‘Ÿπ‘’π‘Žπ‘™.
2) If 𝑏 2 βˆ’ 4π‘Žπ‘ = 0 π‘‘β„Žπ‘’π‘› π‘Ÿπ‘œπ‘œπ‘‘π‘  π‘Žπ‘Ÿπ‘’ π‘Ÿπ‘’π‘Žπ‘™ π‘Žπ‘›π‘‘ π‘’π‘žπ‘’π‘Žπ‘™.
3) If 𝑏 2 βˆ’ 4π‘Žπ‘ > 0 π‘Žπ‘›π‘‘ π‘π‘’π‘Ÿπ‘“π‘’π‘π‘‘ π‘ π‘žπ‘’π‘Žπ‘Ÿπ‘’ π‘‘β„Žπ‘’π‘› π‘Ÿπ‘œπ‘œπ‘‘π‘  π‘Žπ‘Ÿπ‘’ π‘Ÿπ‘’π‘Žπ‘™, π‘’π‘›π‘’π‘žπ‘’π‘Žπ‘™ π‘Žπ‘›π‘‘ π‘Ÿπ‘Žπ‘‘π‘–π‘œπ‘›π‘Žπ‘™.
4) If 𝑏 2 βˆ’ 4π‘Žπ‘ > 0 π‘Žπ‘›π‘‘ π‘π‘’π‘Ÿπ‘“π‘’π‘π‘‘ π‘ π‘žπ‘’π‘Žπ‘Ÿπ‘’ π‘‘β„Žπ‘’π‘› π‘Ÿπ‘œπ‘œπ‘‘π‘  π‘Žπ‘Ÿπ‘’ π‘Ÿπ‘’π‘Žπ‘™, π‘’π‘›π‘’π‘žπ‘’π‘Žπ‘™ π‘Žπ‘›π‘‘ π‘–π‘Ÿπ‘Ÿπ‘Žπ‘‘π‘–π‘œπ‘›π‘Žπ‘™.
Note : Irrational roots occur in pairs π‘šβˆšπ‘› , π‘š βˆ’ βˆšπ‘›.
π‘Žπ‘₯ 2 + 𝑏π‘₯ + 𝑐 = 0
Sum of 2 roots =
βˆ’π‘
π‘Ž
𝑐
Products of 2 roots = π‘Ž
Quadratic Equation – Formation
π‘₯ 2 βˆ’ (π‘ π‘’π‘š π‘œπ‘“ π‘Ÿπ‘œπ‘œπ‘‘π‘ )π‘₯ + π‘ƒπ‘Ÿπ‘œπ‘‘π‘’π‘π‘‘ π‘œπ‘“ π‘Ÿπ‘œπ‘œπ‘‘π‘  = 0
Cubic Equation : In case of cubic equation, factors should be made if possible. If
factorization is not possible then only verification of answer should be preferred.
Co – ordinate Geometry
1. Distance between 2 points A (x, y) and B (π‘₯2 , 𝑦2 )
𝐴𝐡 = √(π‘₯2 βˆ’ π‘₯1 )2 + (𝑦2 βˆ’ 𝑦1 )2
2. Equation of straight line
y = mx + c , m = slope of line
𝑦 βˆ’π‘¦
𝑑𝑦
π‘š = π‘₯2 βˆ’π‘₯1 = 𝑑π‘₯
2
1
Note : 1) Slope of a parallel lines is same.
2) Product of slope of 2 βŠ₯ lines = -1
π‘š1 × π‘š2 = βˆ’1
3) Equation of line is (𝑦 βˆ’ 𝑦1 ) = π‘š(π‘₯ βˆ’ π‘₯1 )
4) Intercept form of Equation
π‘₯
𝑦
+
=1
π‘Ž
𝑏
Cost slope = Variable Cost per unit =
π·π‘–π‘“π‘“π‘’π‘Ÿπ‘’π‘›π‘π‘’ 𝑖𝑛 π‘π‘œπ‘ π‘‘
π·π‘–π‘“π‘“π‘’π‘Ÿπ‘’π‘›π‘π‘’ 𝑖𝑛 𝑒𝑛𝑖𝑑𝑠
Limits and Continuity
Some Important Limits
1) lim
𝑒 π‘₯ βˆ’1
π‘₯
π‘₯β†’0
=1
L – Hospital Rule
0
For 0 π‘“π‘’π‘›π‘π‘‘π‘–π‘œπ‘› π‘œπ‘Ÿ
∞
π‘“π‘’π‘›π‘π‘‘π‘–π‘œπ‘›π‘ 
∞
π·π‘’π‘Ÿπ‘–π‘Žπ‘£π‘Žπ‘‘π‘’ π‘œπ‘“ π‘π‘’π‘šπ‘’π‘Ÿπ‘Žπ‘‘π‘œπ‘Ÿ
Limit = π·π‘’π‘Ÿπ‘–π‘£π‘Žπ‘‘π‘–π‘£π‘’ π‘œπ‘“ π·π‘’π‘›π‘œπ‘šπ‘–π‘›π‘Žπ‘‘π‘œπ‘Ÿ
2) lim
π‘₯β†’0
3) lim
π‘₯β†’0
π‘Žπ‘₯ βˆ’1
= log π‘Ž
π‘₯
log(1+π‘₯)
π‘₯
=1
1
4) lim [1 + x] Λ£ = e
5) lim
6) lim
π‘₯β†’0
π‘₯β†’βˆž
π‘₯ 𝑛 βˆ’π‘Žπ‘›
= 𝑛 π‘Žπ‘›βˆ’1
π‘₯βˆ’π‘Ž
(1+π‘₯)βΏβˆ’1
π‘₯
=𝑛
Types of functions
1) Even function : If f(-x) = f(x)
2) Odd function : If f(-x) = -f(x)
3) Neither even nor odd : f(-x) β‰  f(x) β‰  -f(x)
Notes : A polynomial function is always continuous.
STATISTICAL DESCRIPTION OF DATA
Latin word β€œStatus”
Italian word β€œStastita”
German word β€œStastistik”
French word β€œStatistique”
Definitition of Statistics can be in plural sense or singular sense. When satistic is used as a
plural noun then it may be defined as data qualitative and quantitative.
When used as singular noun then it is defined as scientific method of drawing conclusions
about some important characteristic It means β€œScience of counting” or β€œScience of averages”.
Application of Statistics
1) Economics
2) Business management
3) Commerce and Industry
4) Health care
Limitations of Statistics :
1) It deals with Aggregates (Total)
2) Statistics is concerned with quantitative data.
3) Future projections are valid under specific set of conditions.
4) Theory of Statistics is based on Random Sampling
COLLECTION OF DATA
DATA: is quantitative information about particular characteristic.
VARIABLE : A quantitative characteristic is called variable.
ATTRIBUTE : A qualitative characteristic is called Attribute.
For e.g. : gender, nationality, color etc.
VARIABLES are of 2 types :
A) DISCRETE VARIABLE : When a variable can assume finite no, of isolated valued then
it is discrete. E.g. : Petals in a flower no. of road accidents, marks in paper etc.
B) CONTINUOUS VARIABLE : When a variable can assume any value from a given
interval. E.g. : Weight, height, sale etc.
DATA can be of 2 types :
A) PRIMARY DATA – when data is collected by the person using the data.
B) SECONDARY DATA – When data is used by the person other than collecting the data
sources of secondary data are :
1) International sources – WHO (World Health Organisation)
ILO (International Labour Organisation)
IMF (International Monetary Fund), World
Bank, etc.
2) Govt. sources – CSO (Central Statistical Organisation), ministers,
etc.
3) Private and Quasi Govt. organisation – RBI, NCERT
4) Research Institute and Researcher
Collection of Primary Data : There are 4 methods of collection of primary data.
a) Interview Method
1) Personal Interview – Natural calamities
2) Indirect Interview – Accidents
3) Telephonic Interview – Maximum non response
b) Mailed Questionnaire – Maximum non response
– Widest coverage
c) Observation Method – Time consuming, expensive and applicable only for small
population.
d) Questionnaire filled by enumerator
NOTE: Scrutiny of data means checking data for any possible error. Two or more series of
figures which are related to each other can be compared for internal consistency.
PRESENTATION OF DATA
CLASSIFICATION OF DATA
a) Chronological or Temporal or Time series data
b) Geographical or spatial data.
c) Qualitative or ordinal
d) Quantitative or cardinal
MODE OF PRESENTATION
a) Textual presentation – Least preferred because it is monotonous.
b) Tabular presentation – (Page – 10.7)
1) Table has a serial no,
2) Table can be divided into 4 parts
β†’ Caption – is upper part of table describing columns and sub columns.
β†’ Boxhead – is entire upper part including column and sub column numbers, units of
measurement alongwith caption.
β†’ Stub – is left part of table
β†’ Body – is main part of table.
Example :
Status
Member of TU
M
F
T
Status of workers
Caption
Non members
M
F
T
Total
M
F
T
Body
Source
Footnote
C) Diagrammatic representation of Data
1) Line Diagram or Historiagram – Line diagrams are used when data vary over time.
Logarithmic or ratio chart is used where there is wide fluctuation. Multiple line chart is used
for 2 or more related time series with same units. Multiple axis line chart are used for 2 or
more series with different units.
2) Bar Diagram –
Horizontal Bar diagram – used for qualitative data or data varing over space
(Geographical)
β†’ Vertical Bar diagram – used for quantitative data or data varing over time.
β†’ Multiple or group Bar diagram – used to compare related series.
β†’ Component or subdivided Bar diagram (Percentage)
3) Pie Chart
FREQUENCY DISTRIBUTION
a) Discrete or ungrouped frequency distribution (Simple) – This is used for discrete variable
E.g. :
Marks
No. of students (f)
5
20
6
30
7
50
8
10
9
15
10
20
B) Grouped frequency Distribution – used for continuous variables.
E.g. :1)
Marks / Weight
f
0 – 10
10
10 – 20
5
Mutually exclusive classification – used
for
20 – 30
15
continuous variable
30 – 40
20
50
2)
Marks / Weight
0–9
f
10
10 – 19
5
Mutually inclusive classification – used
20 – 29
30 – 39
15
20
discrete variable
for
CLASS LIMIT – Lower Class limit (LCL), Upper Class Limit (UCL)
LCL
UCL
LCB
UCB
10 – 20
10
20
10
20
20 – 30
20
30
20
30
LCL =
LCB
30 – 40
30
40
30
40
UCL =
UCB
CLASS BOUNDARIES are real class limits
Lower class boundary (LCB), Upper class boundary (UCB)
LCL
UCL
LCB
UCB
10 – 19
10
19
9.5
19.5
20 – 29
20
29
19.5
29.5
LCL β‰ 
LCB
30 – 39
30
39
29.5
39.5
UCL β‰ 
UCB
Note : 29.5 – 39.5 includes 29.5 but excludes 39.5
CLASS MARK
10
10 βˆ’ 20
15
10} Class width/ Interval
20 βˆ’ 30
25} πΆπ‘™π‘Žπ‘ π‘  π‘šπ‘Žπ‘Ÿπ‘˜
10
30 βˆ’ 40
35
Class Mark
Class width / Interval
10 – 19
14.5
9.5 – 19.5
10
20 – 29
24.5
19.5 – 29.5
10
30 – 39
34.5
29.5 – 39.5
10
CLASS WIDTH = CLASS SIZE = CLASS INTERVAL
Class
Cumulative
Frequency
frequency
interval
frequency
density
10 – 20
8
10
8
20 – 30
12
10
20
30 – 40
20
10
40
8
10
12
10
20
10
= .8
= 1.2
=2
πΉπ‘Ÿπ‘’π‘žπ‘’π‘’π‘›π‘π‘¦
* FREQUENCY DENSITY = πΆπ‘™π‘Žπ‘ π‘  πΌπ‘›π‘‘π‘’π‘Ÿπ‘£π‘Žπ‘™
πΉπ‘Ÿπ‘’π‘žπ‘’π‘’π‘›π‘π‘¦
* RELATIVE FREQUENCY = π‘‡π‘œπ‘‘π‘Žπ‘™ π‘“π‘Ÿπ‘’π‘žπ‘’π‘’π‘›π‘π‘¦
πΉπ‘Ÿπ‘’π‘žπ‘’π‘’π‘›π‘π‘¦
* PERCENTAGE FREQUENCY = π‘‡π‘œπ‘‘π‘Žπ‘™ π‘“π‘Ÿπ‘’π‘žπ‘’π‘’π‘›π‘π‘¦ × 100
Relative
frequency
8
Percentage
frequency
8
40
12
40
12
40
20
40
20
40
40
× 100
× 100
× 100
GRAPHICAL REPRESENTATION OF FREQUENCY DISTRIBUTION
1) Histogram
Mode – Most frequently occurring item.
2) Frequency polygon – is used for simple frequency distribution. It can be used for grouped
frequency distribution provided width of class interval is same.
Note : Frequency curve is limiting form of frequency polygon
3) Cumulative frequency curve or ogive (Two types)
Less than ogive can be used to calculate median, quartile deciles etc.
Frequency curve – It is limiting form of frequency polygon or histogram for which total area
is 1.
a) Bell shaped – Most common
b) U – shaped
MEASURE OF CENTRAL TENDENCY AND DISPERSION
CENTRAL TENDENCIES
ARITHMETIC MEAN (A.M.) =
βˆ‘π‘“π‘₯
βˆ‘π‘“
π‘œπ‘Ÿ 𝐴 +
βˆ‘π‘“π‘‘π‘₯
βˆ‘π‘“
Note : For calculation of A.M., mutually inclusive series need not be converted into
mutually exclusive series.
Properties of Arithmetic Mean :
1) A.M. is neither free of origin (affected by addition or subtraction of a constant) Nor free of
scale (multiplication and division of a constant).
2) Combined A.M. =
𝑛1 Μ…Μ…Μ…
𝑋₁+𝑛2 Μ…Μ…Μ…
𝑋₂
𝑛1 +𝑛2
GEOMETRY MEAN (G.M.)
G.M. = (π‘₯1 × π‘₯2 … … … … … … … . π‘₯4 )1/4
log 𝐺. 𝑀. = log(π‘₯1 × π‘₯2 … … … … … … … . π‘₯𝑛 )1/𝑛
1
log 𝐺. 𝑀. = 𝑛 βˆ‘ log π‘₯𝑛
1
G.M. = A.L.[𝑛 βˆ‘ log π‘₯𝑛 ]
Properties of G.M.
1) If all the observations are k then G.M. = k
2) If z = xy then G.M. of z = (𝐺. 𝑀. π‘œπ‘“ π‘₯) × (𝐺. 𝑀. π‘œπ‘“ 𝑦)
π‘₯
𝐺.𝑀.π‘œπ‘“ π‘₯
3) If z = 𝑦 π‘‘β„Žπ‘’π‘› 𝐺. 𝑀. π‘œπ‘“ 𝑧 = 𝐺.𝑀.π‘œπ‘“ 𝑦
HARMONIC MEAN (H.M.) =
βˆ‘π‘“
𝑓
π‘₯
βˆ‘( )
Combined H.M. of two series =
𝑛₁+𝑛₂
𝑛₁ 𝑛₂
+
𝐻₁ 𝐻₂
E.g.: H.M. of 4, 6, 10
H.M. = 1
3
1 1
4 6 10
E.g. : x
f
+ +
= 5.77
2
3
H.M = 3
4
2
6
5
10
2 5
+ +
2 4 6
E.g. :
Distance (f)
Speed (x)
100 km
60km/h
Average of Speed =
200km
80km/h
100+200
100 200
+
60 80
Note : For average of speed, H.M. is used
E.g.: Home β†’ College – 40 km/h
College β†’ Home – 30 km/h
Average speed =
2
1
1
+
30 40
Relationship between A.M., G.M., H.M.- A.M. β‰₯ G.M. β‰₯ H.M.
a) For unequal no. A.M. > G.M. > H.M.
b) For equal no. A.M. = G.M. = H.M.
* For 2 numbers : (G.M.)² = A.M. x H.M.
* G.M. cannot be calculated for negative items.
* G.M. is used where compound growth is there.
* A.M. is most popular central tendency.
WEIGHTED MEAN =
βˆ‘π‘€π‘₯
βˆ‘π‘€
𝑖𝑠 𝑒𝑠𝑒𝑑 π‘€β„Žπ‘’π‘Ÿπ‘’ π‘‘π‘–π‘“π‘“π‘’π‘Ÿπ‘’π‘›π‘‘ π‘–π‘‘π‘’π‘šπ‘  π‘Žπ‘Ÿπ‘’ π‘œπ‘“ π‘‘π‘–π‘“π‘“π‘’π‘Ÿπ‘’π‘›π‘‘ π‘–π‘šπ‘π‘œπ‘Ÿπ‘‘π‘Žπ‘›π‘π‘’.
E.g. :
food
Rent
Education
x
10
20
30
340
Weighted Average =
20
w
10
6
4
20
xw
100
120
120
340
= 17
MEDIAN – If all the items are arranged in increasing order then middle item is median.
𝑁+1 π‘‘β„Ž
Median ( in case of discrete items) = (
Median (for grouped items) = L₁ +(
) π‘–π‘‘π‘’π‘š
2
𝑁
βˆ’π‘β‚
2
𝑓
)×𝑐
Where L₁ = lower limit of median class
N = Total items
N₁ = Cumulative frequency of preceeding class
f = frequency of median class
c = class interval
E.g. :
f
c.f.
10 – 19
10
10
20 – 29
15
25
30 – 39
25
50 – Median class
40 – 49
20
70
70
2
( βˆ’25)×10
Median = 29.5 +
25
QUARTILE – Divide total items in 4 parts – Q₁ and Q₃
𝑁+1
𝑁+1
4
4
𝑄1 = (
) π‘–π‘‘π‘’π‘š, 𝑄3 = (
) × 3π‘‘β„Ž π‘–π‘‘π‘’π‘š
𝑁+1
DECILE (10 parts) – 𝐷𝑇 = (
10
) π‘‡π‘‘β„Ž π‘–π‘‘π‘’π‘š
PERCENTILE (100 parts)
MODE is most frequently occurring item.
For grouped data, Mode = L₁ + (2𝐹
𝐹𝑀 βˆ’πΉπ‘ƒ
𝑀 βˆ’πΉπ‘ƒ βˆ’πΉπ‘†
)×𝑐
Where L₁ = lower limit of modal class
𝐹𝑀 = frequency of modal class
𝐹𝑃 = frequency of preceeding class
𝐹𝑆 = frequency of succeeding class
c = class interval
Note : For moderately skewed data
Mode = 3Median – 2Mean
Note : All central tendencies are neither free of origin nor free of scale
MEASURE OF DISPERSION
↙
β†˜
Absolute measure
Relative measure
1) Range
1) Coefficient of range
2) Mean Deviation
2) Coefficient of mean deviation
3) Standard Deviation
3) Coefficient of variation
4) Quartile deviation
4) Quartile deviation (Coefficient)
Note : All measures of dispersion are free of origin but not free of scale.
RANGE = L – S
L = Largest
S= Smallest
πΏβˆ’π‘†
β†’ Coefficient of Range = [𝐿+𝑆] × 100
MEAN DEVIATION about mean =
β†’ Coefficient of mean deviation +
Μ…|
βˆ‘|Xβˆ’X
0π‘Ÿ
Μ…|
βˆ‘ 𝑓|Xβˆ’X
𝑛
π‘€π‘’π‘Žπ‘› π‘‘π‘’π‘£π‘Žπ‘‘π‘–π‘œπ‘›
π‘€π‘’π‘Žπ‘›
βˆ‘π‘“
× 100
βˆ‘(π‘₯βˆ’π‘‹Μ… )2
STANDARD DEVIATION (𝜎)S.D. = √
𝑛
𝑆.𝐷.
β†’ Coefficient of variation =π‘€π‘’π‘Žπ‘› × 100
π‘Žβˆ’π‘
S.D. of 2 numbers a and b = |
2
|
S.D. of first n natural numbers = √
βˆ‘ π‘₯2
= √
𝑛
βˆ‘π‘₯
βˆ’ ( 𝑛 )²
π‘‰π‘Žπ‘Ÿπ‘–π‘Žπ‘›π‘π‘’ = (𝑆. 𝐷. )²
∢. 𝑆. 𝐷. 𝑖𝑠 π‘›π‘’π‘£π‘’π‘Ÿ βˆ’ 𝑣𝑒
𝑛2 βˆ’ 1
12
Combined S.D. of 2 groups
𝑛1 𝑠1 2 +𝑛2 𝑠2 2 +𝑛1 𝑑1 2 +𝑛2 𝑑2 2
√
𝑛1 +𝑛2
d₁ = 𝑋̅1 βˆ’ 𝑋̅12
dβ‚‚ = 𝑋̅2 βˆ’ 𝑋̅12
𝑋̅1= mean of first group
𝑋̅2= mean of second group
𝑋̅12= combined mean
𝑋̅12 =
𝑛1𝑋
Μ… 1 + 𝑛2 𝑋
Μ…2
𝑛1 +𝑛2
QUARTILE DEVIATION =
𝑄3 βˆ’π‘„1
2
𝑄 βˆ’π‘„
β†’ Coefficient of quartile deviation = [𝑄3+𝑄1] × 100
3
1
Note : Range is not free of units (Rs., Kg)
Note : Measure of dispersion is free of origin but not free of scale.
1
Note : S.D. is 2of range of two numbers.
CORRELATION AND REGRESSION
Correlation and Regression
↓
↓
Extent of Relationship
Prediction
↓
-1 to 1
1) MARGINAL DISTRIBUTION – There are two marginal distribution
Marks in Maths (f)
Marks in Stats (f)
0 – 10
7
8
10 – 20
19
24
20 – 30
32
26
2) CONDITIONAL DISTRIBUTION – There are m + n conditional distribution where m
is no. of rows and n is no. of columns.
Marks in Maths [If marks in stats is 10 – 20]
f
0 – 10
2
10 – 20
7
20 – 30
15
Note : No. of cells = m X n
CORRELATION – Correlation analysis is establishing relation between two variable
(positive, negative or zero) and measuring the extent of relationship between two variables (1 to 1).
Correlation can be measured by four methods :
a) Scatter Diagram
b) Karl Pearson’s product moment correlation coefficient.
c) Spearman’s rank correlation coefficient.
d) Coefficient of concurrent deviations.
Scatter Diagram : can be used for linear as well as curvilinear variables. Exact measure of
correlation cannot be measured by this method.
KARL PEARSON’S PRODUCT MOMENT COEFFICIENT OF CORRELATION is
the best method for finding correlation between two variable having linear relationship.
𝛾π‘₯𝑦 =
πΆπ‘œπ‘£π‘Žπ‘Ÿπ‘–π‘Žπ‘›π‘π‘’ π‘œπ‘“ π‘₯ π‘Žπ‘›π‘‘ 𝑦
𝑆.𝐷.π‘₯ ×𝑆.𝐷.𝑦
Where Covariance =
βˆ‘ π‘₯𝑦
= 𝑛𝑆.𝐷.π‘₯ ×𝑆.𝐷.𝑦
βˆ‘(π‘₯βˆ’π‘₯Μ… )(π‘¦βˆ’π‘¦Μ…)
𝑛
=
βˆ‘ π‘₯𝑦
𝑛
β†’{
π‘₯ = (π‘₯ βˆ’ π‘₯Μ… )
}
𝑦 = (𝑦 βˆ’ 𝑦̅)
Or
𝛾=
𝑁 βˆ‘ π‘‹π‘Œβˆ’βˆ‘ 𝑋 βˆ‘ π‘Œ
βˆšπ‘› βˆ‘ π‘₯ 2 βˆ’(βˆ‘ π‘₯)2 βˆšπ‘› βˆ‘ 𝑦 2 βˆ’(βˆ‘ 𝑦)2
Note : Coefficient of correlation is free of origin as well as free of scale.
Note : r is free of unit.
SPEARMAN’S RANK CORRELATION : Rank correlation is used to study relationship
between Qualitative variables.
𝛾 =1βˆ’
1
βˆ‘(𝑑 3 βˆ’π‘‘)]
12
𝑛3 βˆ’π‘›
6[βˆ‘ 𝐷 2 +
Where D = Difference of Ranks
t = no. of tied ranks
COEFFICIENT OF CONCURRENT DEVIATION
𝛾 = ±βˆš±
(2π‘βˆ’π‘š)
π‘š
where m = no. of pairs of deviations
c = No. of +ve signs = No. of concurrent deviations
REGRESSION ANALYSIS – There are two regression lines. Regression is concerned
with predicting dependent variable when independent variable is known. In simple,
Regression model, if y depends on x then line y on x is given by
y = a + bx
↓
↓
dependent
Independent
Regression line Y on X
𝑦 βˆ’ 𝑦̅ = 𝑏𝑦π‘₯ (𝑋 βˆ’ 𝑋̅)
where 𝑏𝑦π‘₯ Regression coefficient of y on x.
𝑆𝐷𝑦
𝑏𝑦π‘₯ = 𝛾 × π‘†π·π‘₯ =
𝑁 βˆ‘ π‘‹π‘Œβˆ’βˆ‘ 𝑋 βˆ‘ π‘Œ
𝑛 βˆ‘ π‘₯ 2 βˆ’(βˆ‘ π‘₯ 2 )
Regression line X on Y
𝑋 βˆ’ 𝑋̅ = 𝑏π‘₯𝑦 (π‘Œ βˆ’ π‘ŒΜ…)
𝑆𝐷π‘₯
𝑏π‘₯𝑦 = 𝛾 × π‘†π·π‘¦ =
𝑁 βˆ‘ π‘‹π‘Œβˆ’βˆ‘ 𝑋 βˆ‘ π‘Œ
𝑛 βˆ‘ 𝑦 2 βˆ’(βˆ‘ 𝑦 2 )
Properties of Regression
1) 𝑏π‘₯𝑦 , 𝑏𝑦π‘₯ π‘Žπ‘›π‘‘ 𝛾 β„Žπ‘Žπ‘£π‘’ π‘ π‘Žπ‘šπ‘’ 𝑠𝑖𝑔𝑛.
2) 𝛾 = ±βˆšπ‘π‘₯𝑦 × π‘π‘¦π‘₯
3) 𝑏π‘₯𝑦 π‘Žπ‘›π‘‘ 𝑏𝑦π‘₯ π‘Žπ‘Ÿπ‘’ π‘“π‘Ÿπ‘’π‘’ π‘œπ‘“ π‘œπ‘Ÿπ‘–π‘”π‘–π‘› 𝑏𝑒𝑑 π‘›π‘œπ‘‘ π‘“π‘Ÿπ‘’π‘’ π‘œπ‘“ π‘ π‘π‘Žπ‘™π‘’.
4) Arithmetic mean of x and y are solution of two regression equations.
5) Because βˆšπ‘π‘₯𝑦 × π‘π‘¦π‘₯ = 𝛾,
∢. 𝑏π‘₯𝑦 × π‘π‘¦π‘₯ ≀ 1
PROBABILITY AND EXPECTED VALUE
Probability can be divided into two categories :
a) Subjective Probability
b) Objective Probability
Random Experiment – Experiment means performance of an Act. Random means that
Probability of all outcomes is equal.
Event – is result of and experiment
a) Simple or Elementary events
b) Composite or Compound events
An event is simple if it cannot be decomposed into further event.
Compound event are made of two or more simple event,
MUTUALLY EXCLUSIVE EVENTS – When happening of an event makes happening of
another event impossible then two events are mutually exclusive.
EXHAUSTIVE EVENTS : are set of all possible events i.e. events have to be from set of
Exhaustive events. Sum of probability of Exhaustive events is always equal to 1.
EQUALLY LIKELY or Equi Probable – Events having same probability.
CLASSICAL DEFINITION OF PROBABILITY
π‘π‘œ.π‘œπ‘“ πΉπ‘Žπ‘£π‘œπ‘’π‘Ÿπ‘Žπ‘π‘™π‘’ 𝐸𝑣𝑒𝑛𝑑𝑠
P (A) = π‘‡π‘œπ‘‘π‘Žπ‘™ π‘›π‘œ.π‘œπ‘“ π‘’π‘žπ‘’π‘Žπ‘™π‘™π‘¦ π‘™π‘–π‘˜π‘’π‘™π‘¦ 𝑒𝑣𝑒𝑛𝑑𝑠
Note : 1) It is applicable when total no. of events is finite.
2) It can be used only when events are equally likely.
3) Above definition is also termed as β€œa priori” and is useful only in coin tossing,
dice throwing etc.
Note : E.g. : In one coin
H
T
1
1
2
2
In two coins
0H
1H
2H
1
1
1
4
2
4
In three coins
0H
1H
2H
1
3
3
1
8
8
8
8
Sum of no. on two dice
2
3
4
5
3H
6
7
8
9
10
11
1
2
3
4
5
6
5
4
3
2
12
1
36
36
36
36
36
36
36
36
36
36
36
STATISTICAL DEFINITION OF PROBABILITY
If a random experiment is repeated a very good no. of times say n under identical conditions
and an event occurs 𝐹𝐴 times then ratio of 𝐹𝐴 and n when n tends to infinity is defined as
statistical definition of probability.
P=
𝐹𝐴
𝑛
π‘€β„Žπ‘’π‘Ÿπ‘’ 𝑛 β†’ ∞
1) 𝑃(𝐴 βˆͺ 𝐡) = 𝑃(𝐴 π‘œπ‘Ÿ 𝐡) = 𝑃 (𝐴) + 𝑃(𝐡) βˆ’ 𝑃(𝐴 ∩ 𝐡)
2) 𝑃(𝐴 ∩ 𝐡) = 𝑃 (𝐴 π‘Žπ‘›π‘‘ 𝐡)
For Independent events
𝑃(𝐴 ∩ 𝐡) = 𝑃(𝐴) × π‘ƒ(𝐡⁄𝐴) = 𝑃(𝐡) × π‘ƒ(𝐴⁄𝐡 )
𝑃(𝐡⁄𝐴) = π‘ƒπ‘Ÿπ‘œπ‘π‘Žπ‘π‘–π‘™π‘–π‘‘π‘¦ π‘œπ‘“ 𝐡 π‘ π‘’π‘β„Ž π‘‘β„Žπ‘Žπ‘‘ 𝑒𝑣𝑒𝑛𝑑 𝐴 β„Žπ‘Žπ‘  π‘‘π‘Žπ‘˜π‘’π‘› π‘π‘™π‘Žπ‘π‘’
3) 𝑃(𝐴 βˆͺ 𝐡 βˆͺ 𝐢) = 𝑃(𝐴) + 𝑃(𝐡) + 𝑃(𝐢) βˆ’ 𝑃(𝐴 ∩ 𝐡) βˆ’ 𝑃(𝐴 ∩ 𝐢) βˆ’ 𝑃(𝐡 ∩ 𝐢) +
𝑃(𝐴 ∩ 𝐡 ∩ 𝐢)
4) 𝑃(𝐴 ∩ 𝐡1 ) = 𝑃(𝐴 π‘Žπ‘›π‘‘ π‘›π‘œπ‘‘ 𝐡) = 𝑃(𝐴) βˆ’ 𝑃(𝐴 ∩ 𝐡)
𝑃(𝐴) = 𝑃(𝐴 ∩ 𝐡) + 𝑃(𝐴 ∩ 𝐡1 )
5) 𝑃(𝐴1 ∩ 𝐡1 ) = 1 βˆ’ 𝑃(𝐴 βˆͺ 𝐡)
* Only A + only B + A or B + A¹ and B¹ = 1
6) P (A¹) = 1 – P(A)
Mutually exclusive events – 𝑃(𝐴 ∩ 𝐡) = 0
Exhaustive – 𝑃(𝐴) + 𝑃(𝐡) + 𝑃(𝐢) = 1
Equally/likely – 𝑃(𝐴) = 𝑃(𝐡) = 𝑃(𝐢)
𝑃(𝐡⁄𝐴) =
𝑃(𝐴⁄𝐡 ) =
𝑃(𝐴∩𝐡)
𝑃(𝐴)
}
𝑃(𝐴∩𝐡)
Conditional Probability
𝑃(𝐡)
EXPECTED VALUE is sum of product of different values and its probability.
πœ€(π‘₯) = πœ€π‘₯ × π‘(π‘₯) = π‘šπ‘’π‘Žπ‘›
πœ€(π‘₯ 2 ) = πœ€π‘₯ 2 × π‘(π‘₯)
Variance = (S.D.)² = πœ€(π‘₯ 2 ) βˆ’ [πœ€(π‘₯)]2
= πœ–(𝑋 βˆ’ 𝑋̅)2
Properties of Expected value :
1) πœ–(π‘₯ + 𝑦) = πœ–(π‘₯) + πœ–(𝑦)
2) πœ–(π‘˜. π‘₯) = π‘˜πœ–(π‘₯) π‘€β„Žπ‘’π‘Ÿπ‘’ π‘˜ 𝑖𝑠 π‘Ž π‘π‘œπ‘›π‘ π‘‘π‘Žπ‘›π‘‘
3) πœ–(π‘₯. 𝑦) = πœ–(π‘₯). πœ–(𝑦)π‘€β„Žπ‘’π‘›π‘’π‘£π‘’π‘Ÿ π‘₯ π‘Žπ‘›π‘‘ 𝑦 π‘Žπ‘Ÿπ‘’ 𝑖𝑛𝑑𝑒𝑝𝑒𝑛𝑑𝑒𝑛𝑑
Mean = πœ‡ = π‘₯Μ… = πœ€(π‘₯) = βˆ‘ π‘₯ 𝑃(π‘₯)
βˆ‘(π‘₯βˆ’π‘₯Μ… )2
S.D. = √
𝑛
βˆ‘ π‘₯2
or √
𝑛
βˆ‘π‘₯
2
βˆ’( 𝑛 )
βˆ‘ 𝑃(π‘₯) = 1
V = πœ–(π‘₯ βˆ’ π‘₯Μ… )2 = βˆ‘(π‘₯ βˆ’ π‘₯Μ… )2 × π‘ƒ(π‘₯)
V = πœ–(π‘₯ 2 ) βˆ’ [πœ–(π‘₯)]2 = βˆ‘ π‘₯ 2 𝑃(π‘₯) βˆ’ [βˆ‘ π‘₯ 𝑃(π‘₯)]2
THEORETICAL DISTRIBUTION
Theoretical Distribution exists only in theory. It is theoretical probability distribution of
experiments.
BINOMIAL DISTRIBUTION : Features are
1) There are 2 possible outcomes.
2) Trials are independent.
3) n is small
4) It is Biparametric Distribution (n, p)
5) Probability of 𝛾 successes out of n trials is
𝑃(𝛾) = 𝑛𝐢𝛾 . 𝑃𝛾 . π‘ž π‘›βˆ’π›Ύ
6) Mean = np, variance = npq
7) It can be unimodal or bimodal
Mode = Largest integer in (n+1) P if (n+1) p is a non integer.
= (n+1) P and (n+1)p – 1 if (n+1)p is integer.
𝑛
8) Variance is maximum when p = q = .5 Maximum variance = 4
Additive Property
If x and y are two independent variables such that
𝑋~𝐡(𝑛1 , 𝑝)
π‘Œ~𝐡(𝑛2 , 𝑝)
X + Y ~𝐡(𝑛1 + 𝑛2 , 𝑝)
* {p = success ,
q = failure}
POISION DISTRIBUTION : Properties
1) Probability of success in very small time interval (t, t+ dt) is kt where k is constant.
2) Probability of success is independent.
3) Probability of success in this time interval is very small.
4) This distribution is called distribution of rare events.
5) n is large and p is very small such that n X p is finite.
6) Mean = Variance = n X p = m
7) It is uniparametric distribution (m).
8) There are two possible outcomes.
9) Probability of r success out of n
𝑃(π‘Ÿ) =
𝑒 βˆ’π‘š .π‘šπ‘Ÿ
π‘Ÿ!
10) Mode is largest integer in m if m is non integer
Mode is m and m – 1 if m is an integer.
Additive Property :
If x and y are two independent poisson variables and
z=x+y
x ~𝑃(π‘š1 )
y ~𝑃(π‘š2 )
z = x + y~𝑃(π‘š1 + π‘š2 )
NORMAL OR GAUSSIAN DISTRIBUTION
P(x) = f(x) = Probability density function
f(x) =𝜎
1
√2πœ‹
×𝑒
βˆ’(π‘₯βˆ’π‘š)²
2𝜎²
m = mean
𝜎 = S.D.
Properties of Normal Distribution
1) Mean = median = mode
2) Mean deviation = .8 S.D.
3) First Quartile = Q₁ = Mean – .675 S.D.
Third Quartile = Q₃ = Mean + .675 S.D.
4) Point of inflexion are
a) Mean – S.D.
b) Mean + S.D.
5) In standard normal variate, Mean = 0 , S.D. = 1
6) Area under normal curve
π‘‹βˆ’π‘‹Μ…
z =|
𝑆.𝐷.
|
CHI-SQUARE DISTRIBUTION (X²-DISTRIBUTION)
Properties :
1) It is continuous, positively skewed probability distribution.
2) Mean = n
3) S.D. = √2𝑛
4) When n is large it follows normal distribution.
STUDENTS T – DISTRIBUTION
1) It is a continuous symmetrical distribution.
2) Mean = 0
𝑛
3) S.D. = βˆšπ‘›βˆ’2
𝑖𝑓 𝑛 > 2
4) For large n (n>30) t distribution is identical to z distribution.
F Distribution
1) F Distribution is positively skewed.
2) It is continuous.
Note :
z
Area under the normal curve
1
.6826
1.64
.90 (90%)
1.96
.95 (95%)
2.33
.98 (98%)
2.58
.99 (99%)
3
.9973 (99.73%)
SAMPLING
BASIC PRINCIPLES OF SAMPLE SURVEY :
1) Law of Statistical regularity : States a large sample drawn at random from population
possesses characteristics of population at an average.
2) Principle of inertia : States that results drawn from samples are likely to be more reliable,
accurate and precise as sample size increases, other things remaining same.
3) Principle of Optimization : means maximum efficiency at given cost or minimum cost for
optimum level of efficiency.
4) Principle of Validity : States that sampling designs is valid only if it is possible to obtain
valid results.
Probabilistic sampling ensures this validity.
COMPARISON BETWEEN SAMPLE AND COMPLETE ENUMERATION (CENSUS)
1) Speed 2) Cost 3) Reliability 4) Accuracy 5) Necessity
ERRORS IN SAMPLING :
1) Sampling errors
a) Errors due to defective sampling design.
b) Errors arising out due to substitution.
c) Errors due to faulty demarcation.
d) Errors due to wrong choice of statistic.
e) Variability in the population.
2) Non-Sampling Errors : Memory lapse, preference for certain digits, ignorance, psychological
factors like vanity, non-response etc.
SAMPLING DISTRIBUTION AND STANDARD ERROR OF A STATISTIC
Standard Error (SE) is standard deviation of sample statistic.
𝜎
1) SE of means = SE (π‘₯Μ… ) = 𝑛(with replacements)
√
where 𝜎= population S.D.
2) SE (π‘₯Μ… )(π‘Šπ‘‚π‘…) =
3) SE (π‘₯Μ… ) =
4) SE (π‘₯Μ… ) =
𝑠
βˆšπ‘›βˆ’1
√
π‘βˆ’π‘›
π‘βˆ’1
where N = population size
s = Sample S.D.
βˆšπ‘›βˆ’1
𝑠
𝜎
βˆšπ‘›
n = Sample size
π‘βˆ’π‘›
√
π‘βˆ’1
𝑃×(1βˆ’π‘ƒ)
5) Standard error of proportion = √
𝑃×(1βˆ’π‘ƒ)
6) SE (P) (WOR) = √
𝑛
𝑛
π‘βˆ’π‘›
√
π‘βˆ’1
INTERVAL ESTIMATION OF MEAN AND PROPORTION
1) Interval estimation of mean =𝑋̅ ± 𝑍 × π‘†πΈ(π‘₯Μ… )
2) Interval estimation of mean if
a) Sample size is less than 30.
b) Population S.D. is not known.
then interval estimation of mean 𝑋̅ ± 𝑑 × π‘†πΈ(𝑋̅)
3) Interval estimation of proportion = 𝑃 ± 𝑍 × π‘†πΈ(𝑃)
Sample size
𝜎×𝑧
1) Sample size for population mean = |
2) Sample size for proportion =
πœ–
|²
𝑝×π‘ž×𝑧 2
πœ–2
TYPES OF SAMPLING
I) PROBABILITY SAMPLING
II) NON-PROBABILITY SAMPLING
III) MIXED SAMPLING
PROBABILITY SAMPLING : When each member of population has equal chance of
selection.
a) Simple Random Sampling (SRS) – should be used when
1) Population is small. 2) Sample size is not large. 3) Population is homogeneous.
b) Stratified Sampling (strata = layer) : is used when
1) Population is large.
2) Population is heterogeneous
c) Multi stage Sampling : If population is very large then it is cost effective and flexible
system of sampling.E.g. : Estimation of foodgrain production in India.
PURPOSIVE OR JUDGEMENT OR NON PROBABILISTIC SAMPLING : Probability of
selection of each unit is not equal.
MIXED SAMPLING : (Systematic Sampling) is partly probabilistic and partly non
probabilistic.
E.g. : Sampling done by Auditors.
Systematic Sampling has a drawback – If there is unknown or undetected periodicity in
sampling frame and sampling interval is multiple of that period then we get most biased
samples.
CRITERIA FOR IDEAL ESTIMATION
1) Unbiasedness and minimum variance (MVUE) Minimum variance unbiased estimation
2) Consistency and Efficiency
3) Sufficiency
INDEX NUMBERS
Index Numbers is an average of ratios expressed as percentage. Two or more time periods are
involved one of which is base time period. The value at the time of base period serves as
standard of comparison.
INDEX NUMBER ARE OF FOLLOWING TYPES :
1) PRICE INDEX
2) QUANTITY INDEX
3) VALUE INDEX
4) COST OF LIVING INDEX OR CONSUMER PRICE INDEX
METHODS OF CONSTRUCTION OF INDEX NUMBER (PRICE INDEX)
1) SIMPLE AGGREGATIVE METHOD (0 is base year, 1 is current year)
𝑃° 1 =
βˆ‘ 𝑃1
βˆ‘ 𝑃°
× 100
𝑃
2) SIMPLE AVERAGE OF PRICE RELATIVE(𝑃1 )
°
𝑃° 1 =
𝑃
βˆ‘( 1 )
𝑃°
𝑛
× 100
3) WEIGHTED METHODS
a) Laspeyre’s Price Index (L)
𝑃° 1 =
βˆ‘(𝑃1 ×𝑄° )
βˆ‘(𝑃° ×𝑄° )
× 100
b) Passche’s Price Index (P)
𝑃° 1 =
βˆ‘(𝑃1 ×𝑄1 )
βˆ‘(𝑃° ×𝑄1 )
× 100
c) Marshall –Edge worth
𝑃° 1 =
βˆ‘ 𝑃1 (𝑄° +𝑄1 )
βˆ‘ 𝑃° (𝑄° +𝑄1 )
× 100
d) Fisher’s ideal Index no. = √𝐿 × π‘ƒ
e) Bowley’s Index no. =
𝐿+𝑃
2
4) WEIGHTED AVERAGE OF PRICE RELATIVE METHOD
𝑃° 1 =
βˆ‘ 𝑃1 ×𝑄°
βˆ‘ 𝑃° ×𝑄°
× 100
[Similar to Laspeyre’s Index no.]
5) Chain Index =
πΏπ‘–π‘›π‘˜ π‘Ÿπ‘’π‘™π‘Žπ‘‘π‘–π‘£π‘’ π‘œπ‘“ π‘π‘’π‘Ÿπ‘Ÿπ‘’π‘›π‘‘ π‘¦π‘’π‘Žπ‘Ÿ×π‘β„Žπ‘Žπ‘–π‘› 𝑖𝑛𝑑𝑒π‘₯ π‘œπ‘“ π‘™π‘Žπ‘ π‘‘ π‘¦π‘’π‘Žπ‘Ÿ
100
𝑃𝑛
Link Relative =𝑃
π‘›βˆ’1
× 100
QUANTITY INDEX – REPLACE P BY Q AND Q BY P IN PRICE INDEX
FORMULA.
VALUE INDEX
𝑉°1 =
βˆ‘ 𝑃1 ×𝑄°
βˆ‘ 𝑃° ×𝑄°
× 100
COST OF LIVING INDEX (CLT) OR CONSUMER PRICE INDEX (CPI) =
weighted average of indices]
or
βˆ‘ 𝑃1 ×𝑄°
βˆ‘ 𝑃° ×𝑄°
βˆ‘ π‘ŠπΌ
βˆ‘π‘Š
[is
× 100 [same as Laspeyre’s]
DEFLATING
πΆπ‘’π‘Ÿπ‘Ÿπ‘’π‘›π‘‘ π‘£π‘Žπ‘™π‘’π‘’ ×100
Deflated Value = π‘ƒπ‘Ÿπ‘–π‘π‘’ 𝑖𝑛𝑑𝑒π‘₯ π‘œπ‘“ π‘π‘’π‘Ÿπ‘Ÿπ‘’π‘›π‘‘ π‘¦π‘’π‘Žπ‘Ÿ
or
πΆπ‘’π‘Ÿπ‘Ÿπ‘’π‘›π‘‘ π‘£π‘Žπ‘™π‘’π‘’ ×π΅π‘Žπ‘ π‘’ π‘¦π‘’π‘Žπ‘Ÿ π‘π‘Ÿπ‘–π‘π‘’4
πΆπ‘’π‘Ÿπ‘Ÿπ‘’π‘›π‘‘ π‘¦π‘’π‘Žπ‘Ÿ π‘π‘Ÿπ‘–π‘π‘’π‘ 
BASE SHIFTING
π‘‚π‘Ÿπ‘–π‘”π‘–π‘›π‘Žπ‘™ π‘ƒπ‘Ÿπ‘–π‘π‘’ 𝐼𝑛𝑑𝑒π‘₯ ×100
Shifting Price Index = π‘ƒπ‘Ÿπ‘–π‘π‘’ 𝐼𝑛𝑑𝑒π‘₯ π‘œπ‘“ π‘¦π‘’π‘Žπ‘Ÿ π‘œπ‘› π‘€β„Žπ‘–π‘β„Ž 𝑖𝑑 𝑖𝑠 π‘ β„Žπ‘–π‘“π‘‘π‘’π‘‘
Note : Index no. of base year is always 100.
325
Real wages of Base year = 110 × 100 = 295.45
500
Real wages in Current year = 200 × 100 = 250
Decrease in Real wages = 295.45 – 250
= 45.45
TEST OF ADEQUACY
1) UNIT TEST – This test requires index no. to be free of unit. All index no. expect simple
aggregative method satisfy this test.
2) TIME REVERSAL TEST is cleared if 𝑃° 1 × π‘ƒ1 ° = 1
a) Fisher Index no.
b) Marshall Edgeworth sastisfy this text.
3) FACTOR REVERSAL TEST is satisfied if 𝑃° 1 × π‘„° 1 = 𝑉° 1
a) Fisher Index no.
b) Simple Aggregative method satisfy this text.
4) CIRCULAR TEST – is satisfied if
𝑃° 1 × π‘ƒ12 × π‘ƒ23 = 𝑃° 3 π‘œπ‘Ÿ 𝑃° 1 × π‘ƒ12 × π‘ƒ20 = 1
It is extension of time reversal test
a) simple Geometric mean of Price relative
b) Weighted Aggregative with fixed weight
c) simple aggregative meet this test.
DIFFERENTIAL CALCULUS
Derivative of y w.Ι£.t. x is change in y w.r.t. x. when change in x is very small
𝑑𝑦
𝑑π‘₯
βˆ†π‘¦
= lim
βˆ†π‘₯β†’0 βˆ†π‘₯
𝑓(π‘₯+β„Ž)βˆ’ 𝑓(π‘₯)
= lim
β„Ž
β„Žβ†’0
Standard Results
𝑑
1) 𝑑π‘₯ (π‘₯ 𝑛 ) = 𝑛 π‘₯ π‘›βˆ’1
𝑑
2) 𝑑π‘₯ (𝑒 π‘₯ ) = 𝑒 π‘₯
𝑑
3) 𝑑π‘₯ (πΆπ‘œπ‘›π‘ π‘‘π‘Žπ‘›π‘‘) = 0
𝑑
4) 𝑑π‘₯ (π‘Ž π‘₯ ) = π‘Ž π‘₯ log π‘Ž
𝑑
5) 𝑑π‘₯ (log π‘₯) =
1
π‘₯
Product Rule
𝑑
𝑑π‘₯
(𝐼 × πΌπΌ) = 𝐼 ×
𝑑
𝑑π‘₯
𝑑
× (𝐼𝐼) + 𝐼𝐼 × π‘‘π‘₯ (𝐼)
Quotient Rule
𝑑
𝐼
( )=
𝐼𝐼×
𝑑π‘₯ 𝐼𝐼
𝑑
𝑑
(𝐼)βˆ’πΌ× (𝐼𝐼)
𝑑π‘₯
𝑑π‘₯
(𝐼𝐼)2
𝑑𝑦
Gradient = Derivative = 𝑑π‘₯
* Ordinate = value of x
Abscissa = value of y
INTEGRATION
𝑑
1
π‘₯βˆ’π‘Ž
𝑑
1
π‘Ž+π‘₯
1) ∫ π‘₯ 2 βˆ’π‘Ž2 = 2π‘Ž log (π‘₯+π‘Ž) + 𝐢
2) ∫ π‘Ž2 βˆ’π‘₯2 = 2π‘Ž log (π‘Žβˆ’π‘₯) + 𝐢
𝑑
3) ∫ √π‘₯ 2
+π‘Ž2
𝑑
4) ∫ √π‘₯ 2
βˆ’π‘Ž2
= log(π‘₯ + √π‘₯ 2 + π‘Ž2 ) + 𝐢
= log(π‘₯ + √π‘₯ 2 βˆ’ π‘Ž2 ) + 𝐢
5) ∫ 𝑒 π‘₯ (𝑓(π‘₯) + 𝑓 1 (π‘₯)) = 𝑒 π‘₯ 𝑓(π‘₯)
π‘₯
6) ∫ √π‘₯ 2 + π‘Ž2 𝑑π‘₯ = 2 √π‘₯ 2 + π‘Ž2 +
π‘Ž2
2
log[π‘₯ + √π‘₯ 2 + π‘Ž2 ] + 𝐢
SETS, FUNCTIONS AND RELATIONS
Sets : A set is defined as collection of well defined distinct objects. For e.g. :
A = {a,e,i,o,u} = {x : x is a vowel in the alphabets}
B = {2, 4, 6, 8, 10} ={ x : x = 2m and m is an integer o<m<6}
Note : Each set has 2𝑛 subsets where n are no. of items in a set.
Each set has2𝑛 βˆ’ 1 proper subsets.
For e.g. : A={1, 2, 3},
Subsets are {1},{3},{2},{1,2},{1,3},{2,3},{1,2,3} { } =
8 = 2³
If 1,2,3 is excluded then remaining subsets are proper subsets. Null set = = βˆ…
𝑛(𝐴 βˆͺ 𝐡) = 𝑛 (𝐴) + 𝑁 (𝐡) βˆ’ 𝑁 (𝐴 ∩ 𝐡)
1) Singleton set – contains only one element a
2) Equal set – A = {1, 3, 4}
B = {1, 3, 4}
3) Equivalent set – A = {1, 3, 4}
B = {2, 3, 5}
n (A) = n (B)
:. A & B are Equivalent set.
4) Power set is collection of all possible subsets of a set.
Cartesian product of Sets – If A and B are 2 non empty sets then A x B is set of all ordered
pairs (a, b) such that a belongs to A and b belongs to B.
For E.g. : A ={1, 3, 6} ,
B ={3, 5}
A x B = {(1, 3), (1, 5), (3, 3), (3, 5), (6, 3), (6, 5)
n (A x B) = n (A) x n (B)
Domain of a function y = f (x) is all possible values of x.
Range of a function y = f (x) is all possible values of y.
Relations
1) Reflexive relation is a relation if a is related to a. [a=a]
2) Symmetric relation : If a = b and b = a then a and b has symmetric relation.
3) Transitive relation : If a = b and b = c then If a = c then relation is transitive.
4) Equivalence relation : If a relation is reflexive, symmetric and transitive then it is
equivalence relation.
Related documents