edited by
941 views
0 votes
0 votes

​​​​​​Match the items in Column $1$ with the items in Column $2$ in the following table:

\begin{array}{|ll|ll|}
\hline & \text{Column 1} & & \text{Column 2} \\
\hline 
\text{(p)} & \text{First In First Out} & \text{(i)} & \text{Stacks} \\
\text{(q)} & \text{Lookup Operation} & \text{(ii)} & \text{Queues} \\
\text{(r)} & \text{Last In First Out} & \text{(iii)} & \text{Hash Tables} \\
\hline
\end{array}

  1. $(\mathrm{p})-(\mathrm{ii}),(\mathrm{q})-(\mathrm{iii}),(\mathrm{r})-(\mathrm{i})$
  2. $(\mathrm{p})-(\mathrm{ii}),(\mathrm{q})-(\mathrm{i}),(\mathrm{r})-(\mathrm{iii})$
  3. $(\mathrm{p})-(\mathrm{i}),(\mathrm{q})-(\mathrm{ii}),(\mathrm{r})-(\mathrm{iii})$
  4. $(\mathrm{p})-(\mathrm{i}),(\mathrm{q})-(\mathrm{iii}),(\mathrm{r})-(\mathrm{ii})$
edited by

2 Answers

1 votes
1 votes
To match the items in Column 1 with the items in Column 2:

(p) First In First Out               ->   (ii) Queues  

(1) Stacks                                   ->   (1) Last In First Out

(q) Lookup Operation               ->   (iii) Hash Tables

So, the matching pairs are:

(p) First In First Out  matches with (ii) Queues

(q)  Lookup Operation  matches with (iii) Hash Tables

(r)Stacks  matches with (i) Last In First Out

Option A. is the Final Answer.
0 votes
0 votes
$$\begin{array}{|l||}\hline \textbf {Column I} & \textbf{Column II} & \\\hline  \text{P. First In First Out} & \text{ii. Queues}   \\\hline  \text{Q. Lookup Operations} & \text{iii. Hash Table}  \\\hline  \text{R. Last In First Out} & \text{i. Stack}\\\hline  \end{array}$$

Option $(A)$ is correct.
Answer:

Related questions

1.0k
views
1 answers
1 votes
Arjun asked Feb 16
1,013 views
Consider performing uniform hashing on an open address hash table with load factor $\alpha=\frac{n}{m}<1$, where $n$ elements are stored in the table with $m$ slots. The ... )$\frac{1}{1-\alpha}$1+\frac{\alpha}{2}$\frac{1}{1+\alpha}$
1.2k
views
1 answers
0 votes
Arjun asked Feb 16
1,239 views
Consider the following tree traversals on a full binary tree:PreorderInorderPostorderWhich of the following traversal options is/are sufficient to uniquely reconstruct the full binary ... $\text{(ii) only}$
850
views
1 answers
0 votes
Arjun asked Feb 16
850 views
The fundamental operations in a double-ended queue $D$ are: insertFirst (e) - Insert a new element $e$ at the beginning of $D$. insertLast (e) - Insert a new element $e$ at ... removeLast ()The value of $\mathbf{a}$ is $\_\_\_\_\_\_\_\_$.
1.0k
views
2 answers
2 votes
Arjun asked Feb 16
1,045 views
Let $H, I, L$, and $N$ represent height, number of internal nodes, number of leaf nodes, and the total number of nodes respectively in a rooted binary tree.Which of the following ... $H \leq L \leq 2^{H-1}$