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
- 35556 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 |
Are duplicates allowed in hashmap?
Why do we need linked lists?
what is the biggest advantage of linked lists?
What is the top of a stack?
In tree construction which is the suitable efficient data structure?
What is hashing with example?
What is the difference between the hash table and hash map?
Does treeset remove duplicates?
What do you mean by an Array?
What is raid (redundant array of inexpensive disks)? Explain its level?
What is a data structure node class?
What are the types of collision resolution strategies in open addressing?
Windows 
