AI Algorithms Interview Questions
Questions Answers Views Company eMail

What is informed (heuristic) search strategies algorithm?

561

Which is the most straight forward approach for planning algorithm?

685

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

577

Which algorithm is used for solving temporal probabilistic reasoning?

629

Which algorithm inverts a complete resolution strategy?

583

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

740

When an algorithm is considered completed?

1248

A* algorithm is based on which search method?

1161

What is software cycle? Give a diagrammatic representation?

520

List the different algorithm techniques in machine learning?

514

What is the depth-first search algorithm?

594

What is breath-first search algorithm?

568

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

543

What is the breadth-first search algorithm?

531

How does deep learning contrast with other machine learning algorithms?

539


Post New AI Algorithms Questions

Un-Answered Questions { AI Algorithms }

What is breath-first search algorithm?

568


Give a general algorithm for converting a m-array tree to a 2-ary tree.

625


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?

1860


Which language is used for artificial intelligence?

586


Given a series of positive integers. Design an efficient algorithm that can detect pairs whose sum is equal to K such that K = ei + ej, and (i not equal to j).

567






What is local search algorithms?

590


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

505


Consider the following algorithm: for ( i = 2 ; i <= n ; i++) { for ( j = 0 ; j <= n) { cout << i << j ; j = j + floor(n/4) ; } } (a) What is the output when n = 4 (b) What is the time complexity T(n). You may assume that n is divisible 4.

1300


When an algorithm is considered completed?

1248


A lot of questions were asked on sorting for eg. Best algorithm on the basis of number of swaps, number of comparisons etc.

757


What was deep learning, & how does it contrast with other machine learning algorithms?

544


Which algorithm inverts a complete resolution strategy?

583


What is the bidirectional search algorithm?

581


what are the minimum requirements for statr testing?

2237


Which is the most straight forward approach for planning algorithms?

605