Search Strategies Quiz

Which search strategy is also called as blind search?

• Uninformed search

• Informed search

• Simple reflex search

• All 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

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

Forward chaining systems are _____________ where as backward chaining systems are ___________

• Goal-driven, goal-driven

• Goal-driven, data-driven

• Data-driven, goal-driven

• Data-driven, data-driven

An expert system is a computer program that contains some of the subject-specific knowledge of one or more human experts.

• True

• False

Two literals are complementary if _____________

• They are equal

• They are identical and of equal sign

• They are identical but of opposite sign

• They are unequal but of equal sign

Knowledge and reasoning also play a crucial role in dealing with __________________ environment.

• Completely Observable

• Partially Observable

• Neither Completely nor Partially Observable

• Only Completely and Partially Observable

Treatment chosen by doctor for a patient for a disease is based on _____________

• Only current symptoms

• Current symptoms plus some knowledge from the textbooks

• Current symptoms plus some knowledge from the textbooks plus experience

• All of the mentioned

Which function will select the lowest expansion node at first for evaluation?

• Greedy best-first search

• Best-first search

• Depth-first search

• None of the mentioned

Which search is complete and optimal when h(n) is consistent?

• Best-first search

• Depth-first search

• Both Best-first & Depth-first search

• A* search