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
- 35089 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / siya
100 comparisons
| Is This Answer Correct ? | 7 Yes | 3 No |
Post New Answer View All Answers
Explain about map and their types?
Define parent node?
Define non linear data structure.
Differentiate between comparable and comparator.
What are different methods of collision resolution in hashing.
Difference between arraylist and linkedlist?
What do you mean by priority queue?
Is binary tree balanced?
Write an algorithm to show the postfix expression with the input given as : a b + c d +*f ? .
An array having 100 elements have numbers from 1 to 99 randomly out of which any number is repeated. Find the repeated number in minimum time and space complexity.
Write the advantage of separate chaining?
What is ordered map?
How to find the duplicate in an array?
Write a Program for Insert in a sorted list
What is bubble sort and quick sort?
