Answer Posted / bipin from utkal university mc

suppose there are five element 23,56,78,12,90
minimum time require means searching element present at
first so it takes only one comparison
maximum time require means searching element present at
last so it takes n No. of comparison(here 5 )

so avarage comarison=(1+n)/2

Can we insert null in hashset?

1029

---

Which is the parent class of hashmap class?

1097

---

Explain Array

926

---

What is 1d array?

899

---

What is a string or array type?

784

---

What is example of data?

1041

---

What are the average and worst time complexity in a sorted binary tree is

942

---

what is the difference between dynamic as well as non - dynamic data structures.

926

---

Is arraylist fail fast?

904

---

What is data type and its types?

892

---

What do you mean by data types?

917

---

Which is better merge or quick sort?

909

---

If we add enum constants to a sorted collection ( treemap , treeset ), what will be the order in which they will be maintained?

927

---

List out the advantages of using a linked list?

829

---

Define an algorithm. What are the properties of an algorithm? What are the types of algorithms?

883

---