Answer / Mohsin Iqbal

Although efficient for finding shortest paths in unweighted graphs, Breadth-First Search can be less effective in weighted graphs due to its memory requirements. It may also spend too much time exploring high-cost paths if no heuristics are used.

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.

1 Answers  

---

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

1 Answers   Tech Mahindra,

---

What is Back propagation in Neural Networks?

1 Answers  

---

What was deep learning, & how does it contrast with other machine learning algorithms?

1 Answers  

---

What’s your favorite algorithm, & can you explain it into me in less than a minute?

1 Answers  

---

What do you mean by overfitting and underfitting algorithms?

1 Answers  

---

What is greedy best first search algorithm?

1 Answers  

---

Which is the most straight forward approach for planning algorithm?

1 Answers  

---

What is bidirectional search algorithm?

1 Answers  

---

When an algorithm is considered completed?

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,

---

what is software cycle?give a diagramatic representation

1 Answers  

---