हिंदी
Karnataka Board PUCPUC Science 2nd PUC Class 12

PUC Science 2nd PUC Class 12 - Karnataka Board PUC Question Bank Solutions for Mathematics

Advertisements
[object Object]
[object Object]
विषयों
मुख्य विषय
अध्याय
Advertisements
Advertisements
Mathematics
< prev  1121 to 1140 of 5524  next > 

Ratio in which the xy-plane divides the join of (1, 2, 3) and (4, 2, 1) is

[11] Three - Dimensional Geometry
Chapter: [11] Three - Dimensional Geometry
Concept: undefined >> undefined

If P (3, 2, −4), Q (5, 4, −6) and R (9, 8, −10) are collinear, then R divides PQ in the ratio

[11] Three - Dimensional Geometry
Chapter: [11] Three - Dimensional Geometry
Concept: undefined >> undefined

Advertisements

If O is the origin, OP = 3 with direction ratios proportional to −1, 2, −2 then the coordinates of P are

[11] Three - Dimensional Geometry
Chapter: [11] Three - Dimensional Geometry
Concept: undefined >> undefined

The angle between the two diagonals of a cube is


 

 

[11] Three - Dimensional Geometry
Chapter: [11] Three - Dimensional Geometry
Concept: undefined >> undefined

If a line makes angles α, β, γ, δ with four diagonals of a cube, then cos2 α + cos2 β + cos2γ + cos2 δ is equal to

[11] Three - Dimensional Geometry
Chapter: [11] Three - Dimensional Geometry
Concept: undefined >> undefined

Find the vector from the origin O to the centroid of the triangle whose vertices are (1, −1, 2), (2, 1, 3) and (−1, 2, −1).

[10] Vectors
Chapter: [10] Vectors
Concept: undefined >> undefined

Find the unit vector in the direction of vector \[\overrightarrow{PQ} ,\]

 where P and Q are the points (1, 2, 3) and (4, 5, 6).

[10] Vectors
Chapter: [10] Vectors
Concept: undefined >> undefined

Show that the points \[A \left( 2 \hat{i} - \hat{j} + \hat{k} \right), B \left( \hat{i} - 3 \hat{j} - 5 \hat{k} \right), C \left( 3 \hat{i} - 4 \hat{j} - 4 \hat{k} \right)\] are the vertices of a right angled triangle.

[10] Vectors
Chapter: [10] Vectors
Concept: undefined >> undefined

Find the value of x for which \[x \left( \hat{i} + \hat{j} + \hat{k} \right)\] is a unit vector.

[10] Vectors
Chapter: [10] Vectors
Concept: undefined >> undefined

If \[\vec{a} = \hat{i} + \hat{j} + \hat{k} , \vec{b} = 2 \hat{i} - \hat{j} + 3 \hat{k} \text{ and }\vec{c} = \hat{i} - 2 \hat{j} + \hat{k} ,\] find a unit vector parallel to \[2 \vec{a} - \vec{b} + 3 \vec{c .}\] 

[10] Vectors
Chapter: [10] Vectors
Concept: undefined >> undefined

If \[\overrightarrow{AO} + \overrightarrow{OB} = \overrightarrow{BO} + \overrightarrow{OC} ,\] prove that A, B, C are collinear points.

[10] Vectors
Chapter: [10] Vectors
Concept: undefined >> undefined

Show that the vectors \[2 \hat{i} - 3 \hat{j} + 4 \hat{k}\text{ and }- 4 \hat{i} + 6 \hat{j} - 8 \hat{k}\] are collinear.

[10] Vectors
Chapter: [10] Vectors
Concept: undefined >> undefined

A small manufacturing firm produces two types of gadgets A and B, which are first processed in the foundry, then sent to the machine shop for finishing. The number of man-hours of labour required in each shop for the production of each unit of and B, and the number of man-hours the firm has available per week are as follows:

Gadget Foundry Machine-shop
A 10 5
B 6 4
 Firm's capacity per week 1000 600

The profit on the sale of A is Rs 30 per unit as compared with Rs 20 per unit of B. The problem is to determine the weekly production of gadgets A and B, so that the total profit is maximized. Formulate this problem as a LPP.

 


 

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

A firm manufactures 3 products AB and C. The profits are Rs 3, Rs 2 and Rs 4 respectively. The firm has 2 machines and below is the required processing time in minutes for each machine on each product : 

Machine Products
A B C
M1
M2
4 3 5
2 2 4

Machines M1 and M2 have 2000 and 2500 machine minutes respectively. The firm must manufacture 100 A's, 200 B's and 50 C's but not more than 150 A's. Set up a LPP to maximize the profit.

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

Amit's mathematics teacher has given him three very long lists of problems with the instruction to submit not more than 100 of them (correctly solved) for credit. The problem in the first set are worth 5 points each, those in the second set are worth 4 points each, and those in the third set are worth 6 points each. Amit knows from experience that he requires on the average 3 minutes to solve a 5 point problem, 2 minutes to solve a 4 point problem, and 4 minutes to solve a 6 point problem. Because he has other subjects to worry about, he can not afford to devote more than

\[3\frac{1}{2}\] hours altogether to his mathematics assignment. Moreover, the first two sets of problems involve numerical calculations and he knows that he cannot stand more than 
\[2\frac{1}{2}\]  hours work on this type of problem. Under these circumstances, how many problems in each of these categories shall he do in order to get maximum possible credit for his efforts? Formulate this as a LPP.

 

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

A farmer has a 100 acre farm. He can sell the tomatoes, lettuce, or radishes he can raise. The price he can obtain is Rs 1 per kilogram for tomatoes, Rs 0.75 a head for lettuce and Rs 2 per kilogram for radishes. The average yield per acre is 2000 kgs for radishes, 3000 heads of lettuce and 1000 kilograms of radishes. Fertilizer is available at Rs 0.50 per kg and the amount required per acre is 100 kgs each for tomatoes and lettuce and 50 kilograms for radishes. Labour required for sowing, cultivating and harvesting per acre is 5 man-days for tomatoes and radishes and 6 man-days for lettuce. A total of 400 man-days of labour are available at Rs 20 per man-day. Formulate this problem as a LPP to maximize the farmer's total profit.

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

The corner points of the feasible region determined by the following system of linear inequalities:
2x + y ≤ 10, x + 3y ≤ 15, xy ≥ 0 are (0, 0), (5, 0), (3, 4) and (0, 5). Let Z = px + qy, where p, q > 0. Condition on p and q so that the maximum of Z occurs at both (3, 4) and (0, 5) is 

[12] Linear Programming
Chapter: [12] Linear Programming
Concept: undefined >> undefined

S is a relation over the set R of all real numbers and it is given by (a, b) ∈ S ⇔ ab ≥ 0. Then, S is _______________ .

[1] Relations and Functions
Chapter: [1] Relations and Functions
Concept: undefined >> undefined

In the set Z of all integers, which of the following relation R is not an equivalence relation ?

[1] Relations and Functions
Chapter: [1] Relations and Functions
Concept: undefined >> undefined

Mark the correct alternative in the following question:

Let A = {1, 2, 3} and consider the relation R = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1, 3)}. Then, R is _______________ .

[1] Relations and Functions
Chapter: [1] Relations and Functions
Concept: undefined >> undefined
< prev  1121 to 1140 of 5524  next > 
Advertisements
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×