What is the iterative deepening depth-first search algorithm?

0 Answers  

---

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

0 Answers  

---

What is the uniform cost search algorithm?

0 Answers  

---

What are the disadvantages of breadth-first search algorithm?

0 Answers  

---

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

0 Answers   Tech Mahindra,

---

What features would you use to build a recommendation algorithm for users?

0 Answers   Twitter,

---

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

0 Answers  

---

list the types of linked list with aid of diagram?

0 Answers  

---

Sorting algorithms and time complexity of various algorithms.

0 Answers   InterGraph,

---

A* algorithm is based on which search method?

0 Answers  

---

What do you mean by overfitting and underfitting algorithms?

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  

---