What is the breadth-first search algorithm?

0 Answers  

---

Consider the following algorithm: j = 1 ; while ( j <= n/2) { i = 1 ; while ( i <= j ) { cout << j << i ; i++; } j++; } (a) What is the output when n = 6, n = 8, and n = 10? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

1 Answers  

---

Define Routing Algorithm?

0 Answers   Maveric,

---

Which algorithm is used for solving temporal probabilistic reasoning?

0 Answers  

---

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

0 Answers  

---

What are the disadvantages of depth-first search algorithm?

0 Answers  

---

What is the most efficient way to store 1 million phone numbers memory-wise?

0 Answers   Aspire, Infogain,

---

What is local search algorithms?

0 Answers  

---

What is breath-first search algorithm?

0 Answers  

---

Which is the most straight forward approach for planning algorithm?

0 Answers  

---

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?

0 Answers  

---

Explain the Canny's Algorithm.

0 Answers   Adobe,

---