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
- 35896 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Answer Posted / pavan
100
| Is This Answer Correct ? | 19 Yes | 4 No |
Post New Answer View All Answers
Explain what is a spanning tree?
Why quicksort is faster than merge sort?
Name few classes that implement collection interface?
Does treemap allow null values?
List the data structures which are used in hierarchical data model.
Why do we need a data structure?
What is a stable sort?
Discuss the difference between a stack and an Array?
Can we define the size of arraylist?
Write an algorithm for inserting and deleting an element from doubly linked list?
What is sorted map?
Is quicksort a stable algorithm?
What is meant by ordered and sorted in collections?
What’s the difference between enumeration and iterator interfaces?
What do you mean by balanced trees?
