Consider the following algorithm: for ( i = 2 ; i <= n ; i++) { for ( j = 0 ; j <= n) { cout << i << j ; j = j + floor(n/4) ; } } (a) What is the output when n = 4 (b) What is the time complexity T(n). You may assume that n is divisible 4.

884

---

please explain.. DB architecture ...

1116

---

What are LINQ query expressions?

11

---

What is ramp signal?

180

---

I am having n number of records in a table which consists of emp-name is one of the field among them. Now i want to change the first letter of every name with capital.

733

---

---

What is oracle d2k? Why we use it?

1

---

What are the commands you'd issue to show the explain plan for "select * from dual"?

1265

---

Why should you override the tostring() method?

182

---

What is the most advanced linux?

95

---

What is bias and variance in a Machine Learning model?

11

---

What is aggregatebykey spark?

25

---

What is dma in an embedded system?

139

---

Which databases are supported by sap bpc with netweaver version?

1

---

Name two immuno diffusion techniques?

31

---

Difference between goto, long jmp() and setjmp()?

246

---