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
- 6277 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
Is treeset thread safe?
How does shell sort work?
What is the difference between arraylist and hashmap?
What are control structures?
Difference between arraylist and linkedlist?
Write the c program to insert a node in circular singly list at the beginning.
What is sequential search?
Why concurrenthashmap is fail safe?
Explain the Complete structure of hashmap along with the basic coding of the hashmap internal implementation.
Is priority queue sorted?
State the demerit of linear representation of binary trees?
How will you explain circular linked list?
What is a simple path?
Can we create a null as a key for a map collection?
Define balanced trees?
