Differentiate between hashset and treeset.
No Answer is Posted For this Question
Be the First to Post Answer
What is bubble sort technique?
Why is sorting and classifying important?
How to initialize Dictionary using collection initialize?
How do you find the height of a binary 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.
Why is map not a collection?
What do you mean by separate chaining?
How many types of linked list exist?
Can hashmap be sorted?
Differentiate between singly and doubly linked lists?
Tell me the difference between structure and array?
What is dynamic array with example?