What is dynamic array with example?

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,

---

example of linear and non-linear data structures?

9 Answers   Aricent, Infosys,

---

Explain circular linked list?

0 Answers  

---

Why quicksort is faster than merge sort?

0 Answers  

---

Explain heapsort. What is its complexity?

0 Answers   Essar,

---

List the data structures which are used in network data modal.

0 Answers  

---

How does a heap sort work?

0 Answers  

---

Define shortest path?

0 Answers  

---

What is sorting explain?

0 Answers  

---

What is collection sort?

0 Answers  

---

Write the importance of hashing?

0 Answers  

---