program A and B are analysed and found to have worst case running time greater than 150NlogN and N*N respectively. which program has the better guarantee after the running time for the large values of N(N>10000)? which program has the better guarantee for the running time of small program N (N<100)? which program will run faster on average for N=1000?

0 Answers   St. Pauls University,

---

What if I do not provide the string array as the argument to the method?

0 Answers  

---

please suggest me final year project ideas for computer engg.on java as soon as possible becaus eo want to sumbit project name. and i am very confused.

1 Answers  

---

What is a context in java?

0 Answers  

---

suppose we have one String s="india is my country"; now we get the o/p "like country my is India". what is the logic?

2 Answers  

---

What is flatmap in java8?

0 Answers  

---

Is lambda functional programming?

0 Answers  

---

What is the difference between jar and executable jar?

0 Answers  

---

Why doesn't lsdou work under windows nt? : java security

0 Answers  

---

How can the static main method use instance variables?

0 Answers  

---

what is jdbc?

6 Answers   Cap Gemini,

---

What is loose coupling in java?

0 Answers  

---