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

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  

---

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---

What is greedy best first search algorithm?

0 Answers  

---

Can you pick an algorithm. Write the psuedo-code for a parallel implementation?

0 Answers  

---

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

0 Answers   Tech Mahindra,

---

How does deep learning contrast with other machine learning algorithms?

0 Answers  

---

Tell us why is naïve bayes machine learning algorithm naïve?

0 Answers  

---

Which is the most straight forward approach for planning algorithm?

0 Answers  

---

Sorting algorithms and time complexity of various algorithms.

0 Answers   InterGraph,

---

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

0 Answers  

---

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

0 Answers   Tech Mahindra,

---