Answer / Ishan Haidar

The most straightforward approach for planning algorithms is the Graph Plan. It represents the problem as a planning graph and uses heuristics to find a plan by searching for a sequence of actions that transforms the initial state into the goal state.

List the different algorithm techniques in machine learning?

1 Answers  

---

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

1 Answers  

---

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

1 Answers  

---

Define Routing Algorithm?

1 Answers   Maveric,

---

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

1 Answers  

---

Which algorithm inverts a complete resolution strategy?

1 Answers  

---

What is software cycle? Give a diagrammatic representation?

1 Answers  

---

What’s your favorite algorithm, & can you explain it into me in less than a minute?

1 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?

1 Answers  

---

What is the uniform cost search algorithm?

1 Answers  

---

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

1 Answers  

---

list the types of linked list with aid of diagram?

1 Answers  

---