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
- 6280 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
What is the difference between array list and vector list?
Give the example of validating the parenthesis of expression using stack.
How do you access the values within an array?
Is list same as array?
Write an algorithm to find middle element in the linked list.
What is static array?
What is the need for priority queue?
What is the difference between a stack and an array?
Explain the terms base case, recursive case, binding time, run-time stack and tail recursion.
Can hashmap have same key?
How can you insert a node in a random location of the linked list?
What do you mean by hash function?
What is a multiset table?
Is linked list faster than array?
Which is the parent class of enumset class?
