OPERATIONS RESEARCH
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2017 - 2018)
SEMESTER - VI
Subject Code 17CS653
IA Marks 40
Number of Lecture Hours/Week 3
Exam Marks 60
17CS653 - OPERATIONS RESEARCH
QUESTIONS BANK
Module 5
These Questions are being framed for helping the students in the "FINAL Exams" Only (Remember for Internals the Question Paper is set by your respective teachers). Questions may be repeated, just to show students how VTU can frame Questions.
- ADMIN
17CS653 - OPERATIONS RESEARCH
Question Bank - MODULE - 5
1. Solve the game using principle of dominance method whose payoff matrix to the player - A is given in the table. (08 Marks) (Dec.2019/Jan.2020)
|
|
Player - B |
||
Player - A |
|
I |
II |
III |
I |
1 |
7 |
2 |
|
II |
6 |
2 |
7 |
|
III |
5 |
2 |
6 |
2. Give a note on basic simulated annealing algorithm and basic genetic algorithm. (08 Marks) (Dec.2019/Jan.2020)
3. Solve the following game graphically. (08 Marks) (Dec.2019/Jan.2020)
|
Player - B |
|||
Player - A |
|
B1 |
B2 |
B3 |
A1 |
2 |
6 |
22 |
|
A2 |
16 |
10 |
4 |
4. Explain briefly the nature of metaheurstics. (05 Marks) (Dec.2019/Jan.2020)
5. Find the value of the game: (03 Marks) (Dec.2019/Jan.2020)
6. Define: i) pure strategy ii) mixed strategy iii) optimal strategy. (06 Marks) (June/July 2019)
7. Solve the following game by dominance principle. (10 Marks) (June/July 2019)
|
|
Player - B |
|||
Player - A |
|
B1 |
B2 |
B3 |
B4 |
A1 |
3 |
2 |
4 |
0 |
|
A2 |
3 |
4 |
2 |
4 |
|
A3 |
4 |
2 |
4 |
0 |
|
A4 |
0 |
4 |
0 |
8 |
8. Solve the following game by graphical method. (06 Marks) (June/July 2019)
|
Player - B |
|||||
Player - A |
|
I |
II |
III |
IV |
V |
I |
2 |
-1 |
5 |
-2 |
6 |
|
II |
-2 |
4 |
-3 |
1 |
0 |
9. Write short notes on i) Genetic algorithm ii) Tabu search algorithm. (10 Marks) (June/July 2019)
10. Write short notes on: i) Simulated annealing algorithm ii) Tabu search algorithm (08 Marks) (Dec.2018/Jan.2019)
11. Using dominance concept, obtain the optimal strategies for both players and determine the value of the game. The payoff matrix for the players is given below. (08 Marks) (Dec.2018/Jan.2019)
|
|
Player - B |
|||
Player - A |
|
B1 |
B2 |
B3 |
B4 |
A1 |
2 |
-2 |
4 |
1 |
|
A2 |
6 |
1 |
12 |
3 |
|
A3 |
-3 |
2 |
0 |
6 |
|
A4 |
2 |
-3 |
7 |
7 |
12. Define the following with reference to game theory: i) Mixed strategy ii) Two person - zero - sum game iii) Pure strategy iv) Saddle point. (08 Marks) (Dec.2018/Jan.2019)
13. Solve the following game graphically: (08 Marks) (Dec.2018/Jan.2019)
|
Player - B |
||||
Player - A |
|
I |
II |
III |
IV |
I |
8 |
5 |
-7 |
9 |
|
II |
-6 |
6 |
4 |
-2 |
14. Explain the following: i) Minimax and Maximin principle. ii) Pure and imixed strategies iii) Two person zero sum game. (06 Marks) (June/July 2018)
15. Solve the following game using the concept of dominance. Write the strategies adopted by each player and find value of game. (10 Marks) (June/July 2018)
|
Player - B |
|||||
Player - A |
|
I |
II |
III |
IV |
V |
I |
6 |
15 |
30 |
21 |
6 |
|
II |
3 |
3 |
6 |
6 |
4 |
|
III |
12 |
12 |
24 |
36 |
3 |
16. Solve the following game by graphical method: (06 Marks) (Dec.2017/Jan.2018| 10 Scheme)
|
Player - B |
|||||
Player - A |
|
I |
II |
III |
IV |
V |
I |
2 |
-1 |
5 |
-2 |
6 |
|
II |
-2 |
4 |
-3 |
1 |
0 |
17. Explain briefly: i) Genetic algorithm ii) Tabu search. (10 Marks) (Dec.2017/Jan.2018| 10 Scheme)
18. Explain the following terms: i) Pure strategy ii) Mixed strategy iii) Saddle point iv) Payoff matrix v) Two--person zero sum game. (10 Marks) (Dec.2017/Jan.2018| 10 Scheme)
19. Obtain the optimal strategies for both persons and the value of the game for zero - sum two - person game whose payoff matrix is as follows: (10 Marks) (Dec.2017/Jan.2018| 10 Scheme)
20. Write a short notes on: (20 Marks) (Dec.2017/Jan.2018| 10 Scheme)
a. Nature of Metaheuristic
b. Tabu Search algorithm
c. Genetic algorithm
d. Simulated Annealing.
21. Explain following terms with example: (i) Saddle point (ii) Value of the game (iii) Payoff matrix (06 Marks) (Dec.2016/Jan.2017 | 10 Scheme)
22. Solve the following game by dominance principle: (07 Marks) (Dec.2016/Jan.2017 | 10 Scheme)
|
Player - B |
|||||
Player - A |
|
I |
II |
III |
IV |
V |
I |
2 |
5 |
10 |
7 |
2 |
|
II |
3 |
3 |
6 |
6 |
4 |
|
III |
4 |
4 |
8 |
12 |
1 |
23. Solve optimally using graphical method by considering the payoff matrix of player A as shown below: (07 Marks) (Dec.2016/Jan.2017 | 10 Scheme)
|
Player - B |
|||||
Player - A |
|
I |
II |
III |
IV |
V |
I |
3 |
6 |
8 |
4 |
4 |
|
II |
-7 |
4 |
2 |
10 |
2 |
24. Explain the following terms:
a. Metaheuristics, advantages and disadvantages
b. Tabu search algorithm
c. Genetic algorithm
d. Simulated annealing (20 Marks) (Dec.2016/Jan.2017 | 10 Scheme)
25. Using the dominance concept, obtain the optimal strategies for both the players and determine the value of game. The pay off matrix for player A is given. (10 Marks) (June/July 2017 | 10 Scheme)
Player - B |
||||||
Player - A |
|
I |
II |
III |
IV |
V |
I |
2 |
4 |
3 |
8 |
4 |
|
II |
5 |
6 |
3 |
7 |
8 |
|
III |
6 |
7 |
9 |
8 |
7 |
|
IV |
4 |
2 |
8 |
4 |
3 |
26. Using Graphical method solve the following: (10 Marks) (June/July 2017 | 10 Scheme)
|
Player - B |
|||
Player - A |
|
I |
II |
III |
I |
1 |
3 |
11 |
|
II |
8 |
5 |
2 |
27. Explain briefly:
a. Metaheuristics
b. Decision trees
c. Simulated annealing
d. Genetic algorithm. (20 Marks) (June/July 2017 | 10 Scheme)
-ADMIN
lIKE OUR CONTENT SUPPORT US BY FOLLOWING US ON INSTAGRAM : @futurevisionbie
ANSWER SCRIP FOR THESE QUESTIONS WILL BE UPLOADED "AS SOON AS POSSIBLE"
Visit: https://hemanthrajhemu.github.io/AnswerScript/
For immediate Notification Join the Telegram Channel
-ADMIN
T = Text book
QB = Question Bank
AS = Amswer Script
-ADMIN