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
- 35553 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 is definition list?
Explain the terms base case, recursive case, binding time, run-time stack and tail recursion.
What is binary tree in discrete mathematics?
What is the complexity of arraylist?
Which data structure is used in arraylist?
What is data type with example?
How do you sort pseudocode?
How do you sort an arraylist?
What is entryset method in map?
What are the basic operations of stack?
Explain linear linked implementation of Stack and Queue?
What is the use of substring?
Explain Queue
What are the main differences between the linked list and linear array?
What are stacks? Give some of its applications.
