What is meant by a * search algorithm?

0 Answers  

---

How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?

0 Answers  

---

list the types of linked list with aid of diagram?

0 Answers  

---

Tell me how do you choose an algorithm for a classification problem?

0 Answers  

---

Write the Shortest path algorithm for a graph.

1 Answers   Tech Mahindra,

---

When an algorithm is considered completed?

0 Answers  

---

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

0 Answers  

---

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

0 Answers  

---

What is depth-first search algorithm?

0 Answers  

---

Tell us how will you know which machine learning algorithm to choose for your classification problem?

0 Answers  

---

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

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  

---