What is comparator interface used for?

0 Answers  

---

Does set allow null values?

0 Answers  

---

What is the height of a binary tree?

0 Answers  

---

Define level of the tree?

0 Answers  

---

Which is better array or linked list?

0 Answers  

---

Is quicksort a stable sorting algorithm?

0 Answers  

---

Explain what do you mean by insertion sort, bubble sort and selection sort? Also, explain the differences among the functionalities of the three sorts.

0 Answers   TCS,

---

Does hashset guarantee order?

0 Answers  

---

What are threaded binary trees?

0 Answers  

---

What is arrays copyof?

0 Answers  

---

What is definition list?

0 Answers  

---

1) Program A and B are analyzed and found to have worst- case running times no greater than 150nlog2n and n2 respectively.Answer the folloWing questions if possible.. i) which program has the better guarantee on the running time,for larger values of n(n>10000) ? ii) which program has the better guarantee on the running time,for small values of n(n<100) ? iii) which program will run faster on average for n =1000 2) wRite a program to compute the number of collisions required in a long random sequence of insertions using linear probing ,quadratic probing and double hashing 3) what is the optimal way to compute A1 A2 A3 A4 A5 A6 where the dimensions of the matrices are A1:10*20 A2 : 20 * 1 A3 : 1 * 40 A4 : 40*5 A5 : 5 * 30 A6 : 30 X 15

5 Answers   KPIT,

---