recategorized by
3,141 views
5 votes
5 votes

Access time of the symbolic table will be logarithmic if it is implemented by

  1. Linear list
  2. Search tree
  3. Hash table
  4. Self organization list
recategorized by

2 Answers

Best answer
6 votes
6 votes
B) search tree ==> O(logn)
selected by
0 votes
0 votes
If we consider Balanced Search Tree then option (B) search tree ,is True.
Answer:

Related questions

64 votes
64 votes
15 answers
1
Arjun asked Jul 6, 2016
36,739 views
Consider the following segment of C-code:int j, n; j = 1; while (j <= n) j = j * 2;The number of comparisons made in the execution of the loop for any $n 0$ is:$\lceil \...
55 votes
55 votes
8 answers
2
Kathleen asked Oct 9, 2014
31,359 views
The average number of key comparisons required for a successful search for sequential search on $n$ items is$\frac{n}{2}$$\frac{n-1}{2}$$\frac{n+1}{2}$None of the above
21 votes
21 votes
7 answers
3
Kathleen asked Oct 4, 2014
18,315 views
Algorithm design technique used in quicksort algorithm is?Dynamic programmingBacktrackingDivide and conquerGreedy method
58 votes
58 votes
7 answers
4
Rucha Shelke asked Sep 26, 2014
27,810 views
Consider the following recurrence:$ T(n)=2T\left ( \sqrt{n}\right )+1,$ $T(1)=1$Which one of the following is true?$ T(n)=\Theta (\log\log n)$$ T(n)=\Theta (\log n)$$ T(n...