Vidyalelo
Computer Science · all questions

Artificial Intelligence
practice.

Practice every MCQ with options. Use Show answers when you want the correct option and solution.

867

Questions

29/44

Page

Pick an option on a question to see the right answer and solution.

Depth-first search always expands the ______ node in the current fringe of the search tree.

Select an option to see the answer and solution.

How the effectiveness of the alpha-beta pruning gets increased?

Select an option to see the answer and solution.

From where did the new fact inferred on new iteration is derived?

Select an option to see the answer and solution.

The total number of logical symbols in AI are ____________

Select an option to see the answer and solution.

In LISP, the function evaluates both and is _____________

Select an option to see the answer and solution.

How many types of image processing techniques are there in image perception?

Select an option to see the answer and solution.

What is state space?

Select an option to see the answer and solution.

Which can be converted to inferred equivalent CNF sentence?

Select an option to see the answer and solution.

Which of the following is an example of artificial intelligent agent/agents?

Select an option to see the answer and solution.

Which of the following are the advantage/s of Decision Trees?

Select an option to see the answer and solution.

One the main drawback of this type of planning system is that it requires a lot of computational powers at each node.

Select an option to see the answer and solution.

The game of Poker is a single agent.

Select an option to see the answer and solution.

One method of programming a computer to exhibit human intelligence is called modeling or __________

Select an option to see the answer and solution.

Which search uses only the linear space for searching?

Select an option to see the answer and solution.

MCC is investigating the improvement of the relationship between people and computers through a technology called ___________

Select an option to see the answer and solution.

The name "best-first search" is a venerable but inaccurate one. After all, if we could really expand the best node first, it would not be a search at all; it would be a straight march to the goal. All we can do is choose the node that appears to be best according to the evaluation function.

Select an option to see the answer and solution.

Which search is complete and optimal when h(n) is consistent?

Select an option to see the answer and solution.

The rule of Universal Instantiation (UI for short) says that we can infer any sentence obtained by substituting a ground term (a term without variables) for the variable.

Select an option to see the answer and solution.

Greedy search strategy chooses the node for expansion in ___________

Select an option to see the answer and solution.

Language/Languages used for programming Constraint Programming includes ____________

Select an option to see the answer and solution.