Answer / Ravindra

Linear probing is a collision resolution technique in hash tables where, if a hash function produces a collision, the next empty slot is found by incrementally increasing the index by 1.

Does arraylist allow null values?

1 Answers  

---

Define double linked list?

1 Answers  

---

What is the minimum number of queues that can be used to implement a priority queue?

1 Answers  

---

Define forest?

1 Answers  

---

Which sorting is used in collections sort?

1 Answers  

---

Explain the common uses of threaded binary tree.

1 Answers  

---

Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)

0 Answers  

---

How can I search for data in a linked list?

1 Answers  

---

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

1 Answers  

---

Questions related to arrays, such as given a 2 integer array, find the common elements.

1 Answers   Expedia,

---

Explain set interface?

1 Answers  

---

Which is faster quick sort or merge sort?

1 Answers  

---