Answer Posted / priya

dimag maran naal khush nhi hona program nhi aaune buhut
difficult aa bye bye

Describe the complexity of Quick Sort

545

---

Which is faster arraylist or hashmap?

521

---

How do you find the size of an arraylist?

401

---

Is hashset a collection?

458

---

Which sorting has less time complexity?

494

---

---

Can arraylist store primitives?

451

---

Can arraylist contain null?

461

---

What is difference between list set and map?

472

---

How do you separate zeros from non-zeros in an array?

520

---

Can you override methods of arraylist?

487

---

Calculate the address of a random element present in a 2d array, given base address as ba.

1063

---

Define distributed query and linked server?

545

---

How are the elements of a 2d array are stored in the memory?

603

---

Can we declare array size as a negative number?

601

---

Explain Linked List

560

---