Is list an array?
What happens when arraylist is full?
Which is better bubble sort or selection sort?
Is hashmap keyset ordered?
Explain the uses of binary tree.
What is data type and its types?
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.
What is subtree?
What do you mean by union-by-weight?
Define union-by-weight?
What does enum do?
Which is faster hashmap or concurrenthashmap?
What are the tasks performed during preorder traversal?