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
- 35542 Views
- Morgan Stanley, Wipro, I also Faced
- E-Mail Answers
Post New Answer View All Answers
What is the family trees and connection by clause?
Is quicksort faster than merge sort?
how to add an item to the beginning of the list?
Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.
What is heap tree in data structure?
What is meant by binary tree traversal?
What is the use of bubble sort?
What is the maximum size of array?
What do you mean by shortest path?
What are the Advantages and disadvantages of Array?
What actions are performed when a function is called?
What will happen if an array goes out of bounds?
What is the slowest sorting algorithm?
Explain Linked List
Which is the parent class of list
