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
- 6427 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
How do you find the complexity of a bubble sort?
What are the advantages of sorting and filtering data?
Is set sorted?
What are doubly linked lists?
Why is selection sort used?
What are the different types of sorting in data structure?
What is significance of ” * ” ?
What are the different types of data structures explain briefly?
Define outdegree of a graph?
What is the difference between hashset and hashmap?
What is collection sort?
Which sorting is best?
How are the elements of a 2d array are stored in the memory?
Is arraylist heterogeneous?
Can we use ordered set for performing binary search?
