Page 1 of 3

USN 1 D A
20EPE11

Dr. AMBEDKAR INSTITUTE OF TECHNOLOGY, BENGALURU –56

First Semester M.Tech Degree (Autonomous) Examination, 2021

APPLIED MATHEMATICS
MODEL PAPER-1

Time: 3 Hours Maximum Marks: 100

Note: 1. Answer FIVE FULL questions.

2. Answer ANY ONE from Question No.1 and 2, 3 and 4, 5 and 6, 7 and 8, 9 and 10.

BT
Marks CO
Level
1. a) Perform three iterations of the Muller method to find the smallest positive root
10
of the equation x 3 − 5 x + 1 = 0 given that the root lies in (0,1). CO1 L3
Marks
b) Perform two iterations of the linear iteration method by one iteration of the Expand log cos x in
10
CO1 L2
Aitken 2 method to find the root of the equation x − e − x = 0 , x0=1.
Marks

OR
2. a) Perform two iterations of the Newton-Raphson method to solve the system of
equations x 2 + xy + y 2 = 7; x 3 + y 3 = 9 . Use initial approximation as x0=1.5 10
CO1 L2
and y0=0.5 . Marks

b) Perform two iterations of the Chebyshev method to find the smallest positive
10Mark
root of the equation f ( x) = cos x − xe x . Take the initial approximation as s
CO1 L3
x0=1.0.
3 a) Solve the partial differential equation Wave equation utt = 4u xx taking h = 1
upto t=2. The boundary conditions are u (0, t ) = u (5, t ) = 0 , ut ( x,0) = 0 and 10
CO2 L3
u ( x,0) = x (5 − x) . Marks

b) Solve the boundary value problem 2 u t = u xx under the conditions

10
u (0, t ) = u (4, t ) = 0 and u (x,0) = x(4 − x), upto t=5 by taking h = 1 . Marks
CO2 L3

OR

4 a) Solve the boundary value problem u t = u xx under the conditions

u (0, t ) = u (1, t ) = 0 and u (x,0) = sin x, 0  x  1 using Schmidt explicit 10 CO2 L3
Marks
method , take h = 1 / 3 & k = 1 36 .
 Page 2 of 3

b) Solve utt = u xx upto t=0.1 with a spacing of 1 subject to

 20 x 0  x 1 10
u (0, t ) = u (5, t ) = 0, u t ( x,0) = 0 and f (u ( x,0) =  . Marks
CO2 L3
5(5 − x) 1  x  5
5 a) Define a vector space with an example.
6 Marks CO3 L1

b)  3
 
Find the dimension of the subspace H, H=span {v1, v2} where v1 = 6 and
 
2
7 Marks CO3 L2
− 1
v 2 =  0  .
 1 
c) Find the spanning set for the null space of the matrix
− 3 6 − 1 1 − 7 
A =  1 − 2 2 3 − 1 . 7 Marks CO3 L3
 2 − 4 5 8 − 4
OR
6 a) For what value of h the following vectors are linearly independent?

1 3 − 1 6 Marks CO3 L1


v1 = − 1 v2 = − 5 v3 =  5 
  
 4   7   h 
If , prove that T is
b) 7 Marks CO3 L2
one-one linear transformation. Is T onto?
c)
Show that the set (a − 3b, b − a, a, b ) / a, b  R is a sub-space of R4 7 Marks CO3 L3
7 a)
1 2 2
  10
CO4 L2
Use Jacobi method find all the eigen values of A =  2 3 2 Marks
 2 2 1 

b)
Find the cubic splines and evaluate y(1.5) and y (3) for the following
values of x and y 10
CO4 L3
Marks
x 1 2 3 4

y 1 2 5 11
OR

8 a) Apply Hermite’sformula to interpolate for sin(1.05) from the following

data
10
x 1.00 1.10 CO4 L3
Marks
sinx 0.84147 0.89121
cosx 0.54030 0.45360
 Page 3 of 3

b) 1 2 3
Reduce the matrix A = 2 1 − 1 to tridiagonal form using Given’s

  10Mark
3 − 1 1  s
CO4 L2
method.

9 a)
A factory uses 3 types of machines to produce two types of electronic
gadgets. The first gadget requires in hours 12,4 and 2 respectively on th
three types of machines. The second gadget requires in hours 6,10 and 3
on the machines respectively. The total available time in hours 10 CO5 L3
respectively on the machines are 6000,4000,1800. If the two types of Marks
gadgets respectively fetches a profit of rupees 400 and 1000 find the
number of gadgets of each type to be produced for getting the maximum
profit.
b)
Use simplex method to minimize P=x-3y+2z subject to the constraints 10Mark CO5 L2
3 x − y + 2 z  7; − 2 x + 4 y  12; − 4 x + 3 y + 8 z  10; x, y, z  0 . s

OR
10 a) Solve the following LPP graphically, maximize Z=3x+5y subject to
x + 2 y  2000 , x + y  1500 , y  600 , x, y  0 . 8Marks CO5 L2

b) Maximize P=6x+2y+3z subject to the constraints 6 x + 5 y + 3 z  26 ,

12
4 x + 2 y + 5 z  7 , x  0, y  0, z  0 by applying simplex method. Marks
CO5 L3