What are the four characteristics of algorithms?
Why heap sort is not used?
Which is faster quick sort or merge sort?
What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm?
Can treemap have null values?
What is dynamic array how it is created?
If you do not initialize an array what will happen?
What is the advantage of the heap over a stack?
What does the term sorting refer to?
Does arraylist maintain insertion order?
What is a data structure? What are the types of data structures?
Can arraylist be empty?
When would you use a hashmap?