What are the complexities of sorting algorithms and how can this complexity be calculated?

0 Answers   Tech Mahindra,

---

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

0 Answers  

---

what is software cycle?give a diagramatic representation

0 Answers  

---

Give an example of an O (n) algorithm and O (n*n) algorithm such that the algorithm is slower.

0 Answers   Aspiring Minds,

---

Name search algorithm technology?

0 Answers  

---

Which algorithm inverts a complete resolution strategy?

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  

---

What is iterative deepening depth-first search algorithm?

0 Answers  

---

What is the uniform cost search algorithm?

0 Answers  

---

What are the disadvantages of 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,

---

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

0 Answers   Amazon,

---