Name search algorithm technology?

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 bidirectional search algorithm?

0 Answers  

---

Which language is used for artificial intelligence?

0 Answers   Flextronics,

---

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,

---

Which is the most straight forward approach for planning algorithm?

0 Answers  

---

what is software cycle?give a diagramatic representation

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,

---

Explain the Canny's Algorithm.

0 Answers   Adobe,

---

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

0 Answers   Twitter,

---

How does deep learning contrast with other machine learning algorithms?

0 Answers  

---