Artificial Intelligence (2180703) MCQs

MCQs of Representing Knowledge Using Rules

Showing 11 to 20 out of 28 Questions
1 2 3
11.
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:

Option (b)

12.
Which is mainly used for automated reasoning?
(a) Backward chaining
(b) Forward chaining
(c) Logic programming
(d) Parallel programming
Answer:

Option (c)

13.
What will backward chaining algorithm will return?
(a) Additional statements
(b) Substitutes matching the query
(c) Logical statement
(d) All of the mentioned
Answer:

Option (b)

14.
How can be the goal is thought of in backward chaining algorithm?
(a) Queue
(b) List
(c) Vector
(d) Stack
Answer:

Option (d)

15.
What is used in backward chaining algorithm?
(a) Conjuncts
(b) Substitution
(c) Composition of substitution
(d) None of the mentioned
Answer:

Option (c)

16.
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:

Option (a)

17.
Which problem can frequently occur in backward chaining algorithm?
(a) Repeated states
(b) Incompleteness
(c) Complexity
(d) Both Repeated states & Incompleteness
Answer:

Option (d)

18.
How the logic programming can be constructed?
(a) Variables
(b) Expressing knowledge in a formal language
(c) Graph
(d) All of the mentioned
Answer:

Option (b)

19.
What form of negation does the prolog allows?
(a) Negation as failure
(b) Proposition
(c) Substitution
(d) Negation as success
Answer:

Option (a)

20.
Which is omitted in prolog unification algorithm?
(a) Variable check
(b) Occur check
(c) Proposition check
(d) Both Occur & Proposition check
Answer:

Option (b)

Showing 11 to 20 out of 28 Questions
1 2 3