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

0 Answers   Impetus,

---

What is greedy best first search algorithm?

0 Answers  

---

Given a sorted array of n integers that has been rotated i(unknown) number of times, give a (log n) algorithm that finds an element in the array.

0 Answers   Expedia,

---

What is iterative deepening depth-first search algorithm?

0 Answers  

---

Which language is used for artificial intelligence?

0 Answers   Flextronics,

---

---

Sorting algorithms and time complexity of various algorithms.

0 Answers   InterGraph,

---

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

0 Answers  

---

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 search algorithm will use a limited amount of memory in an online search?

0 Answers  

---

How does deep learning contrast with other machine learning algorithms?

0 Answers  

---

Consider the following algorithm, where the array A is indexed 1 through n: int add_them ( int n , int A[ ] ) { index i , j , k ; j = 0 ; for ( i = 1 ; i <= n ; i++) j = j + A[i] ; k = 1 ; for ( i = 1 ; i <= n ; i++) k = k + k ; return j + k ; } (a) If n = 5 and the array A contains 2, 5, 3, 7, and 8, what is returned? (b) What is the time complexity T(n) of the algorithm?

0 Answers  

---

Explain the Canny's Algorithm.

0 Answers   Adobe,

---