MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 11 Mcqs, each offering curated multiple-choice questions to sharpen your Technical MCQs knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Is optimality and completeness exist in bidirectional search algorithm? |
| A. | Yes, Yes |
| B. | No, Yes |
| C. | Yes, No |
| D. | No, No |
| E. | |
| Answer» B. No, Yes | |
| 2. |
A* algorithm is based on __________ |
| A. | Breadth-First-Search |
| B. | Depth-First-Search |
| C. | Uniform Cost Search |
| D. | Best-First-Search |
| Answer» E. | |
| 3. |
Which of the following search algorithm searches forward from initial state and backward from goal state till both meet to identify a common state? |
| A. | Uniform Cost Search |
| B. | Iterative Deepening Depth-First Search |
| C. | Bidirectional Search |
| D. | None of the Above |
| Answer» D. None of the Above | |
| 4. |
What is Space Complexity of Depth First search algorithm? |
| A. | b |
| B. | b^2 |
| C. | b^b |
| D. | b^m |
| Answer» E. | |
| 5. |
What is Branching Factor? |
| A. | Length of the shortest path from initial state to goal state. |
| B. | The average number of child nodes in the problem space graph. |
| C. | A property of an algorithm to always find an optimal solution. |
| D. | None of the Above |
| Answer» C. A property of an algorithm to always find an optimal solution. | |
| 6. |
Searching using query on Internet is, use of ___________ type of agent. |
| A. | Offline agent |
| B. | Online Agent |
| C. | Goal Based |
| D. | Both B and C |
| E. | |
| Answer» E. | |
| 7. |
What is disadvantage of Greedy Best First Search? |
| A. | This algorithm is neither complete, nor optimal. |
| B. | It can get stuck in loops. It is not optimal. |
| C. | There can be multiple long paths with the cost ≤ C* |
| D. | may not terminate and go on infinitely on one path |
| Answer» C. There can be multiple long paths with the cost ≤ C* | |
| 8. |
Depth-First Search is implemented in recursion with _______ data structure. |
| A. | LIFO |
| B. | LILO |
| C. | FIFO |
| D. | FILO |
| Answer» B. LILO | |
| 9. |
What is Time Complexity of Breadth First search algorithm? |
| A. | b |
| B. | b^d |
| C. | b^2 |
| D. | b^b |
| Answer» C. b^2 | |
| 10. |
What is Initial state + Goal state in Search Terminology? |
| A. | Problem Space |
| B. | Problem Instance |
| C. | Problem Space Graph |
| D. | Admissibility |
| Answer» C. Problem Space Graph | |
| 11. |
What is the main task of a problem-solving agent? |
| A. | Solve the given problem and reach to goal |
| B. | To find out which sequence of action will get it to the goal state |
| C. | Both A and B |
| D. | None of the Above |
| Answer» D. None of the Above | |