Answer / Alka Gautam

1. Clustering: When a sequence of elements hash to consecutive positions in the table, it leads to a cluster that affects performance. 2. Load Factor: Linear probing does not allow the load factor (ratio of data and table size) to be high, as it increases the probability of collisions.

What is difference between while and do while?

1 Answers  

---

Are hash tables ordered?

1 Answers  

---

Is unordered_map a hash table?

1 Answers  

---

What is collection sort?

1 Answers  

---

Which is the best book for data structures and algorithms?

1 Answers  

---

How do you sort an array in descending order?

1 Answers  

---

Which data structures are used in bfs and dfs algorithm?

1 Answers  

---

How can you implement a stack?

1 Answers   NIIT,

---

Name few classes that implement collection interface?

1 Answers  

---

State the demerit of linear representation of binary trees?

1 Answers  

---

What does arraylist remove do?

1 Answers  

---

What are splay trees?

1 Answers  

---