What are disadvantages uniform cost search algorithm?
What is meant by uniform cost search algorithm?
When an algorithm is considered completed?
A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.
How are the k-nearest neigh-bors (knn) algorithms different from k-means clustering?
What is Na?ve Bayes Algorithm?
Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.
What is simulated annealing algorithm?
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.
What is the bidirectional search algorithm?
Explain the Canny's Algorithm.
Write the Shortest path algorithm for a graph.
Which algorithm is used for solving temporal probabilistic reasoning?