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

0 Answers  

---

Which is the most straight forward approach for planning 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  

---

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  

---

What is simulated annealing algorithm?

0 Answers  

---

what is software cycle?give a diagramatic representation

0 Answers  

---

What is the iterative deepening depth-first search algorithm?

0 Answers  

---

Which algorithm inverts a complete resolution strategy?

0 Answers  

---

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

0 Answers   Amazon,

---

What are the disadvantages of breadth-first search algorithm?

0 Answers  

---

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

0 Answers   Tech Mahindra,

---

What is depth-first search algorithm?

0 Answers  

---