What is the logic to reverse the array?

0 Answers  

---

What is red black tree in 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,

---

which notations are used in evaluation of arithmetic expressions using prefix and postfix forms?

0 Answers  

---

why do tree always takes o(log n) time?

2 Answers   TCS,

---

Can a class have a constructor?

0 Answers  

---

Does array sort mutate?

0 Answers  

---

Convert following infix expression to the prefix expression. a - b + c * (d / e - (f + g))

33 Answers   Amazon, Microsoft, Star Technologies, Sun Microsystems, Wipro,

---

Is hashmap an object?

0 Answers  

---

What is the meaning of anonymous array? Explain with an example?

0 Answers  

---

What is a data structure? What are the types of data structures?

0 Answers  

---

Why do we use collections?

0 Answers  

---