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  

---

What are the disadvantages of breadth-first search algorithm?

0 Answers  

---

When an algorithm is considered completed?

0 Answers  

---

Which is the most straight forward approach for planning algorithm?

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’s your favorite algorithm, & can you explain it into me in less than a minute?

0 Answers  

---

Which algorithm is used for solving temporal probabilistic reasoning?

0 Answers  

---

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

0 Answers  

---

What do you mean by overfitting and underfitting algorithms?

0 Answers  

---

Consider the following algorithm: for ( i = 2 ; i <= n ; i++) { for ( j = 0 ; j <= n) { cout << i << j ; j = j + floor(n/4) ; } } (a) What is the output when n = 4 (b) What is the time complexity T(n). You may assume that n is divisible 4.

0 Answers  

---

Tell briefly about the Banker's algorithm and what is it used for?

0 Answers   Impetus,

---

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---