Access time of the symbolic table will be logarithmic if it is implemented by
(A) Linear list
(B) Search tree
(C) Hash table
(D) Self organization list
Answer: (B)
Explanation: Search tree has average O(log n) searching in symbol table. Hashing can have O(n) searching if list is used to resolved Collison.
Option (B) is correct.
Quiz of this Question
Article Tags :
Recommended Articles