When an algorithm is considered completed?
Which is the most straight forward approach for planning algorithm?
What is the bidirectional search algorithm?
What is greedy best first search algorithm?
what is software cycle?give a diagramatic representation
1. Consider the following algorithm: for ( i = 1 ; i <= 1 . 5 n ; i++) cout << i ; for ( i = n ; i >= 1 ; i - - ) cout << i ; (a) What is the output when n = 2, n = 4, and n = 6? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.
Tell us how will you know which machine learning algorithm to choose for your classification problem?
What is iterative deepening depth-first search algorithm?
How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?
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?
Explain me what's your favorite algorithm, and can you explain it to me in less than a minute?
What is Back propagation in Neural Networks?
List the different algorithm techniques in machine learning?