In tree construction which is the suitable efficient data structure?
(a) Array (b) Linked list (c) Stack (d) Queue (e) none
What are the advantages of linked list over an array?
Which collection class is thread safe?
Why is concurrenthashmap thread safe?
Define double hashing?
Differentiate null and void?
Why sorting algorithms are important?
What is the use of sorting?
How do you initialize an arraylist?
Explain Queue
What is linked list ?
What is array simple?
an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).