Explain heapsort. What is its complexity?

0 Answers   Essar,

---

What is a pseudocode example?

0 Answers  

---

Explain the implementation of an AVL tree and Binary tree.

0 Answers   Ittiam Systems,

---

Is treeset synchronized?

0 Answers  

---

List out the basic operations that can be performed on a stack?

0 Answers  

---

What is the main advantage of a linked list?

0 Answers  

---

What is circular queue in data structure?

0 Answers  

---

Can arraylist shrink?

0 Answers  

---

Let the G be a graph with 100 vertices numbered 1 to 100 Two vertices i and j are adjecnt if | i-j| =8 or | i-j| =12. The Number of connected components in G is ?

4 Answers  

---

Is array a dynamic data structure?

1 Answers  

---

Define an algorithm. What are the properties of an algorithm? What are the types of algorithms?

0 Answers  

---

Explain singly linked list in short.

0 Answers  

---