Answer / Jitendra Kumar Sahu

The Bidirectional Search algorithm explores the problem space from both the start and goal nodes simultaneously. This can significantly reduce the search time, especially for problems with symmetric solutions.

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---

What is meant by uniform cost search algorithm?

1 Answers  

---

Tell us why is naïve bayes machine learning algorithm naïve?

1 Answers  

---

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

1 Answers   Tech Mahindra,

---

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

1 Answers  

---

Which algorithm inverts a complete resolution strategy?

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,

---

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

1 Answers  

---

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

1 Answers   Amazon,

---

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

1 Answers   DELL,

---

Consider the following algorithm, where the array A is indexed 1 through n: int add_them ( int n , int A[ ] ) { index i , j , k ; j = 0 ; for ( i = 1 ; i <= n ; i++) j = j + A[i] ; k = 1 ; for ( i = 1 ; i <= n ; i++) k = k + k ; return j + k ; } (a) If n = 5 and the array A contains 2, 5, 3, 7, and 8, what is returned? (b) What is the time complexity T(n) of the algorithm?

1 Answers  

---

Which search algorithm will use a limited amount of memory in online search?

1 Answers  

---