1.Solve the assignment problem.
Find an optimal solution of machines to minimize the total processing
time.
Jobs / Machines→ I II III IV
↓
A 8 26 17 11
B 13 28 4 26
C 38 19 18 15
D 19 26 24 10
(A)Total number of optimal assignments are
2
3
4
5
(B) The method used for assignment problem is called
Modi method
Reduce matrix method
Hungarian method
NWCR
(C)Optimal assignment solution is
59
41
33
69
(D) In marking assignment, which of the following should be proffered.
Only that row which have single zero
Only that column which have single zero
Only column having more than one zero
row=columns
(E) The condition to check given problem has optimal assignment is
m+n-1= no. of allocation
no. of assigned zeros= order of matrix
no. of rows= no. of columns
m+n allocations
2.Using North West corner rule to find the solution of transportation problem.
A B C Supply
I 2 2 3 10
II 4 1 2 15
III 1 3 1 40
DEMAND 20 15 30
(A)Write the IBFS of the transportation problem by using NWCR rule
120
125
100
90
(B)Write the condition of non-degeneracy.
No. of rows= no. of columns
Demand = supply
No. of assignments = order of matrix
M+n-1=independent allocations
(C)Write the optimal cost by Modi’s method.
20
65
75
85
(D)Write the no. of allocations in IBFS.
2
3
4
5
(E)Write the name of method for finding the optimal solution
Modi method
Hungarian method
Vam’s method
NWCR
3.Solve by the Gauss Elimination Method 10x-7y+3z+5u=6 , -6x+8y-z-4u=5 , 3x+y+4z+11u=2 , 5x-9y-2z+4u=7
(A)Write the value of u
-7
-2
0
1
(B)Write the value of y
-4
4
3
-3
(C)Write the value of x
5
2
0
-8
(D)Write the value of z
-4
0
-7
7
(E)Gauss elimination method is
Direct method
Iterative method
Lenghty method
Complicated method
4.Using VAM’s method to find IBFS and find the optimal solution of transportation problem.
A B C D Supply
I 19 30 50 10 7
II 70 30 40 60 9
III 40 8 70 20 18
DEMAND 5 8 7 14
(A)Write the name of method for finding the optimal solution.
Modi method
Hungarian method
Vam’s method
NWCR
(B)Write the IBFS of the transportation problem by using VAM’s method
750
779
620
510
(C) Write the condition of non-degeneracy.
No. of rows= no. of columns
Demand = supply
No. of assignments = order of matrix
M+n-1=independent allocations
(D)Write the optimal cost by Modi’s Method
235
510
743
800
(E)Write the no. of allocations in IBFS.
6
7
5
4
5. Solve by the Gauss Elimination Method 5x+y+z+w=4 , x+7y+z+w=12 , x+y+6z+w=-5 , x+y+z+4w = -6
(A)Write the value of w
-2
0
1
3
(B)Write the value of z
0
1
-1
5
(C) Write the value of y
1
2
8
6
(D) Write the value of x
1
5
6
7
(E) Gauss elimination method is
Direct method
Iterative method
Lenghty method
Complicated method
6.Find the root of 𝑥 3 -3x-5=0 by NRM by taking initial appr…. Is 2|
(A)Write the final root of the equation.
2.27
2.36
2.96
2.88
(B)Write the rate of convergence of Newton Raphson Method.
1
2
1.66
2.25
(C)Write the value of x in second iteration
2.56
2.21
2.45
2.28
(D)Write the value of x in first iteration
2.22
2.33
2.55
2.12
(E)Newton Raphson method based on which theorem.
Intermediate value theorem
Index theorem
Computer programming
Language programming
7.Solve the assignment problem. Find an optimal solution of machines to minimize the total processing
time.
Jobs / Machines→ I II III IV
↓
A 18 26 17 11
B 13 28 14 26
C 38 19 18 15
D 19 26 24 10
(A) The condition to check given problem has optimal assignment is
m+n-1= no. of allocation
no. of assigned zeros= order of matrix
no. of rows= no. of columns
m+n allocations
(B)The method used for assignment problem is called
Modi method
Reduce matrix method
Hungarian method
NWCR
(C)In marking assignment, which of the following should be proffered.
Only that row which have single zero
Only that column which have single zero
Only column having more than one zero
row=columns
(D)Optimal assignment solution is
59
41
33
69
(E) Total number of optimal assignments are
2
3
4
5
8.Find the polynomial which passes through the points (0,-12), (1,0), (3,6) and (4,12)
(A)Write the function value at x=3
6
8
4
2
(B)In interpolation the values of the function are
outside the given range can be found
inside the given range can be found
both inside and outside the range
data
(C) Write the function value at x=2
10
4
12
5
(D)Which of the following formula is not used in interpolation.
Lagrange’s formula
Newton’s forward difference formula
Newton’s divided difference formula
Least square approximation formula
(E)Suppose the desired intermediate value which of the function or say in the first half of the data set then
we need to use.
Forward differences and forward differences table
Backward differences and backward differences table
Central differences
Divided differences
