Question
Programming and Data Structure Question on Data Structures
| Match List I with List II | List I | List II | |
|---|---|---|---|
| A | Page replacement Policy | I | Circular wait |
| B | Deadlock | II | Page fault |
| C | Scheduling | III | Shortest job first |
| D | Dijakstra is banking algorithm | IV | Deadlock avoidance |
A
A-II, B-III, C-I, D-IV
B
A-II, B-I, C-III, D-IV
C
A-IV, B-III, C-II, D-I
D
A-III, B-II, C-I, D-IV
Answer
A-II, B-I, C-III, D-IV
Explanation
Solution
The correct option is(B): A-II, B-I, C-III, D-IV