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
- 35881 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 |
How many types of data structures are used?
In an avl tree, at explain what condition the balancing is to be done?
How will you represent a linked list in a graphical view?
do records fall under linear or non linear data structures?
Which is the simplest file structure?
Why do we use arrays?
Which interfaces are implemented by concurrentskiplistset?
What is the difference between hashset and treeset?
How to copy an array into another array?
Why do we use dynamic arrays?
What is the bucket size, when the overlapping and collision occur at same time?
Explain stacks and queues in detail.
Windows 
