What happens when arraylist is full?
No Answer is Posted For this Question
Be the First to Post Answer
Why you need a data structure?
What is priority queue in data structure?
how to delete first node from singly linked list?
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.
Name two algorithms two find minimum spanning tree?
What is a stable sort?
Which is faster hashmap or concurrenthashmap?
Can treemap key null?
What are the disadvantages of linear list?
Can hashmap store null values?
Which is best array or linked list?
What is a reverse linked list.