Answer / Sachin Pawar

HashMap provides faster performance because it uses a hash table to store key-value pairs, whereas LinkedHashMap maintains the insertion order which adds an additional overhead.

Why heap sort is not used?

1 Answers  

---

Which interfaces are implemented by concurrentskiplistset?

1 Answers  

---

What is difference between hashmap and treemap?

1 Answers  

---

Is it possible to insert different type of elements in a stack? How?

1 Answers  

---

Two linked lists are given, find out the sum of them without altering the linked list?

1 Answers   Expedia,

---

What do you mean by spanning tree?

1 Answers   TCS,

---

Q#1: An algorithm is made up of 2 modules M1 and M2.If order of M1 is F(n) and order of M2 is g (n) then what is the order of the algorithm. Q # 2 : How many binary trees are possible with 3 nodes? with 4 nodes?

4 Answers  

---

applications of stacks and their uses?

1 Answers   Mind Tree, Samsung,

---

What is an ordered map?

1 Answers  

---

What is array and its types?

1 Answers  

---

List the data structures which are used in rdbms, network data modal, and hierarchical data model.

1 Answers  

---

How do you clear a stack?

1 Answers  

---