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
- 6471 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
Define non linear data structure.
State the difference between stacks and linked lists?
Can I provide array size dynamically?
Can you store different types in an array?
Which is the parent class of list
Explain the term binding time?
What are data and data types?
Which is the parent class of printerstatereasons class?
What is array and structure?
Explain what is the data structures used to perform recursion?
What are the benefits of using arrays?
What is data structure explain different types of data structures with examples?
Explain what are the major data structures used in the hierarchical data model?
Are dictionaries mutable?
How do you use merge sort?
