Answer / Parvez Alam

An algorithm is considered completed when it achieves its intended goal or purpose.

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

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

1 Answers   Expedia,

---

Which language is used for artificial intelligence?

1 Answers   Flextronics,

---

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

1 Answers  

---

can anyone help me with some suggestions and improvemnts for sage line 50?

1 Answers  

---

What is depth-first search algorithm?

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

1 Answers   Expedia,

---

Which algorithm inverts a complete resolution strategy?

1 Answers  

---

Explain the Canny's Algorithm.

1 Answers   Adobe,

---

Which is the most straight forward approach for planning algorithms?

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

1 Answers  

---