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
- 6466 Views
- I also Faced
- E-Mail Answers
Answer Posted / guest
a) 20 worst case scenario so it will take N comparison
b) 10 average case scenario N/2 omparisons
c) 16 (20*0.6 + 10*0.4 = 16) as stated above
| Is This Answer Correct ? | 17 Yes | 1 No |
Post New Answer View All Answers
Can arraylist shrink?
List the two important key points of depth first search?
Is treeset sorted?
Can arraylist have duplicates?
What is comparable interface?
Does hashset maintain order?
What is complete binary tree and almost complete binary tree?
How to increase stack limit in w3wp.exe?
What is data structure and its classification?
How can avl tree be useful in all the operations as compared to binary search tree?
How does arraylist store data?
Are collections thread safe?
How many types of arrays are there in visual basic?
Where is binary tree used?
What is a string or array type?
