Graph Planning MCQ

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

• What is called inconsistent support?
  ক

  If two literals are not negation of other

  খ

  If two literals are negation of other

  গ

  Mutually exclusive

  ঘ

  None of the mentioned
• How many conditions are available between two actions in mutex relation?
  ক

  1

  খ

  2

  গ

  3

  ঘ

  4
• When will further expansion is unnecessary for planning graph?
  ক

  Identical

  খ

  Replicate

  গ

  Not identical

  ঘ

  None of the mentioned
• What is meant by persistence actions?
  ক

  Allow a literal to remain false

  খ

  Allow a literal to remain true

  গ

  Allow a literal to remain false & true

  ঘ

  None of the mentioned
• Which kind of problem are suitable for planning graph?
  ক

  Propositional planning problem

  খ

  Planning problem

  গ

  Action problem

  ঘ

  None of the mentioned
• What are present in each level of planning graph?
  ক

  Literals

  খ

  Actions

  গ

  Variables

  ঘ

  Both Literals & Actions
• What is the starting level of planning graph?
  ক

  Level 3

  খ

  Level 2

  গ

  Level 1

  ঘ

  Level 0
• What are present in the planning graph?
  ক

  Sequence of levels

  খ

  Literals

  গ

  Variables

  ঘ

  Heuristic estimates
• Which is used to extract solution directly from the planning graph?
  ক

  Planning algorithm

  খ

  Graphplan

  গ

  Hill-climbing search

  ঘ

  All of the mentioned
• Which data structure is used to give better heuristic estimates?
  ক

  Forwards state-space

  খ

  Backward state-space

  গ

  Planning graph algorithm

  ঘ

  None of the mentioned