Skip to main content
CBSE Class 12 · Mathematics 041 · Board standard

Class 12 Maths Sample Paper 1 (CBSE 2026-27 pattern)

A full-length practice paper for CBSE Class 12 Mathematics on the 2026-27 board pattern, pitched at the level of the board paper itself. Sit it in one go against the 3-hour timer, then mark it: the Section A answer key and the scheme for question 36 are open to everyone, and the full step-marking scheme, with where toppers lose marks on every long answer and case study, is free with an account.

  • 80 marks
  • 3 hours
  • 38 questions, sections A to E
  • Internal choice in B, C, D and E

Not an official CBSE paper. This is an original practice paper written to the CBSE pattern by CBSE Math Revision and independently checked. CBSE's own 2026-27 sample paper is on cbseacademic.nic.in: question paper · marking scheme.

Time 3:00:00

General instructions

  1. This question paper contains 38 questions. All questions are compulsory.
  2. The paper is divided into five sections: A, B, C, D and E.
  3. Section A: questions 1–18 are MCQs and questions 19–20 are Assertion–Reason based, 1 mark each.
  4. Section B: questions 21–25 are very short answer (VSA) questions of 2 marks each.
  5. Section C: questions 26–31 are short answer (SA) questions of 3 marks each.
  6. Section D: questions 32–35 are long answer (LA) questions of 5 marks each.
  7. Section E: questions 36–38 are case study based questions of 4 marks each, with sub-parts of 1, 1 and 2 marks.
  8. There is no overall choice. Internal choice is provided in 2 questions of Section B, 2 of Section C, 2 of Section D and in the 2-mark sub-part of each case study in Section E.
  9. Use of calculators is not allowed.

Section A 20 marks

Questions 1 to 20 carry 1 mark each. Questions 1 to 18 are multiple choice questions (MCQs); questions 19 and 20 are Assertion–Reason based questions.

1.

The relation \(R = \{(1,1), (2,2), (3,3), (1,2), (2,3)\}\) on \(A = \{1, 2, 3\}\) is

  1. (a) reflexive, but neither symmetric nor transitive
  2. (b) an equivalence relation
  3. (c) symmetric and transitive but not reflexive
  4. (d) transitive but not reflexive
1
3.

If \(A\) is a square matrix of order \(3\) with \(|A| = 4\), then \(|\operatorname{adj} A|\) is

  1. (a) \(4\)
  2. (b) \(8\)
  3. (c) \(16\)
  4. (d) \(64\)
1
4.

The matrix \(\begin{bmatrix} 2 & 3 \\ -1 & x \end{bmatrix}\) is singular when \(x\) equals

  1. (a) \(\dfrac32\)
  2. (b) \(-\dfrac32\)
  3. (c) \(-\dfrac23\)
  4. (d) \(3\)
1
5.

If \(A\) and \(B\) are symmetric matrices of the same order, then \(AB - BA\) is

  1. (a) symmetric
  2. (b) skew-symmetric
  3. (c) the zero matrix
  4. (d) the identity matrix
1
6.

For the \(2 \times 3\) matrix \(A = [a_{ij}]\) with \(a_{ij} = i - 2j\), the element \(a_{23}\) is

  1. (a) \(-4\)
  2. (b) \(4\)
  3. (c) \(-1\)
  4. (d) \(-5\)
1
11.

The function \(f(x) = x^3 - 3x^2 + 3x + 7\) is

  1. (a) increasing on \(\mathbb{R}\)
  2. (b) decreasing on \(\mathbb{R}\)
  3. (c) decreasing on \((0, 1)\) only
  4. (d) neither increasing nor decreasing on \(\mathbb{R}\)
1
12.

\(\displaystyle\int e^x\left(x^2 + 2x\right)dx\) equals

  1. (a) \(2xe^x + C\)
  2. (b) \((x^2 + 2x)e^x + C\)
  3. (c) \(x^2e^x + C\)
  4. (d) \((x^2 - 2x)e^x + C\)
