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  

---

What is bidirectional search algorithm?

0 Answers  

---

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---

How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?

0 Answers  

---

What is software cycle? Give a diagrammatic representation?

0 Answers  

---

Which language is used for artificial intelligence?

0 Answers   Flextronics,

---

list the types of linked list with aid of diagram?

0 Answers  

---

What are the disadvantages of depth-first search algorithm?

0 Answers  

---

What is the breadth-first search algorithm?

0 Answers  

---

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

0 Answers  

---

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  

---

Which algorithm inverts a complete resolution strategy?

0 Answers  

---