How do you take millions of users with 100's of transactions each, amongst 10000's of products and group the users together in a meaningful segments?

488

---

How can you solve a problem that has no solution?

358

---

Write a function to check whether a particular word is a palindrome or not.

380

---

How can you decide if one algorithm is better than the other?

500

---

Explain the Canny's Algorithm.

1046

---

What do you mean by Data mining?

95

---

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

1301

---

Define Routing Algorithm?

1123

---

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

1060

---

Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.

1057

---

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).

1004

---

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.

1328

---

Sorting algorithms and time complexity of various algorithms.

1065

---

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

1090

---

Why size of integer depends on the machine architecture then what the best sorting algorithm and why?

1049

---