Compare Queue and Topic ?

0 Answers   Tech Mahindra,

---

What are priority queues?

0 Answers  

---

How can you insert a node to the beginning of a singly linked list?

0 Answers  

---

How do you find the space complexity of a bubble sort?

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 worst case complexity algorithm?

0 Answers  

---

Is it necessary to sort a file before searching a particular item ?

0 Answers  

---

What is a comparator function?

0 Answers  

---

Explain different methods in which you can traverse a tree?

0 Answers   NIIT,

---

What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion?

2 Answers   TCS,

---

What is perfect binary tree?

0 Answers  

---

What is a postfix expression?

0 Answers  

---