Define rehashing?
No Answer is Posted For this Question
Be the First to Post Answer
What is difference between rb tree and avl tree?
Write a Program for Insert in a sorted list
Differentiate between hashset and treeset.
What do you mean by 2-3 tree?
What is data structure and its types?
Define path in a graph?
Is copyonwritearraylist thread safe?
What are different types of algorithms?
Why do we use insertion sort?
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 the uses of b+ tree.
Who created quicksort?