Roll No. .....................................

Total Pages: 07

7302
M. B. A. II Semester Examination, 2019
MANAGEMENT SCIENCE

Time: Three Hours

Maximum Marks: 80

PART – A ¼[k.M & v½ [Marks: 20]

Answer all questions (50 words each).
All questions carry equal marks.
lHkh iz’u vfuok;Z gSAa izR;sd iz’u dk mŸkj 50 'kCnksa ls vf/kd u gksA
lHkh iz’uksa ds vad leku gSAa
PART – B ¼[k.M & c½ [Marks: 40]
Answer five questions (250 words each).
Selecting one from each unit. All questions carry equal marks.
izR;sd bdkbZ ls ,d&,d iz’u pqurs gq,] dqy ik¡p iz’u dhft,A
izR;sd iz’u dk mŸkj 250 'kCnksa ls vf/kd u gksA
lHkh iz’uksa ds vad leku gSAa
PART – C ¼[k.M & l½ [Marks: 20]
Answer any two questions (500 words each).
All questions carry equal marks.
dksbZ nks iz’u dhft,A izR;sd iz’u dk mŸkj 500 'kCnksa ls vf/kd u gksA
lHkh iz’uksa ds vad leku gSAa

[7302] Page 1 of 7
 PART – A @ [k.M & v
Q.1 Answer all questions -
lHkh iz’uksa ds mÙkj ns&
a
(a) What do you mean by management science?
izc/a ku foKku ls vkidk D;k vfHkizk; gS\
(b) What is slack variable?
LySd pj D;k gS\
(c) What is Unbalanced Problem in Assignment?
vlkbuesVa esa vlarqfyr leL;k D;k gS\
(d) Write any two quantitative methods.
dksbZ Hkh nks ek=kRed fof/k;k¡ fyf[k,A
(e) What is Goal Programming?
y{; izkx
s zkfeax D;k gS\
(f) Find value of game:
[ksy ds ewY; dk irk yxk,a&
C1 C2
R1 12 8
R2 10 6

(g) Explain waiting line.

drkj fu;e dks le>k,aA
(h) What is EOQ?
EOQ D;k gS\
(i) What is EMV in Decision Theory?
fu.kZ; fl)kar esa EMV D;k gS\
(j) Full form of PERT and CPM.
PERT rFkk CPM dk iwjk ukeA
[7302] Page 2 of 7

https://exams.freshersnow.com/category/entrance-exam-question-papers/
 PART – B @ [k.M & c
UNIT – I@ bdkbZ – I
Q.2 Solve the following problem by Graphical Method:
js[kh; fof/k ls fuEu leL;k gy dhft,&
Max. (Z) = 2x + 3y
Sub to : 3x + 6y ≤ 18
5x + 2y ≤ 10
x, y ≥ 0
OR@ vFkok
Q.3 Write the procedure of solving the LP Problem by Simplex method.
flaIysDl fof/k }kjk ,yih leL;k dks gy djus dh izfØ;k fy[ksAa
UNIT – II@ bdkbZ – II
Q.4 Solve the following Assignment Problem:
fuEu vlkbuesVa leL;k dks gy dhft,&
M1 M2 M3 M4
P1 12 15 11 10
P2 8 13 14 16
P3 10 12 13 16
P4 12 14 11 15

OR@ vFkok
Q.5 Solve the following transportation problem for minimum cost :
U;wure ykxr ds fy, fuEufyf[kr ifjogu leL;k dk lek/kku djsa %
Warehouse Store Supply
W X Y Z
A 12 7 10 10 40
B 10 9 12 10 30
C 14 12 9 12 20
Demand 30 25 15 10

[7302] Page 3 of 7

https://exams.freshersnow.com/category/entrance-exam-question-papers/
 UNIT – III@ bdkbZ – III
Q.6 What is Dominance Rule in Game Theory? Explain with example.
xse F;ksjh esa izHkkfodrk dk fu;e D;k gS\ mnkgj.k lfgr le>kb,A
OR@ vFkok
Q.7 Solve graphically the game whose payoff matrix is given below :
xzkfQdy fof/k }kjk xse dks gy djsa ftldk isvkWQ eSfVªDl uhps fn;k x;k gS %
Player B

B1 B2
Player A A1 -5 8
A2 3 -4
A3 -1 -2
A4 -2 4

UNIT – IV@ bdkbZ – IV

Q.8 Write short notes on (Any two)-
fdlh Hkh nks ij laf{kIr uksV fy[ks&
a
(a) Arrival Rate
vkxeu nj
(b) Difference between Reorder Level (ROL) and Reorder Period (ROP).
fjvkMZj ysoy ¼vkjvks,y½ vkSj fjvkWMZj vof/k ¼vkjvksih½ ds chp varjA
(c) Server
loZj
OR@ vFkok
Q.9 Arrivals at a telephone booth are considered to be Poisson, with an average time of 10
minutes between one arrival and the next. The length of a phone call is assumed to be
distributed exponentially, with a mean of 3 minutes.
,d VsyhQksu cwFk ij vkxeu dks ikWbt+u ekuk tkrk gS] ftlesa ,d vkxeu vkSj vxys ds chp 10
feuV dk vkSlr le; gksrk gSA ,d Qksu dkWy dh yackbZ dks 3 feuV ds chp rsth ls forfjr fd;k
tkuk ekuk tkrk gSA
[7302] Page 4 of 7

https://exams.freshersnow.com/category/entrance-exam-question-papers/
 (a) What is the probability that a person arriving at the booth will have to wait?
D;k laHkkouk gS fd cwFk ij igqp
a us okys O;fDr dks bartkj djuk gksxk\
(b) What is the average length of the queue that forms from time to time?
le; & le; ij cuus okyh drkj dh vkSlr yackbZ D;k gS\
(c) What is the expected number of customers in the system?
iz.kkyh esa xzkgd dh visf{kr la[;k D;k gS\
(d) What is the expected waiting time of a customer in the queue?
drkj esa xzkgd dh izrh{kk vof/k D;k gS\
UNIT –V@ bdkbZ – V
Q.10 Following payoff matrix is given :
uhps is&vkWQ eSfVªDl fn;k x;k gS %

PAY OFF ¼ykHk½ MATRIX

EVENTS PROBABILITY A1 A2 A3 A4
E1 .2 50 45 40 35
E2 .3 40 60 55 50
E3 .4 30 50 70 65
E4 .1 20 40 60 80
TOTAL 1

Select alternative by -
fodYi pqusa &
(i) Maximax Criteria
eSDlh & eSDl iz.kkyh
(ii) Maximin Criteria
eSdlh & feu iz.kkyh
(iii) Laplace Criteria
ykIykl iz.kkyh
(iv) Hurwicz if alpha = .6
gfoZPt+ ;fn ,YQk ¾ -6
(v) EMV
bZ ,e oh
[7302] Page 5 of 7
 OR@ vFkok
Q.11 A retailer deals in perishable commodity. The daily demand and supply are random
variables. The data for the past 600 trading days, show the following demand and supply:
,d [kqnjk foØsrk [kjkc gksus okyh oLrq esa lkSnk djrk gSA nSfud ekax vkSj vkiwfrZ ifjofrZr pj gSAa
fiNys 600 dk;Z fnolksa dk MsVk] fuEufyf[kr ekax vkSj vkiwfrZ dks n’kkZrk gS %
Supply in kg No. of Days Demand in kg No. of days
10 60 10 90
20 120 20 180
30 180 30 120
40 60 40 60
50 90 50 60
60 90 60 90
The retailer buys the commodity at `20 per kg and sells it at `30 per kg. Any commodity
that remains at the end of the day, has no saleable value. Moreover the loss (unearned
profit) on any unsatisfied demand is `10 per kg.
QqVdj foØsrk deksfMVh dks 20 ` izfr fdyks esa [kjhnrk gS vkSj bls 30 ` izfr fdyks ij csprk gSA
dksbZ Hkh oLrq fnu ds var esa cprh gS] mldk dksbZ Hkh fcØh ;ksX; ewY; ugha gSA blds vykok fdlh
Hkh vlaxr ekax ij uqdlku ¼vuftZr ykHk½ 10 ` izfr fdyks gSA

Given the following random numbers in pairs, first is for supply and second is for
demand. Simulate 8 day sales, demand and profit.
tksM+s esa fuEufyf[kr ;kn`fPNd la[;k, gS]a igyh vkiwfrZ ds fy, vkSj nwljh ekax ds fy, gSA 8 fnu
dh fcØh] ekax vkSj ykHk dh x.kuk djsAa
¼30] 20½] ¼65] 84½] ¼15] 79½] ¼07] 99½] ¼41] 76½] ¼80] 27½] ¼85] 08½] ¼55] 45½
PART – C @ [k.M & l
Q.12 Solve the following LPP by Simplex method :
flaIysDl fof/k }kjk fuEufyf[kr ,yihih dks gy djsa %
Max (Z) : 4x + 3y
Sub to : 2x + y ≤ 30
x + 2y ≤ 24
x, y ≥ 0
[7302] Page 6 of 7
Q.13 Explain in detail some basic quantitative methods used in solving business problems.
O;kikj dh leL;kvksa dks gy djus esa mi;ksx fd, tkus okys dqN cqfu;knh ek=kRed rjhdksa ds ckjs
esa foLrkj ls crk,aA
Q.14 Write short note on any two :
fdlh Hkh nks ij laf{kIr fVIi.kh fy[ksa %
(a) Integer Programming
baVhtj izkx
s zkfeax
(b) Branch Algorithm
'kk[kk ,YxksfjFke
(c) Two person zero sum game
nks O;fDr 'kwU; ;ksx [ksy
Q.15 If monthly demand = 750 units, ordering cost = `10, unit price = `100 and carrying
cost = 2%, calculate :
;fn ekfld ekax ¾ 750 bdkbZ;k¡] vkns’k ykxr ¾ `10] bdkbZ ewY; ¾ `100 vkSj
ogu ykxr ¾ 2% gks] rks Kkr dhft, %
(a) EOQ and Total Variable Cost
EOQ ,oa dqy ykxr
(b) Total Cost of Inventory
bUosVa jh dh dqy ykxr
(c) No. of orders in a year
,d o"kZ esa vkns’kksa dh la[;k
Q.16 From the following network, determine :
(a) EST, LST, EFT, and LFT
(b) Total Float, Free Float and Independent Float
fuEufyf[kr usVodZ ls Kkr dhft, %
(a) bZ,lVh] ,y,lVh] bZ,QVh vkSj ,y,QVh
(b) VksVy ¶yksV] Ýh ¶yksV vkSj bafMisM
a Vsa ¶yksV

Activity 1−2 1−3 1−4 2−5 3−6 3−7 4−7 5−8 6−8 7−9 8−9
Time 5 7 8 4 8 6 7 8 5 6 7

-----------------------------------------

[7302] Page 7 of 7