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 the depth-first search algorithm?

0 Answers  

---

What is software cycle? Give a diagrammatic representation?

0 Answers  

---

What is the iterative deepening depth-first search algorithm?

0 Answers  

---

What are disadvantages uniform cost search algorithm?

0 Answers  

---

Which algorithm inverts a complete resolution strategy?

0 Answers  

---

When an algorithm is considered completed?

0 Answers  

---

What is Na?ve Bayes Algorithm?

2 Answers  

---

what is software cycle?give a diagramatic representation

0 Answers  

---

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---

Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.

0 Answers   Aspiring Minds,

---

Consider the following algorithm, where the array A is indexed 1 through n: int add_them ( int n , int A[ ] ) { index i , j , k ; j = 0 ; for ( i = 1 ; i <= n ; i++) j = j + A[i] ; k = 1 ; for ( i = 1 ; i <= n ; i++) k = k + k ; return j + k ; } (a) If n = 5 and the array A contains 2, 5, 3, 7, and 8, what is returned? (b) What is the time complexity T(n) of the algorithm?

0 Answers  

---