Define double linked list?

0 Answers  

---

Is there any difference between int[] a and int a[]?

0 Answers  

---

difference between the run time polymorphism and compile time poly morphism and about virtual function.

2 Answers   CybAge, Innowe, TCS, Wipro,

---

What do you mean by spanning tree?

0 Answers   TCS,

---

What happens if we try to insert duplicate key in hashmap?

0 Answers  

---

What are all the classes and interfaces that are available in the collections?

0 Answers  

---

Can a tree be empty?

0 Answers  

---

How to get largest and smallest number in an array?

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,

---

Discuss how to implement queue using stack.

0 Answers  

---

Explain recursive function & what is the data structures used to perform recursion?

0 Answers   TCS,

---

What is placement new in data structures?

0 Answers  

---