Uninformed Search Strategy MCQ

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

• Which search implements stack operation for searching the states?
  ক

  Depth-limited search

  খ

  Depth-first search

  গ

  Breadth-first search

  ঘ

  None of the mentioned
• Which search algorithm imposes a fixed depth limit on nodes?
  ক

  Depth-limited search

  খ

  Depth-first search

  গ

  Iterative deepening search

  ঘ

  Bidirectional search
• Which algorithm is used to solve any kind of problem?
  ক

  Breadth-first algorithm

  খ

  Tree algorithm

  গ

  Bidirectional search algorithm

  ঘ

  None of the mentioned
• How many parts does a problem consists of?
  ক

  1

  খ

  2

  গ

  3

  ঘ

  4
• What is the space complexity of Depth-first search?
  ক

  O(

  খ

  [ O(bl)

  গ

  O(m)

  ঘ

  O(bm)
• How many successors are generated in backtracking search?
  ক

  1

  খ

  2

  গ

  3

  ঘ

  4
• When is breadth-first search is optimal?
  ক

  When there is less number of nodes

  খ

  When all step costs are equal

  গ

  When all step costs are unequal

  ঘ

  None of the mentioned
• Which search is implemented with an empty first-in-first-out queue?
  ক

  Depth-first search

  খ

  Breadth-first search

  গ

  Bidirectional search

  ঘ

  None of the mentioned
• How many types are available in uninformed search method?
  ক

  3

  খ

  4

  গ

  5

  ঘ

  6
• Which search strategy is also called as blind search?
  ক

  Uninformed search

  খ

  Informed search

  গ

  Simple reflex search

  ঘ

  All of the mentioned