Sorting algorithms and time complexity of various algorithms.

0 Answers   InterGraph,

---

What is iterative deepening depth-first search algorithm?

0 Answers  

---

Given a series of positive integers. Design an efficient algorithm that can detect pairs whose sum is equal to K such that K = ei + ej, and (i not equal to j).

0 Answers   Expedia,

---

What do you mean by overfitting and underfitting algorithms?

0 Answers  

---

What is the uniform cost search algorithm?

0 Answers  

---

---

How does deep learning contrast with other machine learning algorithms?

0 Answers  

---

What is breadth-first search algorithm?

0 Answers  

---

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

0 Answers  

---

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

0 Answers   Impetus,

---

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

0 Answers   Aspiring Minds,

---

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 me what's your favorite algorithm, and can you explain it to me in less than a minute?

0 Answers  

---