Define a tree?

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,

---

What is the logic to reverse the array?

0 Answers  

---

How do I remove a value from a list?

0 Answers  

---

What is the types of data structure?

0 Answers  

---

How do you sort a collection in descending order?

0 Answers  

---

What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero)

18 Answers   CSC, National Instruments, Sasken, Sybrant Technologies,

---

What is the advantage of circular linked list?

0 Answers  

---

Explain what is B-tree?

0 Answers   BPL,

---

Can we remove element from arraylist while iterating?

0 Answers  

---

How to cut or remove an element from the array?

0 Answers  

---

Write a program using mergesort technique.

0 Answers   iNautix,

---