Interested to Buy Any Domain ? << Click Here >> for more details...
The element being searched for is not found in an array of
100 elements. What is the average number of comparisons
needed in a sequential search to determine that the element
is not there, if the elements are completely unordered?
- 11 Answers
- 35583 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / anirban lahiri
Allmost 50 comparison's are required. Because if we use
double pointer instead of single pointer and we run the
algo. untill we get that element. But that ele. is not in
that unordered list then the algo will stop and produces
"No match is found", when the pointers are superimpossed to
each other. That is we set an algo. of two pointer's in the
front and rear end and when each time the matching is not
found then one pointer is go on increasing and the other
one is go on decreasing( in location ).
| Is This Answer Correct ? | 6 Yes | 24 No |
Define a full binary tree ?
Explain what are the major data structures used in the rdbms?
Explain what is the type of the algorithm used in solving the 8 queens problem?
What are trees in data structures?
Differentiate between queue and deque.
Define non linear data structure.
What is a data structure definition?
List the limitations of linear probing?
Write a program for Sorting an Array. Which sorting will you prefer?
What is difference between hashmap and hashset?
Define depth and height of a node?
Define linear probing?
Windows 
