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
- 33962 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 |
Name few classes that implement collection interface?
If you do not initialize an array what will happen?
What are the basic operations of stack?
How does variable declaration affect memory allocation?
State the rules to be followed during infix to postfix conversions?
What’s the difference between enumeration and iterator interfaces?
How does a selection sort work?
Mention some drawbacks of the linked list.
What are the two traversal strategies used in traversing a graph?
Define internal nodes?
Which is the parent class of linkedlist class?
What are the disadvantages of sequential storage?
Windows 
