Explore topic-wise MCQs in Artificial Intelligence.

This section includes 10 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.

WHAT_FORM_OF_NEGATION_DOES_THE_PROLOG_ALLOWS??$

A. Negation as failure
B. Proposition
C. Substitution
D. Negation as success
Answer» B. Proposition
2.

Which_is_omitted_in_prolog_unification_algorithm?$

A. Variable check
B. Occur check
C. Proposition check
D. Both Occur & Proposition check
Answer» C. Proposition check
3.

How the logic programming can be constructed?

A. Variables
B. Expressing knowledge in a formal language
C. Graph
D. All of the mentioned
Answer» C. Graph
4.

Which problem can frequently occur in backward chaining algorithm?

A. Repeated states
B. Incompleteness
C. Complexity
D. Both Repeated states & Incompleteness
Answer» E.
5.

Which algorithm are in more similar to backward chaining algorithm?

A. Depth-first search algorithm
B. Breadth-first search algorithm
C. Hill-climbing search algorithm
D. All of the mentioned
Answer» B. Breadth-first search algorithm
6.

What are used in backward chaining algorithm?

A. Conjuncts
B. Substitution
C. Composition of substitution
D. None of the mentioned
Answer» D. None of the mentioned
7.

How can be the goal is thought of in backward chaining algorithm?

A. Queue
B. List
C. Vector
D. Stack
Answer» E.
8.

What will backward chaining algorithm will return?

A. Additional statements
B. Substitutes matching the query
C. Logical statement
D. All of the mentioned
Answer» C. Logical statement
9.

Which is mainly used for automated reasoning?

A. Backward chaining
B. Forward chaining
C. Logic programming
D. Parallel programming
Answer» D. Parallel programming
10.

Which algorithm will work backward from the goal to solve a problem?

A. Forward chaining
B. Backward chaining
C. Hill-climb algorithm
D. None of the mentioned
Answer» C. Hill-climb algorithm