Explain the Canny's Algorithm.

0 Answers   Adobe,

---

What is the bidirectional search algorithm?

0 Answers  

---

What is the uniform cost search algorithm?

0 Answers  

---

What is meant by uniform cost search algorithm?

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,

---

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  

---

Can you pick an algorithm. Write the psuedo-code for a parallel implementation?

0 Answers  

---

Which algorithm in ‘unification and lifting’ takes two sentences and returns a unifier?

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  

---

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

0 Answers  

---

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

0 Answers  

---