Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...

AI Algorithms Interview Questions
Questions Answers Views Company eMail

Which language is used for artificial intelligence?

Flextronics,

919

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

Impetus,

912

What is breadth-first search algorithm?

906

What are disadvantages uniform cost search algorithm?

1561

What is depth-first search algorithm?

906

What is iterative deepening depth-first search algorithm?

910

What is simulated annealing algorithm?

1063

What is meant by a * search algorithm?

897

Name search algorithm technology?

966

What are the disadvantages of breadth-first search algorithm?

1045

What is the uniform cost search algorithm?

904

What are the disadvantages of depth-first search algorithm?

1014

What is local search algorithms?

890

What is greedy best first search algorithm?

952

What is bidirectional search algorithm?

1094


Post New AI Algorithms Questions

Un-Answered Questions { AI Algorithms }

What is bidirectional search algorithm?

1094


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

897


Give an algorithm for the following problem. Given a list of n distinct positive integers, partition the list into two sublists, each of size n/2, such that the difference between the sums of the integers in the two sublists is minimized. You may assume that n is a multiple of 2.

2631


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.

2523


What is greedy best first search algorithm?

952


What is breadth-first search algorithm?

906


What is simulated annealing algorithm?

1063


What is the depth-first search algorithm?

919


What is local search algorithms?

890


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

918


Which algorithm inverts a complete resolution strategy?

1116


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

1150


What is software cycle? Give a diagrammatic representation?

838


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

1088


What is the most efficient way to store 1 million phone numbers memory-wise?

1811