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,

---

What features would you use to build a recommendation algorithm for users?

0 Answers   Twitter,

---

what is software cycle?give a diagramatic representation

0 Answers  

---

what are the minimum requirements for statr testing?

0 Answers   QA,

---

What is Na?ve Bayes Algorithm?

2 Answers  

---

Explain the Canny's Algorithm.

0 Answers   Adobe,

---

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  

---

Tell briefly about the Banker's algorithm and what is it used for?

0 Answers   Impetus,

---

What is local search algorithms?

0 Answers  

---

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

0 Answers   Tech Mahindra,

---

Why size of integer depends on the machine architecture then what the best sorting algorithm and why?

0 Answers   HPCL, Hughes Systique Corporation,

---

What are the disadvantages of depth-first search algorithm?

0 Answers  

---