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
- 31714 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Post New Answer View All Answers
What do you mean by collision in hashing?
Can binary tree have 1 child?
Explain binary representation?
Is map a data structure?
How does linkedhashset work internally?
How do you get placements?
What are the types of data structures?
What does each entry in the link list called?
Write a recursive c function to calculate the height of a binary tree.
Differentiate between failfast and failsafe.
Difference between calloc and malloc in data structures?
What is a concurrenthashmap?
What is heap and its types?
Define linear probing?
What is a Breadth First Search? Give a few of its applications.
