Which is the most straight forward approach for planning algorithms?

0 Answers  

---

Explain the Canny's Algorithm.

0 Answers   Adobe,

---

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 breath-first search algorithm?

0 Answers  

---

Sorting algorithms and time complexity of various algorithms.

0 Answers   InterGraph,

---

What is Na?ve Bayes Algorithm?

2 Answers  

---

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

0 Answers   Tech Mahindra,

---

what is software cycle?give a diagramatic representation

0 Answers  

---

list the types of linked list with aid of diagram?

0 Answers  

---

What is software cycle? Give a diagrammatic representation?

0 Answers  

---

What is meant by a * search 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  

---