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 do you mean by overfitting and underfitting algorithms?

0 Answers  

---

What is the breadth-first search algorithm?

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  

---

How does deep learning contrast with other machine learning algorithms?

0 Answers  

---

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

0 Answers   Twitter,

---

What are the disadvantages of depth-first search algorithm?

0 Answers  

---

What is Na?ve Bayes Algorithm?

2 Answers  

---

Write a code/algorithm to find the frequency of each element in an array?

0 Answers   ITC Indian Tobacco Company,

---

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

0 Answers  

---

What are disadvantages uniform cost search algorithm?

0 Answers  

---

Explain the Canny's Algorithm.

0 Answers   Adobe,

---