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

What is array and its types?

1050

---

What are basic algorithms?

959

---

What is stack explain with diagram?

962

---

Explain the steps to insert data into a singly linked list?

934

---

How does a selection sort work for an array?

979

---

What is structured data with example?

946

---

What does bubble sort do?

880

---

What is difference between map and hashmap?

1116

---

Does arraylist guarantee insertion order?

968

---

What is the complexity of arraylist?

1014

---

Which time complexity is best?

950

---

What are the difference between a stack and a queue?

1017

---

What are the tasks performed while traversing a binary tree?

1212

---

List some applications of queue data structure.

981

---

On clicking a node in a tree, all the adjacent edges are turned on. Calculate min of clicks such that all the edges are turned on.

1030

---