1
13.

If \(|\vec a| = 3\), \(|\vec b| = 4\) and \(\vec a \cdot \vec b = 6\), the angle between \(\vec a\) and \(\vec b\) is

  1. (a) \(\dfrac{\pi}{6}\)
  2. (b) \(\dfrac{\pi}{4}\)
  3. (c) \(\dfrac{\pi}{3}\)
  4. (d) \(\dfrac{\pi}{2}\)
1
14.

The direction cosines of the line joining \((1, -2, 3)\) and \((3, 0, 4)\), directed from the first point to the second, are

  1. (a) \(\dfrac23, \dfrac23, \dfrac13\)
  2. (b) \(2, 2, 1\)
  3. (c) \(\dfrac25, \dfrac25, \dfrac15\)
  4. (d) \(-\dfrac23, -\dfrac23, -\dfrac13\)
1
15.

If \(|\vec a| = 2\) and \(|\vec b| = 5\), then \(|\vec a \times \vec b|^2 + (\vec a \cdot \vec b)^2\) equals

  1. (a) \(49\)
  2. (b) \(100\)
  3. (c) \(10\)
  4. (d) \(29\)
1
16.

The corner points of the feasible region of an LPP are \((0, 4)\), \((2, 1)\) and \((5, 0)\). The objective function \(Z = px + qy\) \((p, q \gt 0)\) takes its minimum value at both \((0, 4)\) and \((2, 1)\) if

  1. (a) \(p = \dfrac{3q}{2}\)
  2. (b) \(q = \dfrac{3p}{2}\)
  3. (c) \(p = q\)
  4. (d) \(p = 2q\)
1
17.

If the feasible region of a linear programming problem is bounded (and non-empty), then the objective function \(Z = ax + by\)

  1. (a) has a maximum but may not have a minimum
  2. (b) has both a maximum and a minimum, each at a corner point
  3. (c) has neither a maximum nor a minimum
  4. (d) has its optimum only at an interior point
1
18.

If \(A\) and \(B\) are independent events with \(P(A) = 0.4\) and \(P(B) = 0.5\), then \(P(A \cup B)\) is

  1. (a) \(0.9\)
  2. (b) \(0.2\)
  3. (c) \(0.7\)
  4. (d) \(0.3\)
1
19.

In the following question, a statement of Assertion (A) is followed by a statement of Reason (R). Choose the correct option.

Assertion (A): The lines \(\vec r = (\hat i + \hat j) + \lambda(2\hat i - \hat j + \hat k)\) and \(\vec r = (2\hat i + \hat k) + \mu(-4\hat i + 2\hat j - 2\hat k)\) are parallel.

Reason (R): Two lines are parallel if their direction vectors are collinear.

  1. (a) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).
  2. (b) Both Assertion (A) and Reason (R) are true but Reason (R) is not the correct explanation of Assertion (A).
  3. (c) Assertion (A) is true but Reason (R) is false.
  4. (d) Assertion (A) is false but Reason (R) is true.
1
20.

In the following question, a statement of Assertion (A) is followed by a statement of Reason (R). Choose the correct option.

Assertion (A): If \(P(A) = 0.3\) and \(P(B \mid A) = 0.4\), then \(P(A \cap B) = 0.12\).

Reason (R): For any two events \(A\) and \(B\), \(P(A \cap B) = P(A)P(B)\).

  1. (a) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).
  2. (b) Both Assertion (A) and Reason (R) are true but Reason (R) is not the correct explanation of Assertion (A).
  3. (c) Assertion (A) is true but Reason (R) is false.
  4. (d) Assertion (A) is false but Reason (R) is true.
1

Section B 10 marks

Questions 21 to 25 are very short answer (VSA) type questions carrying 2 marks each. Internal choice is provided in 2 questions.

25.

