Can you list some use cases where classification machine learning algorithms can be used?

0 Answers  

---

Which algorithm is used for solving temporal probabilistic reasoning?

0 Answers  

---

What is simulated annealing 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,

---

Explain the Canny's Algorithm.

0 Answers   Adobe,

---

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  

---

Define Routing Algorithm?

0 Answers   Maveric,

---

What is greedy best first search algorithm?

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  

---

Give an algorithm for the following problem. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is minimized. You may assume that n is a multiple of 2.

0 Answers  

---

When an algorithm is considered completed?

0 Answers  

---

What are the disadvantages of breadth-first search algorithm?

0 Answers  

---