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,

---

What is software cycle? Give a diagrammatic representation?

0 Answers  

---

list the types of linked list with aid of diagram?

0 Answers  

---

Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.

0 Answers   Amazon,

---

What is local search algorithms?

0 Answers  

---

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  

---

Explain me what's your favorite algorithm, and can you explain it to me in less than a minute?

0 Answers  

---

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

0 Answers   Tech Mahindra,

---

Give an algorithm for the following problem. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is minimized. You may assume that n is a multiple of 2.

0 Answers  

---

Can you list some use cases where classification machine learning algorithms can be used?

0 Answers  

---