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.

1294

---

What is the shortcut keys for creating hyperlink?

355

---

What is the role of action class in struts?

556

---

What are 3 main differences between flexgrid control and dbgrid control?

1873

---

How do you check a value in a range in excel?

292

---

---

What is house keeping in assembler?

591

---

Explain about message selector?

523

---

What r the features,u take care in prototype testing?

1778

---

Tell about the mistake you learned from

681

---

How do I open an xml file in excel?

431

---

What is the difference between inner join and equi join?

490

---

Define the life cycle of a servlets.

570

---

What does threads mean when downloading?

431

---

You can Ask any Technical Question Related to SAP MM Module AT Functional consultant level,Testing or end user level

1637

---

How can the anr be prevented?

554

---