Explain the principle of quicksort. What is its complexity?
What is the use of heap sort?
What is structured data with example?
Write the procedure to convert general tree to binary tree?
Does arraylist have index?
How many passes are required in bubble sort?
Is boolean a data type?
Explain binary searching and Fibinocci search?
In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none
Can we use Generics with the array?
Which interfaces are implemented by linkedlist?
Which algorithm is used in collections sort method?
Why do we use insertion sort?