Advertisements
Advertisements
The displacement of a particle at time t is given by s = 2t3 – 5t2 + 4t – 3. Find the velocity when 𝑡 = 2 sec
Concept: undefined >> undefined
A car is moving in such a way that the distance it covers, is given by the equation s = 4t2 + 3t, where s is in meters and t is in seconds. What would be the velocity and the acceleration of the car at time t = 20 seconds?
Concept: undefined >> undefined
Advertisements
Water is being poured at the rate of 36 m3/sec in to a cylindrical vessel of base radius 3 meters. Find the rate at which water level is rising
Concept: undefined >> undefined
A ladder 10 meter long is leaning against a vertical wall. If the bottom of the ladder is pulled horizontally away from the wall at the rate of 1.2 meters per seconds, find how fast the top of the ladder is sliding down the wall when the bottom is 6 meters away from the wall
Concept: undefined >> undefined
The volume of the spherical ball is increasing at the rate of 4π cc/sec. Find the rate at which the radius and the surface area are changing when the volume is 288 π cc.
Concept: undefined >> undefined
A man of height 180 cm is moving away from a lamp post at the rate of 1.2 meters per second. If the height of the lamp post is 4.5 meters, find the rate at which
(i) his shadow is lengthening
(ii) the tip of the shadow is moving
Concept: undefined >> undefined
Maximize z = 5x + 2y subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥ 0
Concept: undefined >> undefined
Maximize z = 7x + 11y subject to 3x + 5y ≤ 26, 5x + 3y ≤ 30, x ≥ 0, y ≥ 0
Concept: undefined >> undefined
Maximize z = 10x + 25y subject to x + y ≤ 5, 0 ≤ x ≤ 3, 0 ≤ y ≤ 3
Concept: undefined >> undefined
Solve the Linear Programming problem graphically:
Maximize z = 3x + 5y subject to x + 4y ≤ 24, 3x + y ≤ 21, x + y ≤ 9, x ≥ 0, y ≥ 0 also find the maximum value of z.
Concept: undefined >> undefined
Minimize z = 7x + y subjected to 5x + y ≥ 5, x + y ≥ 3, x ≥ 0, y ≥ 0.
Concept: undefined >> undefined
Minimize z = 6x + 21y subject to x + 2y ≥ 3, x + 4y ≥ 4, 3x + y ≥ 3, x ≥ 0, y ≥ 0 show that the minimum value of z occurs at more than two points
Concept: undefined >> undefined
Minimize z = 2x + 4y is subjected to 2x + y ≥ 3, x + 2y ≥ 6, x ≥ 0, y ≥ 0 show that the minimum value of z occurs at more than two points
Concept: undefined >> undefined
Maximize z = −x + 2y subjected to constraints x + y ≥ 5, x ≥ 3, x + 2y ≥ 6, y ≥ 0 is this LPP solvable? Justify your answer.
Concept: undefined >> undefined
x − y ≤ 1, x − y ≥ 0, x ≥ 0, y ≥ 0 are the constant for the objective function z = x + y. It is solvable for finding optimum value of z? Justify?
Concept: undefined >> undefined
If `int 1/(x + x^5)` dx = f(x) + c, then `int x^4/(x + x^5)`dx = ______
Concept: undefined >> undefined
`int ("e"^x(x - 1))/(x^2) "d"x` = ______
Concept: undefined >> undefined
`int sqrt(1 + sin2x) dx`
Concept: undefined >> undefined
`int (sin4x)/(cos 2x) "d"x`
Concept: undefined >> undefined
`int ("e"^(3x))/("e"^(3x) + 1) "d"x`
Concept: undefined >> undefined
