Recent questions tagged searching

1 votes
1 answer
2
Finding the location of the element with a given value is :TraversalSearchSortNone of the options
2 votes
1 answer
8
.Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]=i.Ans should be O(log n) right by do...
1 votes
1 answer
13
Suppose A is a sorted array and some of the elements are duplicates. What is the best upper bound to find out the number of elements that are equal to a given key 'k'a)...
0 votes
1 answer
15
Which of the following search method takes less memory ? Depth-first search Breadth-first search Linear search None of the above
0 votes
0 answers
17
3 votes
2 answers
20
Number of comparisons required for an unsuccessful search of an element in a sequential search organized, fixed length, symbol table of length L isLL/2(L+1)/22L
55 votes
8 answers
22
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
To see more, click for the full list of questions or popular tags.