Does the minimal spanning tree of a graph give the shortest distance between any 2 specified nodes?

1026

---

Mention one advantage and disadvantage of using quadratic probing?

1071

---

Define adjacent nodes?

1141

---

How do you assign an address to an element of a pointer array ?

1053

---

Define heap?

1162

---

Explain what are the types of collision resolution techniques and the methods used in each of the type?

978

---

What do you mean by primary clustering?

1067

---

Why it is said that searching a node in a binary search tree is efficient than that of a simple binary tree?

1033

---

What is the relationship between a queue and its underlying array?

1353

---

What are the types of collision resolution strategies in open addressing?

1088

---

What do you mean by linear probing?

1117

---

In an avl tree, at explain what condition the balancing is to be done?

1012

---

What do you mean by rehashing?

1278

---

What method is used to place a value onto the top of a stack?

1076

---

What is the need for path compression?

1160

---