what are the minimum requirements for statr testing?

0 Answers   QA,

---

What is the iterative deepening depth-first search algorithm?

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 simulated annealing algorithm?

0 Answers  

---

Which is the most straight forward approach for planning algorithm?

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

---

How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?

0 Answers  

---

Define Routing Algorithm?

0 Answers   Maveric,

---

What is the uniform cost search algorithm?

0 Answers  

---

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---

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

0 Answers  

---

There are numbers from 1 to n, which are inverted such that it results in numbers from n to 1. If only two consecutive numbers are stampled at a time and are inverted, how many moves are required?

1 Answers   IBM, TCS,

---