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

0 Answers   Expedia,

---

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

0 Answers   Impetus,

---

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

0 Answers  

---

What is greedy best first search algorithm?

0 Answers  

---

What is iterative deepening depth-first search algorithm?

0 Answers  

---

A* algorithm is based on which search method?

0 Answers  

---

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

0 Answers  

---

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---

Which algorithm in ‘unification and lifting’ takes two sentences and returns a unifier?

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

0 Answers  

---

What is depth-first search algorithm?

0 Answers  

---

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

0 Answers   DELL,

---