Download PTU B.Tech 2020 March CSE-IT 6th Sem IT 310 Operation Research Question Paper

Download PTU (I.K. Gujral Punjab Technical University Jalandhar (IKGPTU) ) BE/BTech CSE/IT (Computer Science And Engineering/ Information Technology) 2020 March 6th Sem IT 310 Operation Research Previous Question Paper

1 | M-71554 (S2)-2198
Roll No. Total No. of Pages : 02
Total No. of Questions : 18
B.Tech.(CSE) (O.E. 2012 to 2017) (Sem.?6)
OPERATION RESEARCH
Subject Code : IT-310
M.Code : 71554
Time : 3 Hrs. Max. Marks : 60
INSTRUCTIONS TO CANDIDATES :
1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks
each.
2. SECTION-B contains FIVE questions carrying FIVE marks each and students
have to attempt any FOUR questions.
3. SECTION-C contains THREE questions carrying TEN marks each and students
have to attempt any TWO questions.

SECTION-A
Explain the following :
1. Artificial Variable
2. Initial Feasible solution
3. Unbalanced transportation problem
4. Least cost method
5. Minimum spanning tree problem
6. Relation between dual and primal
7. Dummy event
8. Payoff matrix
9. Mathematical formulation of the LPP
10. Saddle point


FirstRanker.com - FirstRanker's Choice
1 | M-71554 (S2)-2198
Roll No. Total No. of Pages : 02
Total No. of Questions : 18
B.Tech.(CSE) (O.E. 2012 to 2017) (Sem.?6)
OPERATION RESEARCH
Subject Code : IT-310
M.Code : 71554
Time : 3 Hrs. Max. Marks : 60
INSTRUCTIONS TO CANDIDATES :
1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks
each.
2. SECTION-B contains FIVE questions carrying FIVE marks each and students
have to attempt any FOUR questions.
3. SECTION-C contains THREE questions carrying TEN marks each and students
have to attempt any TWO questions.

SECTION-A
Explain the following :
1. Artificial Variable
2. Initial Feasible solution
3. Unbalanced transportation problem
4. Least cost method
5. Minimum spanning tree problem
6. Relation between dual and primal
7. Dummy event
8. Payoff matrix
9. Mathematical formulation of the LPP
10. Saddle point


2 | M-71554 (S2)-2198
SECTION-B
11. Use Big M method to solve : Maximize Z = x + y subject to constraints : 2x + y ? 4,
x + 7y ? 7, x ? 0, y ? 0.
12. Write differences between PERT and CPM.
13. Solve the travelling salesman problem so as to minimize the cost per cycle C
12
= 20,
C
13
= 4, C
14
= 10, C
23
= 5, C
34
= 6, C
25
= 10, C
35
= 6, C
45
= 20, where C
ij
= C
ji
and there is
no route between cities if a value C
ij
is not shown.
14. Consider a transportation Problem with m = 3 and n = 4 where.
C
11
=2, C
12
= 3, C
13
= 11, C
14
= 7, C
21
= 1,C
22
= 0, C
23
= 6, C
24
= 1, C
31
= 5, C
32
= 8,
C
33
= 15, C
34
= 9 Suppose S
1
= 6, S
2
= 1, S
3
= 10, whereas D
1
= 7, D
2
= 5, D
3
= 3,
D
4
= 2. Use Least cost method to find its solution.
15. State and prove Maximin-Minimax Principle for the selection of the optimal
strategies by the two players, with example.

SECTION-C
16. Use Branch and bound method to solve : Maximize Z = 7x + 9y subject to constraints :
?x + 3y ? 6, 7x + y ? 35, y ? 7; x ? 0, y ? 0 and are integers.
17. Explain {(M/M/1):(N/FIFO)} system and solve it under steady state conditions.
18. Use Simplex method to solve the goal programming problem :
Minimize Z =
1 1 3 2 3 3 2 4 4 1
5 3 Pd P d P d P d P d
? ? ? ? ?
? ? ? ? subject to constraints :

1 2 1 1
80,
? ?
? ? ? ? x x d d
1 2 4 4
90,
? ?
? ? ? ? x x d d
1 2
70,
?
? ? x d
2 3
45,
?
? ? x d
1 2 1 1 2 3 4 4
, , , , , , , 0 x x d d d d d d
? ? ? ? ? ?
?





NOTE : Disclosure of Identity by writing Mobile No. or Making of passing request on any
page of Answer Sheet will lead to UMC against the Student.
FirstRanker.com - FirstRanker's Choice