Two cards are drawn one after the other, without replacement, from a well-shuffled pack of \(52\) cards. Find the probability that both are kings.

2

Full step-marking scheme for Section B: every step mark, free with an account.

Create a free account

Section C 18 marks

Questions 26 to 31 are short answer (SA) type questions carrying 3 marks each. Internal choice is provided in 2 questions.

28.

Solve the differential equation \(x\dfrac{dy}{dx} - 3y = x^5e^x\), \(x \gt 0\), given that \(y = 2\) when \(x = 1\).

OR

Solve the differential equation \(x\dfrac{dy}{dx} = y + xe^{-y/x}\), given \(y = 0\) when \(x = 1\).

3
30.

Find the coordinates of the foot of the perpendicular drawn from the point \(P(2, 3, 5)\) to the line \(\dfrac{x - 1}{1} = \dfrac{y + 1}{2} = \dfrac{z - 2}{-1}\). Hence find the perpendicular distance of \(P\) from the line.

OR

Find the shortest distance between the lines \(\vec r = (\hat i + 2\hat k) + \lambda(\hat i + 2\hat j - \hat k)\) and \(\vec r = (3\hat i + \hat j) + \mu(2\hat i - \hat j + \hat k)\).

3
31.

Solve the following linear programming problem graphically: maximise \(Z = 4x + 5y\) subject to \(2x + y \le 14\), \(x + 3y \le 12\), \(x \ge 0\), \(y \ge 0\).

3

Full step-marking scheme for Section C: every step mark, free with an account.

Create a free account

Section D 20 marks

Questions 32 to 35 are long answer (LA) type questions carrying 5 marks each. Internal choice is provided in 2 questions.

32.

Using matrices, solve the system of equations: \(2x - y + z = 3\), \(x + 3y - 2z = 1\), \(3x + y + 2z = 11\).

OR

Given \(A = \begin{bmatrix} 2 & -4 & 2 \\ 1 & 2 & -1 \\ -1 & 2 & 1 \end{bmatrix}\) and \(B = \begin{bmatrix} 1 & 2 & 0 \\ 0 & 1 & 1 \\ 1 & 0 & 2 \end{bmatrix}\), find \(AB\). Hence solve \(x + 2y = 5\), \(y + z = 5\), \(x + 2z = 7\).

5
34.

Find \(\displaystyle\int \dfrac{3x^2 + 2x - 1}{(x - 1)(x^2 + 3)}\,dx\).

OR

Evaluate \(\displaystyle\int_0^{\pi/2} \dfrac{x}{1 + \sin x\cos x}\,dx\).

5
35.

Consider the lines \(L_1: \dfrac{x - 1}{2} = \dfrac{y + 1}{3} = \dfrac{z - 2}{k}\) and \(L_2: \dfrac{x + 2}{1} = \dfrac{y - 3}{-2} = \dfrac{z - 1}{2}\). (a) Find \(k\) if \(L_1 \perp L_2\). (b) For this \(k\), find the shortest distance between \(L_1\) and \(L_2\). (c) Do the lines intersect? Justify.

5

Full step-marking scheme for Section D: every step mark and where toppers lose marks, free with an account.

Create a free account

Section E 12 marks

Questions 36 to 38 are case study based questions carrying 4 marks each (1 + 1 + 2). Internal choice is provided in the 2-mark sub-part of each case study.

36.

Screening test. A diagnostic lab in Pune uses a quick screening test for a viral infection. In the population tested, \(2\%\) have the infection. The test is positive for \(95\%\) of infected people and also (falsely) for \(10\%\) of uninfected people. A person is tested at random.

  1. Find the probability that the person is infected and tests positive. [1 mark]

  2. Find the probability that the test is positive. [1 mark]

  3. The test is positive. Find the probability that the person is actually infected, and comment on the result. [2 marks]

    OR

    The test is negative. Find the probability that the person is not infected. [2 marks]

