Explain binary searching and Fibinocci search?
Are collections thread safe?
Can you change size of array once created?
Define root?
What is push and pop in stack?
How many types of search algorithms are there?
When is a binary search algorithm best applied?
How do you find the length of an arraylist?
Which is the fastest sorting?
Is quicksort recursive?
What is data type explain?
What are the different types of collections?
Write an algorithm to find middle element in the linked list.