Answer / Syed Azeem Arshad

Sorting algorithms that maintain the relative order of equal elements are called stable sorts. Examples include merge sort, insertion sort, and shell sort. Quick sort is not considered a stable sort because it uses an arbitrary choice of pivot, which can lead to swapping of equal elements.

What is raid (redundant array of inexpensive disks)?

1 Answers  

---

Are sets sorted?

1 Answers  

---

Is queue fifo or lifo?

1 Answers  

---

What are the parts of root node?

7 Answers   BMC, JCE, TCS,

---

Why is hashmap faster than arraylist?

1 Answers  

---

Is pointer a variable in data structure?

1 Answers  

---

What are the parts of a linked list?

1 Answers  

---

what is AVL tree?

5 Answers   ADS, TCS,

---

Explain what is B-tree?

1 Answers   BPL,

---

Can we extend an array after initialization?

1 Answers  

---

What is data structures in computer science?

1 Answers  

---

Define avl tree?

1 Answers  

---