What is simulated annealing algorithm?

0 Answers  

---

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

0 Answers   Aspire, Infogain,

---

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

0 Answers   Amazon,

---

Consider the following algorithm: for ( i = 2 ; i <= n ; i++) { for ( j = 0 ; j <= n) { cout << i << j ; j = j + floor(n/4) ; } } (a) What is the output when n = 4 (b) What is the time complexity T(n). You may assume that n is divisible 4.

0 Answers  

---

Give an algorithm for the following problem. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is minimized. You may assume that n is a multiple of 2.

0 Answers  

---

what is software cycle?give a diagramatic representation

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 are the disadvantages of depth-first search algorithm?

0 Answers  

---

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

0 Answers   Tech Mahindra,

---

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

0 Answers  

---

What is Back propagation in Neural Networks?

1 Answers  

---

list the types of linked list with aid of diagram?

0 Answers  

---