Backward Chaining MCQ

Test your knowledge with important Backward Chaining MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Backward Chaining MCQs at Bissoy

• Which is omitted in prolog unification algorithm?
  ক

  Variable check

  খ

  Occur check

  গ

  Proposition check

  ঘ

  Both Occur & Proposition check
• What form of negation does the prolog allows?
  ক

  Negation as failure

  খ

  Proposition

  গ

  Substitution

  ঘ

  Negation as success
• How the logic programming can be constructed?
  ক

  Variables

  খ

  Expressing knowledge in a formal language

  গ

  Graph

  ঘ

  All of the mentioned
• Which problem can frequently occur in backward chaining algorithm?
  ক

  Repeated states

  খ

  Incompleteness

  গ

  Complexity

  ঘ

  Both Repeated states & Incompleteness
• Which algorithm are in more similar to backward chaining algorithm?
  ক

  Depth-first search algorithm

  খ

  Breadth-first search algorithm

  গ

  Hill-climbing search algorithm

  ঘ

  All of the mentioned
• What is used in backward chaining algorithm?
  ক

  Conjuncts

  খ

  Substitution

  গ

  Composition of substitution

  ঘ

  None of the mentioned
• How can be the goal is thought of in backward chaining algorithm?
  ক

  Queue

  খ

  List

  গ

  Vector

  ঘ

  Stack
• What will backward chaining algorithm will return?
  ক

  Additional statements

  খ

  Substitutes matching the query

  গ

  Logical statement

  ঘ

  All of the mentioned
• Which is mainly used for automated reasoning?
  ক

  Backward chaining

  খ

  Forward chaining

  গ

  Logic programming

  ঘ

  Parallel programming
• Which algorithm will work backward from the goal to solve a problem?
  ক

  Forward chaining

  খ

  Backward chaining

  গ

  Hill-climb algorithm

  ঘ

  None of the mentioned