PYQ Vault

Day 106: CBSE Class 12 Maths

5 questions. Try each one first, then open its answer.

  1. Question 1

    Linear Programming. Asked once: 2025 (same type asked 4 times)

    28
    The feasible region along with corner points for a linear programming problem are shown in the graph. Write all the constraints for the given linear programing problem.

  2. Question 2

    Linear Programming. Asked once: 2026 (same type asked 4 times)

    15
    The corner points of the feasible region determined by the system of linear constraints are (0, 0), (0, 40), (20, 40) (60, 20) and (60, 0). If the objective function of an LPP is Z=4x+3yZ = 4x + 3y, then the maximum value is :

    Tap an option to check your answer.

  3. Question 3

    Linear Programming. Asked once: 2025 (same type asked 4 times)

    24
    In a Linear Programming Program (LPP) for objective function Z=14x−10yZ = 14x - 10y subject to constraints x+y≤8x + y \le 8 3x−2y≥−63x - 2y \ge -6 x, y≥0x,\ y \ge 0 shade the feasible region and mark the corner points in a neatly drawn graph.

  4. Question 4

    Matrices. Asked once: 2026 (same type asked 4 times)

    4
    If [413]A=[−484−121−363]\begin{bmatrix} 4 \\ 1 \\ 3 \end{bmatrix} A = \begin{bmatrix} -4 & 8 & 4 \\ -1 & 2 & 1 \\ -3 & 6 & 3 \end{bmatrix}, then order of A must be :

    Tap an option to check your answer.

  5. Question 5

    Matrices. Asked once: 2024 (same type asked 4 times)

    2
    If A=[ac−1b051−50]A = \begin{bmatrix} a & c & -1 \\ b & 0 & 5 \\ 1 & -5 & 0 \end{bmatrix} is a skew-symmetric matrix, then the value of 2a−(b+c)2a - (b + c) is :

    Tap an option to check your answer.