retagged by
3,407 views

2 Answers

0 votes
0 votes

Hash table takes O(1) time in average case, ie, with a not too bad hash function, and a sufficiently large size.

Direct Address Table, however, always gives O(1) time complexity. (it's not used because it's storage requirements are impractical)

Option C

Answer:

Related questions

4 votes
4 votes
3 answers
1
Shimpy Goyal asked Jun 26, 2015
7,827 views
What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by$( ( ) \; ( ( ) ) \; ( ( ) ) ...
0 votes
0 votes
2 answers
2
0 votes
0 votes
2 answers
3
makhdoom ghaya asked Jul 1, 2016
3,365 views
Match the following $:$$\begin{array} {cIcI} & \textbf{List – I} && \textbf{List – II} \\ \text{a.} & \text{DDL} & \text{i.} & \text{LOCK TABLE} \\ \text{b.} & \tex...
2 votes
2 votes
3 answers
4
makhdoom ghaya asked Jul 1, 2016
19,958 views
Let $R =\{A, B, C, D, E, F\}$ be a relation schema with the following dependencies $C \rightarrow F$, $E \rightarrow A$, $EC \rightarrow D$, $A \rightarrow B$. Which of t...