Which algorithm is used for solving temporal probabilistic reasoning?
Which algorithm in ‘unification and lifting’ takes two sentences and returns a unifier?
Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.
How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?
Tell briefly about the Banker's algorithm and what is it used for?
What are the complexities of sorting algorithms and how can this complexity be calculated?
A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
What is simulated annealing algorithm?
What is software cycle? Give a diagrammatic representation?
List the different algorithm techniques in machine learning?
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?
What is local search algorithms?
Define Routing Algorithm?