Match all items in Group 1 with the best match from the options given in Group 2.
|
Group 1 |
Group 2 |
|
P. Min-and max-heaps |
1. File system implementations |
|
Q. B-tree |
2. Priority queue implementations |
|
R. Arrays |
3. Expensive insertion and deletion operations |
|
S. Graphs |
4. Electronic circuit design analysis |
1
P – 2, Q – 3, R – 4, S – 1
2
P – 4, Q – 3, R – 2, S – 1
3
P – 2, Q – 1, R – 3, S – 4
4
P – 3, Q – 4, R – 1, S – 2
5
P – 2, Q – 1, R – 4, S – 3