McqMate

Q. |
## Which of the following are true for the algorithms Beam Stack Search (BSS)and Divide-and-Conquer Beam Stack Search (DCBSS). |

A. | bss finds the optimal path while dcbss does not. |

B. | dcbss finds the optimal path while bss does not. |

C. | both bss and dcbss find the optimal path |

D. | neither bss and dcbss find the optimal path |

Answer» C. both bss and dcbss find the optimal path |

961

0

Do you find this helpful?

3

View all MCQs in

Artificial Intelligence and Robotics (AIR)No comments yet

- Which of the following are Informed search algorithms?
- Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?
- Goal Stack Planning breaks up a ______________________________
- Which of the following algorithm is generally used CSP search algorithm?
- Which search algorithm imposes a fixed depth limit on nodes?
- Which search strategy is combining the benefits of both BFS and DFS?
- The start node for search in plan space planning is_______________
- If there is a solution, breadth first search is _______________to find it
- A* Search Algorithm _______________
- Tabu search is designed __________________________