Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


Define rehashing?


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Data Structures Interview Questions

What is difference between rb tree and avl tree?

0 Answers  


Write a Program for Insert in a sorted list

0 Answers  


Differentiate between hashset and treeset.

0 Answers  


What do you mean by 2-3 tree?

0 Answers  


What is data structure and its types?

0 Answers  


Define path in a graph?

0 Answers  


Is copyonwritearraylist thread safe?

0 Answers  


What are different types of algorithms?

0 Answers  


Why do we use insertion sort?

0 Answers  


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  


Explain the uses of b+ tree.

0 Answers  


Who created quicksort?

0 Answers  


Categories