When an algorithm is considered completed?

0 Answers  

---

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---

Which algorithm in ‘unification and lifting’ takes two sentences and returns a unifier?

0 Answers  

---

Which is the most straight forward approach for planning algorithm?

0 Answers  

---

Name search algorithm technology?

0 Answers  

---

What do you mean by overfitting and underfitting algorithms?

0 Answers  

---

Tell briefly about the Banker's algorithm and what is it used for?

0 Answers   Impetus,

---

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

0 Answers  

---

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  

---

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  

---

Tell me how do you choose an algorithm for a classification problem?

0 Answers  

---

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  

---