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

0 Answers   Impetus,

---

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 are the disadvantages of depth-first search algorithm?

0 Answers  

---

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

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  

---

Give a general algorithm for converting a m-array tree to a 2-ary tree.

0 Answers   Tech Mahindra,

---

What is the breadth-first search algorithm?

0 Answers  

---

can anyone help me with some suggestions and improvemnts for sage line 50?

0 Answers  

---

What is informed (heuristic) search strategies algorithm?

0 Answers  

---

What is Na?ve Bayes Algorithm?

2 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  

---

Define Routing Algorithm?

0 Answers   Maveric,

---