You are on page 1of 1

Points within and on the boundary of the feasible region represents feasible solutions of the

constraints. Any point outside the feasible region is an


(A) optimal solution (B) feasible solution (C) infeasible solution (D) none of these
1 1 1
116. A and B are two events. P(A) = , P(B) = and P(A Ç B) = then P(A'|B) = ............
2 3 4
1 1 1 1
(A) (B) (C) (D)
4 5 6 7
117. If the events A and B are independent, then P(A Ç B) is equal to ..........
(A) P(A) + P (B) (B)P(A) – P(B) (C) P(A) × P(B) (D) P(A) | P(B)
118. If A and B are two events such that P(A) ¹ 0 and P(B | A) = 1, then.
(A) A Ì B (B) B Ì A (C) B = f (D) A = f
119. For linear programming x + 2y > 10, 3x + 4y < 24 and x > 0, y > 0 .......... is not the corner point
of feasible region.
(A) (0, 6) (B) (4, 3) (C) (3, 4) (D) (0, 5)

Section B
//X
• Write the answer of the following questions. [Each carries 1 Mark] [1]

æ 1 ö
120. cot–1 ç
è 3 ÷ø
( )
– cosec–1 – 2 = ..........

p 3p p p
(A) (B) (C) (D)
2 4 6 3

You might also like