Interested to Buy Any Domain ? << Click Here >> for more details...
Why is it called bubble sort?
- 0 Answers
- 891 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
What is a multiset table?
How to get the index of an array element?
What are the types of Collision Resolution Techniques and the methods used in each of the type?
Explain the difference between hashset and hashmap?
What is the difference between hashset and hashtable?
Define 2-3 tree?
Describe the level term in a tree.
Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78
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 Array
Is vector synchronized?
Why do we use hashset?
Windows 
