Sorting algorithms and time complexity of various algorithms.

0 Answers   InterGraph,

---

Explain the Canny's Algorithm.

0 Answers   Adobe,

---

What are the disadvantages of breadth-first search algorithm?

0 Answers  

---

Define Routing Algorithm?

0 Answers   Maveric,

---

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

0 Answers   Impetus,

---

Consider the following algorithm: j = 1 ; while ( j <= n/2) { i = 1 ; while ( i <= j ) { cout << j << i ; i++; } j++; } (a) What is the output when n = 6, n = 8, and n = 10? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

1 Answers  

---

Explain me what's your favorite algorithm, and can you explain it to me in less than a minute?

0 Answers  

---

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

0 Answers  

---

What is bidirectional search algorithm?

0 Answers  

---

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: for ( i = 2 ; i <= n ; i++) { for ( j = 0 ; j <= n) { cout << i << j ; j = j + floor(n/4) ; } } (a) What is the output when n = 4 (b) What is the time complexity T(n). You may assume that n is divisible 4.

0 Answers  

---