Given a series of positive integers. Design an efficient algorithm that can detect pairs whose sum is equal to K such that K = ei + ej, and (i not equal to j).

0 Answers   Expedia,

---

What is the depth-first search algorithm?

0 Answers  

---

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

0 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 diagrammatic representation?

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  

---

Draw a flowchart to find the average of four number?

0 Answers  

---

Name search algorithm technology?

0 Answers  

---

What was deep learning, & how does it contrast with other machine learning algorithms?

0 Answers  

---

What is meant by uniform cost search algorithm?

0 Answers  

---

Write a code/algorithm to find the frequency of each element in an array?

0 Answers   ITC Indian Tobacco Company,

---

When an algorithm is considered completed?

0 Answers  

---