Answer Posted / saurabh teotia

the complexity of linear search is o(n) n that of binary search is o(logn)

What is a treemap used for?

883

---

What are the pre-requisite for the collection to perform binary search?

881

---

Write an algorithm to show various operations on ordered list and arrays

927

---

What is the difference between arraylist and array?

1086

---

Can you have an arraylist of arrays?

946

---

What is linked list in data structure?

1015

---

What are the advantages of selecetion sort?

1086

---

Explain quick sort?

957

---

What does bubble sort do?

806

---

In rdbms, explain what is the efficient data structure used in the internal storage representation?

927

---

What is the use of hashtable?

882

---

How would you swap the Kth node from beginning with Kth node from end in a Linked List.

921

---

Define a relation?

936

---

Tell me the difference between structure and array?

980

---

What do you mean by an Array?

940

---