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.

0 Answers  

---

what is software cycle?give a diagramatic representation

0 Answers  

---

What is Back propagation in Neural Networks?

1 Answers  

---

What is the iterative deepening depth-first search algorithm?

0 Answers  

---

What do you mean by overfitting and underfitting algorithms?

0 Answers  

---

Which search algorithm will use a limited amount of memory in online search?

0 Answers  

---

Tell us how will you know which machine learning algorithm to choose for your classification problem?

0 Answers  

---

What features would you use to build a recommendation algorithm for users?

0 Answers   Twitter,

---

What is greedy best first search algorithm?

0 Answers  

---

What is the uniform cost search algorithm?

0 Answers  

---

What are the complexities of sorting algorithms and how can this complexity be calculated?

0 Answers   Tech Mahindra,

---

Consider the following algorithm: j = 1 ; while ( j <= n/2) { i = 1 ; while ( i <= j ) { cout << j << i ; i++; } j++; } (a) What is the output when n = 6, n = 8, and n = 10? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

1 Answers  

---