Which interfaces are implemented by abstractsequentiallist?

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,

---

Mention one advantage and disadvantage of using quadratic probing?

0 Answers  

---

Can we insert null in list?

0 Answers  

---

How do you determine if a binary tree is height balanced?

0 Answers  

---

How do you sort a list in reverse order?

0 Answers  

---

How would you implement two stacks using a single array?

0 Answers   TCS,

---

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

0 Answers  

---

What does it mean to sort an array?

0 Answers  

---

What is the difference between hashset and treeset?

0 Answers  

---

Define balancing condition for AVL Tree.

0 Answers  

---

Tell me the difference between the character array and a string.

0 Answers   Honeywell, HPCL, Huawei, Zomato,

---