recategorized by
6,877 views
3 votes
3 votes

Number of comparisons required for an unsuccessful search of an element in a sequential search organized, fixed length, symbol table of length L is

  1. L
  2. L/2
  3. (L+1)/2
  4. 2L
recategorized by

2 Answers

Best answer
10 votes
10 votes
It should be L only. Here symbol table is implemented as a sequential search table. So, every time one has to search entire table.
selected by
2 votes
2 votes

Since, it is "sequential search"  here "unsuccessful Search" means it should search(go through) for every element in the symbol table,

so,

given L is the length of the symbol table.

then,

for Unsuccessful search,

it is,

no.of comparisons required on average.

so, it is = L.

 

 

Answer:

Related questions

7 votes
7 votes
2 answers
1
go_editor asked Jun 23, 2016
7,827 views
Which of the following algorithm design technique is used in merge sort?Greedy methodBacktrackingDynamic programmingDivide and Conquer
5 votes
5 votes
5 answers
2
go_editor asked Jun 22, 2016
5,000 views
Consider the following pseudocodex:=1; i:=1; while ( x <= 500) begin x:=2^x; i:=i+1; endWhat is the value of $\textsf{i}$ at the end of the pseudocode?$4$$5$$6$$7$
8 votes
8 votes
1 answer
3
shivanisrivarshini asked May 31, 2016
11,387 views
Let $T(n)$ be defined by $T(1) =10$ and $T(n+1)=2n+T(n)$ for all integers $n \geq 1$. Which of the following represents the order of growth of $T(n)$ as a function of $n...
39 votes
39 votes
4 answers
4
Rucha Shelke asked Sep 17, 2014
25,177 views
Which one of the following in place sorting algorithms needs the minimum number of swaps?Quick sortInsertion sortSelection sortHeap sort