Answer / Ankur Kumar Dixit

Linear search is a simple searching algorithm used to find an element in a list or array. It sequentially checks each element of the data structure from the beginning until it finds the target element or reaches the end. The time complexity of linear search is O(n), where n is the number of elements in the array.

Why do we need to use computers to help us sort lists?

1 Answers  

---

Which is faster array or arraylist?

1 Answers  

---

Will arraylist maintain insertion order?

1 Answers  

---

How many types of priority queue are there?

1 Answers  

---

Is array part of collection framework?

1 Answers  

---

Which is better bubble sort or selection sort?

1 Answers  

---

What are stacks? Give some of its applications.

1 Answers   TCS,

---

Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1

9 Answers  

---

Can arraylist contain null?

1 Answers  

---

Is list a data type?

1 Answers  

---

Give us a program to reverse a linked list.

1 Answers   DELL, Genpact,

---

How is bubble sort done?

1 Answers  

---