Explore topic-wise MCQs in Artificial Intelligence.

This section includes 4 Mcqs, each offering curated multiple-choice questions to sharpen your Artificial Intelligence knowledge and support exam preparation. Choose a topic below to get started.

1.

An algorithm A is admissible if ___________

A. It is not guaranteed to return an optimal solution when one exists
B. It is guaranteed to return an optimal solution when one exists
C. It returns more solutions, but not an optimal one
D. It guarantees to return more optimal solutions
Answer» C. It returns more solutions, but not an optimal one
Discussion
2.

What is the problem space of means-end analysis?

A. An initial state and one or more goal states
B. One or more initial states and one goal state
C. One or more initial states and one or more goal state
D. One initial state and one goal state
Answer» B. One or more initial states and one goal state
Discussion
3.

The traveling salesman problem involves n cities with paths connecting the cities. The time taken for traversing through all the cities, without knowing in advance the length of a minimum tour, is ___________

A. O(n)
B. O(n2)
C. O(n!)
D. O(n/2)
Answer» D. O(n/2)
Discussion
4.

An algorithm is complete if ____________

A. It terminates with a solution when one exists
B. It starts with a solution
C. It does not terminate with a solution
D. It has a loop
Answer» B. It starts with a solution
Discussion