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

0 Answers   Tech Mahindra,

---

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

0 Answers  

---

A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.

0 Answers   DELL,

---

What is meant by uniform cost search algorithm?

0 Answers  

---

What features would you use to build a recommendation algorithm for users?

0 Answers   Twitter,

---

---

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

0 Answers   Tech Mahindra,

---

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

0 Answers  

---

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

0 Answers  

---

Name search algorithm technology?

0 Answers  

---

What is meant by a * search algorithm?

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  

---

Given a sorted array of n integers that has been rotated i(unknown) number of times, give a (log n) algorithm that finds an element in the array.

0 Answers   Expedia,

---