UPPCL AE 2018:15

Question

Match all items in $\text{Group 1}$ with the $\textbf{best}$ match from the options given in $\text{Group 2}.$

$$\begin{array}{|l|l|} \hline \qquad \quad \textbf{Group 1} & \qquad \qquad \quad \textbf{Group 2} \\\hline \text{P. Min- and max-heaps} & \text{1. File system implementations} \\\hline  \text{Q. B-trees} & \text{2.Priority queue implementations} \\\hline  \text{R. Array} & \text{3. Expensive insertion and deletion operations} \\\hline  \text{S. Graphs} & \text{4. Electronic circuit design analysis} \\\hline \end{array}$$

• A. $\text{P-2, Q-1, R-3, S-4}$
• B. $\text{P-2, Q-3, R-4, S-1}$
• C. $\text{P-4, Q-3, R-2, S-1}$
• D. $\text{P-3, Q-4, R-1, S-2}$

Answer 1

Answer A

Min and max heap used for priority queue implementation

B tree used for file implementation in database

Arrays used for various data structure operations like insertion, deletion, searching, sorting etc.

Graph used for electronic circuit design analysis.