Artificial Intelligence Interview Questions
Questions Answers Views Company eMail

What is Na?ve Bayes Algorithm?

2 2036

Explain in detail Neural Networks?


4 6250

What is Back propagation in Neural Networks?

1 4184

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

TCS, Infosys,

2 3791

Can you explain to me how a machine can think?


Evaluate computationalism, as an account of the mind?


What are Intelligent Agents and Bots on the Internet?


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


Are Bots and Intelligent Agents personal search engines?


What is a shopping bot?


What is a chatterbot?

1 1960

What is a trademarkbot?

1 1971

Where to find information on Bots and Intelligent Agents?


Where to find specific information on Search Bots?

1 1917

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


Un-Answered Questions { Artificial Intelligence }

In which of the following agent does the problem generator is present? a) Learning agent b) Observing agent c) Reflex agent d) None of the mentioned


Explain List of programming languages for artificial intelligence?


What is not represented by using propositional logic? a) Objects b) Relations c) Both a & b d) None of the mentioned


What is the minimum time for any program scan in pc


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


Differentiate between documented and undocumented knowledge. 3. How is knowledge collected?


 What does the Bayesian network provides? a) Complete description of the domain b) Partial description of the domain c) Complete description of the problem d) None of the mentioned


he process of removing detail from a given state representation is called______. a) Extraction b) Abstraction c) Information Retrieval d) Mining of data


___________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search


Consider 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.


One of the main cons of hill-climbing search is, a) Terminates at local optimum b) Terminates at global optimum c) Does not find optimum solution d) Fail to find a solution


A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. State whether True or False. a) True b) False


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


Where does the performance measure is included? a) Rational agent b) Task environment c) Actuators d) Sensor


Which search agent operates by interleaving computation and action? a) Offline search b) Online search c) Breadth-first search d) Depth-first search