Class 12 Mathematics and Statistics (Commerce) Part 2 – Daily Revision MCQ (English Medium)
This is the set for 27 October 2026. Solve today's MCQs →
Timed quiz: 15 seconds per question, the next one loads by itself when time runs out. Or solve without the timer: tap an option, right turns green, wrong turns red. 10 new questions every morning at 8.
Or scroll down and solve without the timer.
On a bill, the banker's discount is ₹1,260 and the true discount is ₹1,200. What is the banker's gain?
Chapter 1: Commission, Brokerage and Discount
Show answer
Answer: A. ₹60
Banker's gain = B.D. − T.D. = 1,260 − 1,200 = ₹60.A property is insured for ₹2,00,000 at a rate of premium of 0.5%. How much premium is paid?
Chapter 2: Insurance and Annuity
Show answer
Answer: B. ₹1,000
Premium = 0.5% of the insured value = (0.5/100) × 2,00,000 = ₹1,000.The regression line of Y on X is Y = 3 + 2X, and the mean of X is x̄ = 5. What is the mean of Y?
Chapter 3: Linear Regression
Show answer
Answer: C. 13
Every regression line passes through (x̄, ȳ), so ȳ = 3 + 2 × 5 = 13.For two variables, r = 0.5, σX = 2 and σY = 6. What is the regression coefficient bYX?
Chapter 3: Linear Regression
Show answer
Answer: D. 1.5
bYX = r × σY/σX = 0.5 × 6/2 = 1.5.The yearly values of a time series are 12, 15, 18, 21. What is the FIRST 3-yearly moving average?
Chapter 4: Time Series
Show answer
Answer: B. 15
The first 3-yearly moving average = (12 + 15 + 18)/3 = 45/3 = 15.Laspeyre's price index number is 144 and Paasche's price index number is 100. What is Fisher's ideal price index number?
Chapter 5: Index Numbers
Show answer
Answer: A. 120
Fisher's index = √(Laspeyre's × Paasche's) = √(144 × 100) = √14400 = 120.In a linear programming problem, the conditions x ≥ 0 and y ≥ 0 are called:
Chapter 6: Linear Programming
Show answer
Answer: C. non-negativity constraints
Decision variables cannot be negative, and the conditions x ≥ 0, y ≥ 0 that impose this are called non-negativity constraints.While sequencing n jobs on two machines A and B (order AB), the smallest processing time of all is found on machine B for job J. Where is job J placed in the sequence?
Chapter 7: Assignment Problem and Sequencing
Show answer
Answer: D. Last
In the optimal sequence algorithm, if the minimum time is on machine B, that job is placed last; if it is on machine A, the job is placed first.A discrete random variable X takes values 0, 1, 2 with P(X = 0) = 0.2, P(X = 1) = k and P(X = 2) = 0.5. What is k?
Chapter 8: Probability Distributions
Show answer
Answer: B. 0.3
The probabilities of a probability distribution add up to 1: 0.2 + k + 0.5 = 1, so k = 0.3.A random variable X follows a Poisson distribution with mean 3. What is its variance?
Chapter 8: Probability Distributions
Show answer
Answer: A. 3
For a Poisson distribution, mean = variance = m, so the variance is 3.
Class 12: MCQ in other subjects
Previous days
All questions are written by PadhaiNotes in our own words from the chapters of the official Maharashtra State Board Balbharati textbook (ebalbharati.in). Each question shows its chapter.