AI Algorithms Interview Questions
Questions Answers Views Company eMail

Which language is used for artificial intelligence?

Flextronics,

590

Tell briefly about the Banker's algorithm and what is it used for?

Impetus,

578

What is breadth-first search algorithm?

594

What are disadvantages uniform cost search algorithm?

1227

What is depth-first search algorithm?

582

What is iterative deepening depth-first search algorithm?

560

What is simulated annealing algorithm?

663

What is meant by a * search algorithm?

572

Name search algorithm technology?

636

What are the disadvantages of breadth-first search algorithm?

687

What is the uniform cost search algorithm?

608

What are the disadvantages of depth-first search algorithm?

573

What is local search algorithms?

596

What is greedy best first search algorithm?

601

What is bidirectional search algorithm?

720


Post New AI Algorithms Questions

Un-Answered Questions { AI Algorithms }

Which algorithm is used for solving temporal probabilistic reasoning?

633


Can you list some use cases where classification machine learning algorithms can be used?

537


What are the disadvantages of depth-first search algorithm?

573


What is simulated annealing algorithm?

663


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

627






Draw a flowchart to find the average of four number?

3826


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

744


List the different algorithm techniques in machine learning?

524


what is software cycle?give a diagramatic representation

2121


What is breadth-first search algorithm?

594


What is the breadth-first search algorithm?

538


What is local search algorithms?

596


list the types of linked list with aid of diagram?

2234


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.

2182


Write an algorithm to traverse a knight covering all the squares on a chessboard starting at a particular point.

584