| 4381 |
The Cartesian equation of the line through (1, 2, 3) parallel to the vector 3i + 2j − 2k is |
Mathematics/Applied Mathematics
Lines in space |
Medium |
| 4382 |
The direction ratios of the line joining (1, 2, 3) and (4, 0, 5) are |
Mathematics/Applied Mathematics
Lines in space |
Medium |
| 4383 |
The direction cosines of the line (x − 1)/2 = (3 − y)/1 = (z + 2)/2 are |
Mathematics/Applied Mathematics
Lines in space |
Hard |
| 4384 |
The angle between two lines with direction ratios 1, 2, −1 and 1, 0, 1 is |
Mathematics/Applied Mathematics
Angle and shortest distance between lines |
Easy |
| 4385 |
Two lines in space are called skew lines when they |
Mathematics/Applied Mathematics
Angle and shortest distance between lines |
Easy |
| 4386 |
The angle between two lines with direction ratios 1, 1, 0 and 0, 1, 1 is |
Mathematics/Applied Mathematics
Angle and shortest distance between lines |
Medium |
| 4387 |
The distance between the parallel lines r = a₁ + λb and r = a₂ + μb is |
Mathematics/Applied Mathematics
Angle and shortest distance between lines |
Medium |
| 4388 |
The shortest distance between the lines r = i + λj and r = 3k + μi is |
Mathematics/Applied Mathematics
Angle and shortest distance between lines |
Hard |
| 4389 |
In a linear programming problem, the linear function that has to be maximised or minimised is called the |
Mathematics/Applied Mathematics
Terminology and formulation |
Easy |
| 4390 |
In an LPP, the conditions x ≥ 0 and y ≥ 0 are called |
Mathematics/Applied Mathematics
Terminology and formulation |
Easy |
| 4391 |
A firm makes x chairs and y tables, earning a profit of ₹30 per chair and ₹50 per table. Its objective is to |
Mathematics/Applied Mathematics
Terminology and formulation |
Medium |
| 4392 |
Each chair needs 2 hours and each table needs 3 hours of carpentry, and at most 60 hours are available. If x … |
Mathematics/Applied Mathematics
Terminology and formulation |
Medium |
| 4393 |
Food A contains 2 units of vitamin per kg and food B contains 1 unit per kg. A diet must supply at least 8 un… |
Mathematics/Applied Mathematics
Terminology and formulation |
Hard |
| 4394 |
In the graphical method, if an LPP with a bounded feasible region has an optimal value, it occurs at |
Mathematics/Applied Mathematics
Graphical method |
Easy |
| 4395 |
What are the corner points of the feasible region given by x + y ≤ 4, x ≥ 0, y ≥ 0? |
Mathematics/Applied Mathematics
Graphical method |
Easy |
| 4396 |
Subject to x + y ≤ 4, x ≥ 0, y ≥ 0, the maximum value of Z = 3x + 2y is |
Mathematics/Applied Mathematics
Graphical method |
Medium |
| 4397 |
A feasible region has corner points (0, 0), (5, 0), (3, 4) and (0, 6). The maximum of Z = 3x + 2y over it is |
Mathematics/Applied Mathematics
Graphical method |
Medium |
| 4398 |
Subject to 2x + y ≤ 10, x + 3y ≤ 15, x ≥ 0 and y ≥ 0, the maximum value of Z = 3x + 4y is |
Mathematics/Applied Mathematics
Graphical method |
Hard |
| 4399 |
The feasible region of an LPP is the |
Mathematics/Applied Mathematics
Feasible and optimal solutions |
Easy |
| 4400 |
If no point satisfies all the constraints of an LPP at the same time, then the problem |
Mathematics/Applied Mathematics
Feasible and optimal solutions |
Easy |