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
- 6480 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 are threaded binary trees?
Explain what are the types of collision resolution techniques and the methods used in each of the type?
How many sorting techniques are there?
What is linear and non linear structure?
in tree construction which is the suitable efficient data structure? (Array, linked list, stack, queue)
What is stable sort?
Which is the best book for data structures and algorithms?
What is difference between hashmap and hashset?
How do you find the complexity of a bubble sort?
Define hash function?
What is a Queue? Explain its operation with example?
How can someone display singly linked list from first to last?
Define in brief an array. What are the types of array operations?
What is difference between hashmap and arraylist?
Can we use Generics with the array?
