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

980

---

Mention one advantage and disadvantage of using quadratic probing?

1021

---

Define adjacent nodes?

1067

---

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

1002

---

Define heap?

1090

---

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

934

---

What do you mean by primary clustering?

1024

---

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

990

---

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

1288

---

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

1035

---

What do you mean by linear probing?

1067

---

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

967

---

What do you mean by rehashing?

1194

---

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

1036

---

What is the need for path compression?

1099

---