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
- 35086 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / ntrphanikumar
100 comparisions
since element is not there and the data is unordered we need
to compare with each and every element
| Is This Answer Correct ? | 50 Yes | 7 No |
Post New Answer View All Answers
What method is used to place a value onto the top of a stack?
Which interfaces are implemented by printerstatereasons?
What is the minimum number of queues needed when implementing a priority queue?
What is stack in data structure with the example?
Tell me is it better to use a pointer to navigate an array of values, or is it better to use a subscripted array name?
What is the minimum number of queues that can be used to implement a priority queue?
How do we search a specific element in an array?
What is the use of space complexity and time complexity?
How many types of linked lists are there?
What is the minimization factor and time complexity of b-tree?
Explain the Stack
Explain stacks and queues in detail.
What is return map?
What is linked list ?
Write program for Bubble Sort ?