Marking scheme free
  1. \(0.02 \times 0.95 = 0.019\) A1

  2. \(0.019 + 0.98 \times 0.10 = 0.117\) A1

  3. \[\begin{aligned}P(I \mid +) &= \dfrac{0.019}{0.117} \\ &= \dfrac{19}{117}\end{aligned}\] M1
    \(\approx 0.16\): most positives are false positives, because the infection is rare. A confirmatory test is needed A1

Where toppers lose marks: Define the events (\(I\): infected, \(+\): positive) before writing Bayes' formula. Unlabelled probabilities lose the method mark. The comment must use the number: say that \(\approx 0.16\) is low.

OR option for part (iii)

\(P(-) = 1 - 0.117 = 0.883\); \[\begin{aligned}P(\text{not } I \cap -) &= 0.98 \times 0.90 \\ &= 0.882\end{aligned}\] M1
\[\begin{aligned}P(\text{not } I \mid -) &= \dfrac{0.882}{0.883} \\ &= \dfrac{882}{883} \approx 0.999\end{aligned}\] A1

4
37.

Mall parking. A mall in Noida finds that if it charges ₹\(p\) per hour for parking, about \(200 - 8p\) cars use the parking each hour \((0 \le p \le 25)\).

  1. Write the hourly revenue \(R(p)\). [1 mark]

  2. Find the interval of \(p\) on which \(R\) is increasing. [1 mark]

  3. Find the charge that maximises the revenue, and the maximum revenue. Justify that it is a maximum. [2 marks]

    OR

    The city levies a tax of ₹2.50 on every car parked. Find the charge \(p\) that maximises the mall's hourly profit \((p - 2.5)(200 - 8p)\), and the maximum profit. [2 marks]

4
38.

Smart-card batches. A metro rail office issues smart cards numbered \(1, 2, \ldots, 12\). For audit, cards are grouped by the relation \(R = \{(a, b) : a + 2b \text{ is divisible by } 3\}\) on \(S = \{1, 2, \ldots, 12\}\).

  1. Write the equivalence class of card \(1\). [1 mark]

  2. How many distinct equivalence classes are there? [1 mark]

  3. Show that \(R\) is an equivalence relation. [2 marks]

    OR

    Define \(f : S \to \{0, 1, 2\}\) by \(f(a) =\) remainder when \(a\) is divided by \(3\). Is \(f\) one-one? Is it onto? Justify. [2 marks]

4

Full step-marking scheme for Section E: every step mark and where toppers lose marks, free with an account.

Create a free account

Marking scheme and answers

Mark your own paper step by step. M1 is a method mark, A1 an accuracy mark that depends on the method, and B1 an independent mark for a correct result.

Section A answer key (free)

Q1234567891011121314151617181920
Answer(a)(b)(c)(b)(b)(a)(c)(b)(b)(c)(a)(c)(c)(a)(b)(a)(b)(c)(a)(c)

The complete scheme for question 36, the first case study, is open under the question, with the note on where toppers lose marks.

Create a free account to see the full marking scheme

Every step mark for all 38 questions and both options of every internal choice, plus a note on where toppers lose marks on each long answer and case study. Free, no card.

Create a free account

Unit weightage in this paper

UnitMarks
Relations and Functions8
Algebra10
Calculus35
Vectors and Three-Dimensional Geometry14
Linear Programming5
Probability8

The same unit marks as the CBSE curriculum for 2026-27.

After the paper

Take every lost mark back to its chapter: each question above links to its chapter's Route to 95 and to our NCERT solutions for that chapter. Chapters in this paper: Relations and Functions, Inverse Trigonometric Functions, Matrices, Determinants, Continuity and Differentiability, Application of Derivatives, Integrals, Application of Integrals, Differential Equations, Vector Algebra, Three Dimensional Geometry, Linear Programming, Probability.

CBSE Math Revision is independent and not affiliated with CBSE or NCERT. Spotted a slip? Tell us and it goes in the corrections log.