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

0 Answers  

---

Given a series of positive integers. Design an efficient algorithm that can detect pairs whose sum is equal to K such that K = ei + ej, and (i not equal to j).

0 Answers   Expedia,

---

Which is the most straight forward approach for planning algorithms?

0 Answers  

---

1. Consider the following algorithm: for ( i = 1 ; i <= 1 . 5 n ; i++) cout << i ; for ( i = n ; i >= 1 ; i - - ) cout << i ; (a) What is the output when n = 2, n = 4, and n = 6? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

0 Answers  

---

Give a general algorithm for converting a m-array tree to a 2-ary tree.

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  

---

What are the disadvantages of depth-first search algorithm?

0 Answers  

---

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

0 Answers  

---

What is iterative deepening depth-first search algorithm?

0 Answers  

---

Which language is used for artificial intelligence?

0 Answers   Flextronics,

---

Explain the Canny's Algorithm.

0 Answers   Adobe,

---

What is the most efficient way to store 1 million phone numbers memory-wise?

0 Answers   Aspire, Infogain,

---