NotesM.ComQuantitative Techniques
MCOP103-18

Quantitative Techniques Notes

Program:M.Com
Semester:Semester 1
Credits:4
Units:4 Units

Subject Overview

Quantitative Techniques equips M.Com students with the statistical and operations-research toolkit used throughout the program — central tendency, dispersion, correlation and regression, probability distributions, linear programming and game theory, and transportation, assignment and project scheduling (PERT/CPM) problems. A 4-credit core theory paper.

Unit-wise Syllabus

4 units — open any unit for detailed topic-wise notes, diagrams and important exam questions

  • Meaning
  • features
  • functions
  • scope and limitations of statistics
  • measures of central tendency (arithmetic/geometric/harmonic mean, mode, median, quartiles/deciles/percentiles)
  • measures of variation (range, quartile deviation, mean deviation, standard deviation and coefficients)
  • moments
  • skewness (Karl Pearson and Bowley measures) and kurtosis
Key formulasDispersion and shape
  • Standard deviation

    σ = √[Σ(x − x̄)² / n]

  • Coefficient of variation

    (σ / x̄) × 100

  • Karl Pearson skewness

    (Mean − Mode) / σ

  • Bowley skewness

    (Q3 + Q1 − 2 Median) / (Q3 − Q1)

  • Kurtosis

    β2 = μ4 / μ2²

    3 = mesokurtic

Study guide

This unit covers descriptive statistics: means, mode, median and positional measures, measures of variation, moments, skewness (Karl Pearson and Bowley) and kurtosis. Practise computing and interpreting skewness.

Read Unit 1 notes
  • Simple/multiple/partial and linear/non-linear correlation
  • scatter diagrams
  • Pearson's correlation coefficient
  • rank correlation
  • simple regression via least squares
  • relationship between correlation and regression
  • approaches to probability
  • addition and multiplication laws
  • conditional probability and Bayes' theorem
Key formulasCorrelation, regression and probability
  • Pearson's r

    Cov(x, y) / (σx σy)

  • Spearman's rank

    1 − 6Σd² / [n(n² − 1)]

  • Regression coefficient

    byx = r × σy / σx

  • Bayes' theorem

    P(Ai given B) = P(Ai) P(B given Ai) / Σ P(Aj) P(B given Aj)

Study guide

You study correlation and regression (simple, multiple, partial), rank correlation, least squares, the relation between correlation and regression, approaches to probability, probability laws, conditional probability and Bayes' theorem. Work Bayes' theorem problems with a tree diagram.

Read Unit 2 notes
  • Binomial
  • Poisson and Normal distributions with properties and applications
  • formulation of linear programming problems
  • graphic and Simplex (including Big-M) solution methods
  • degeneracy
  • duality
  • post-optimality analysis
  • two-person zero-sum games
  • pure and mixed strategies
  • dominance rule
  • graphic solution to games
ProcessSimplex method steps
  1. 1Standard form

    Add slack, surplus, artificial variables

  2. 2Initial table

    Basic feasible solution

  3. 3Key column

    Most negative Cj − Zj (max problem)

  4. 4Key row

    Minimum ratio test

  5. 5Pivot and iterate

    Until no improvement is possible

Study guide

You study the binomial, Poisson and normal distributions, formulation and solution of linear programming problems (graphical, simplex, Big-M), degeneracy, duality, post-optimality analysis and game theory with pure and mixed strategies and dominance. Practise at least one simplex problem fully.

Read Unit 3 notes
  • Transportation problem — North-West Corner
  • Least Cost and Vogel's Approximation methods
  • optimality testing via MODI method
  • assignment problem via the Hungarian method
  • PERT/CPM project networks
  • scheduling with known activity times
  • critical path
ProcessHungarian method for assignment
  1. 1Row reduction

    Subtract row minimum

  2. 2Column reduction

    Subtract column minimum

  3. 3Cover zeros

    With minimum lines

  4. 4Lines = n?

    If yes, assign; if no, adjust

  5. 5Adjust

    Subtract smallest uncovered, add at intersections

Study guide

You study the transportation problem (North-West Corner, Least Cost, Vogel, MODI), the assignment problem (Hungarian method) and PERT/CPM networks and critical path. Set up each problem in a table and check feasibility.

Read Unit 4 notes

Why Quantitative Techniques Matters

Quantitative methods underpin research, analytics and operations decisions, and they are tested in management entrance exams and UGC-NET.

How to Prepare for Quantitative Techniques

  • Solve numericals daily and keep a formula sheet.
  • Practise LP, transportation and assignment problems from start to finish.
  • Use Excel or Python to check your answers.

Quantitative Techniques: Frequently Asked Questions

What is skewness?

Skewness measures the asymmetry of a distribution around its mean; it can be positive, negative or zero.

What is the MODI method?

MODI (modified distribution) is a method to test whether a transportation solution is optimal and to improve it if not.

Want the Complete Notes & Past Papers?

WhatsApp us and we'll send you the full notes, question banks, and previous year papers for Quantitative Techniques.