- AI Algorithms (14)
- AI Language Processing (11)
- AI Knowledge Representation (12)
- AI Robotics (97)

- AI Recognition (11)
- AI Neural Networks (22)
- AI Fuzzy Logic (21)
- AI Games (4)

- AI Languages (139)
- AI Tools (5)
- AI Machine Learning (0)
- AI General (18)

- AI AllOther (6)

Artificial Intelligence Interview Questions

Questions
Answers
Views
Company
eMail

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.

1012Consider the following algorithm: j = 1 ; while ( j <= n/2) { i = 1 ; while ( i <= j ) { cout << j << i ; i++; } j++; } (a) What is the output when n = 6, n = 8, and n = 10? (b) What is the time complexity T(n)? You may assume that the input n is divisible by 2.

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.

615Consider 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?

889Give 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.

1186

Un-Answered Questions { Artificial Intelligence }

Define procedural knowledge and declarative knowledge.

What is used for tracking uncertain events? a) Filtering algorithm b) Sensors c) Actuators d) None of the mentioned

Data set1 for 2008;1000,2000,3000,1500,2600 Data Set2 for 2007;500,1500,3000,250,4500 How to compare 2008 data versus 2007 data in percentage?

what are the minimum requirements for statr testing?

Briefly describe 5 ways to do a "table lookup" in SAS.

What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned

Evaluate computationalism, as an account of the mind?

What is the consequence between a node and its predecessors while creating Bayesian network? a) Conditionally dependent b) Dependent c) Conditionally independent d) Both a & b

Hill-Climbing approach stuck for the following reasons a) Local maxima b) Ridges c) Plateaux d) All of above

what is software cycle?give a diagramatic representation

perform para-a,is true?it's perform or not?

What is a shopping bot?

You're implementing a medieval strategy game in which pikemen should always walk in front of archers, and catapults should always be behind the archers. Explain how you could implement the movement system to ensure that you keep pikemen in front and catapults in the rear as much as possible. Explain how your answer might be different depending on whether or not the units simply need to end up in that configuration when they reach that destination, or if they need to maintain that formation while moving.

The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. State whether True or False. a) True b) False

Which environment is called as semidynamic? a) Environment does not change with the passage of time b) Agent performance changes c) Environment will be changed d) Both a & b