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
- 35880 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
How hashmap increases its size?
What is hashing technique? Describe in brief.
What is a multiset table?
Is any implicit arguments are passed to a function when it is called?
Define path in a graph?
What is the quickest sorting algorithm?
Tell me how to find middle element of linked list in one pass?
How to sequentially represent max-heap?
What are arrays give example?
Which is the simplest file structure?
What are the 3 types of measurement?
Is array a data structure?
What is stack and its operations?
Write a program to reverse a link list.
Explain binary searching and Fibinocci search?
