Artificial Intelligence Interview Questions

What is Na?ve Bayes Algorithm?

3004

Explain in detail Neural Networks?

TCS,

8849

What is Back propagation in Neural Networks?

5530

i am a non IT student. answer to the question like why do want to enter to the software line?

5029

Can you explain to me how a machine can think?

1218

Evaluate computationalism, as an account of the mind?

1107

What are Intelligent Agents and Bots on the Internet?

1433

How to use a Bot or Intelligent Agent on the Web?

2062

Are Bots and Intelligent Agents personal search engines?

1816

What is a shopping bot?

1678

What is a chatterbot?

2715

2749

Where to find information on Bots and Intelligent Agents?

1622

Where to find specific information on Search Bots?

2716

What is the original Bot, and is it still available?

1575

Un-Answered Questions { Artificial Intelligence }

can anyone help me with some suggestions and improvemnts for sage line 50?

1476

The Set of actions for a problem in a state space is formulated by a ___________. a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

510

Which depends on the percepts and actions available to the agent? a) Agent b) Sensor c) Design problem d) None of the mentioned

499

_______________ Is an algorithm, a loop that continually moves in the direction of increasing value – that is uphill a) Up-Hill Search b) Hill-Climbing c) Hill algorithm d) Reverse-Down-Hill search

572

Performance Measures are fixed for all agents. State true or false a) True b) False

791

use of intranet facility in infosys

1447

Where does the Bayes rule can be used? a) Solving queries b) Increasing complexity c) Decreasing complexity d) Answering probabilistic query

659

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?

839

Consider a problem of preparing a schedule for a class of student. This problem is a type of a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem

1505

Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned

472

Though local search algorithms are not systematic, key advantages would include a) Less memory b) More time c) Finds a solution in large infinite space d) No optimum solution

737

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.

575

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

697

Fuzzy Set theory defines fuzzy operators. Choose the fuzzy operators from the following. a) AND b) OR c) NOT d) EX-OR

886

What is the rule of simple reflex agent? a) Simple-action rule b) Condition-action rule c) Both a & b d) None of the mentioned

517