Why do we use hashset?

0 Answers  

---

What is the difference between arrays sort and collections sort?

0 Answers  

---

Can nsarray contain nil?

0 Answers  

---

What are the disadvantages of circular list?

0 Answers  

---

Write a program to reverse a link list.

0 Answers   iNautix,

---

State the difference between arrays and linked lists?

0 Answers  

---

How helpful is abstract data type of data structures?

0 Answers  

---

Explain the steps to insert data into a singly linked list?

0 Answers  

---

For which header list, the last node contains the null pointer?

0 Answers  

---

In tree construction which is the suitable efficient data structure?

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,

---

Write the syntax in c to create a node in the singly linked list.

0 Answers  

---