Interested to Buy Any Domain ? << Click Here >> for more details...
Explain what is linear search?
- 0 Answers
- 927 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
What should I learn first data structures or algorithms?
What is difference between list and array?
What is bubble sort used for?
Is learning data structures necessary?
What is the difference between a stack and an array?
What is difference between rb tree and avl tree?
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.
Explain exception filter?
What is meant by int?
Is hashmap ordered?
What is heap with example?
What is linear-logarithm chasm?
Windows 
