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

970

---

Mention one advantage and disadvantage of using quadratic probing?

1011

---

Define adjacent nodes?

1058

---

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

990

---

Define heap?

1082

---

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

924

---

What do you mean by primary clustering?

1013

---

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

984

---

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

1278

---

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

1022

---

What do you mean by linear probing?

1057

---

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

957

---

What do you mean by rehashing?

1182

---

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

1024

---

What is the need for path compression?

1092

---