Interested to Buy Any Domain ? << Click Here >> for more details...
I am given a sequential algorithm that does a routine search
on an unordered list. N = 20.
The probability that the value x does NOT appear in the list
is exactly 60%, and the probability that x DOES appear is 40%.
The 3 questions that I could not get were:
A) What is the avg number of element comparisons performed
when n = 20 and x does NOT appear in the List.
(my answer was 20, is this correct?)
B) What is the avg number of element comparisons peformed
when n = 20 and x DOES appear in the list?
C) What is the avg number of element comparisons performed
when n = 20. This should be a single number answer they said.
- 3 Answers
- 6426 Views
- I also Faced
- E-Mail Answers
Answer Posted / ranjit
The second answer is partially correct.
a) 20. It will take 20 comparisons to determine that x does not appear in the unordered list of size N.
b) Assuming that x is equally likely to be in any of the 20 positions in the list, the average number of comparisons will be (1 + 2 + ... + 20)/20 = 10.5.
c) 20*0.6 + 10.5*0.4 = 16.2
| Is This Answer Correct ? | 9 Yes | 0 No |
Post New Answer View All Answers
Are the expressions arr and &arr same for an array of integers?
What does the dummy header in the linked list contain?
Does treemap preserve order?
Which type of memory allocation is referred for linked list?
Tell me how to find middle element of linked list in one pass?
What is data type with example?
What are linked lists most commonly used for?
List the differences between comparable and comparator interface?
What is garbage collection in data structure?
What is data structure explain in detail?
Which language is best for data structures?
What happens when arraylist is full?
Can we store null in arraylist?
What is a multiset table?
Does treeset allow null?
