Explain the concept behind dead lock avoidance, banker's algorithm.

0 Answers   HPCL, Hughes Systique Corporation,

---

What is Na?ve Bayes Algorithm?

2 Answers  

---

Sorting algorithms and time complexity of various algorithms.

0 Answers   InterGraph,

---

Name search algorithm technology?

0 Answers  

---

What is breath-first search algorithm?

0 Answers  

---

---

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

0 Answers   Aspiring Minds,

---

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

0 Answers   HPCL, Hughes Systique Corporation,

---

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

---

What is iterative deepening depth-first search algorithm?

0 Answers  

---

A* algorithm is based on which search method?

0 Answers  

---

When an algorithm is considered completed?

0 Answers  

---