Artificial Intelligence and Robotics Multiple Choice Questions - Set 01 - ObjectiveBooks

Artificial Intelligence and Robotics Multiple Choice Questions - Set 01

Practice Test: Question Set - 01


1. Which data structure is used for implementing a LIFO branch and bound strategy?
    (A) Stack
    (B) Queue
    (C) Array
    (D) Linked list

2. Which search strategy is also called as blind search?
    (A) Uninformed search
    (B) Informed search
    (C) Simple reflex search
    (D) All of the mentioned

3. Which search implements stack operation for searching the states?
    (A) Depth-limited search
    (B) Depth-first search
    (C) Iterative deepening search
    (D) Bidirectional search

4. Best-First search is a type of informed search, which uses _________ to choose the best next node for expansion
    (A) Evaluation function returning lowest evaluation
    (B) Evaluation function returning highest evaluation
    (C) Evaluation function returning lowest & highest evaluation
    (D) None of them is applicable

5. Though local search algorithms are not systematic, key advantages would include _________
    (A) Less memory
    (B) More time
    (C) Finds a solution in large infinite space
    (D) Less memory & Finds a solution in large infinite space

6. What is the other name of informed search strategy?
    (A) Simple search
    (B) Heuristic search
    (C) Online search
    (D) None of the mentioned

7. Which function will select the lowest expansion node at first for evaluation?
    (A) Greedy best-first search
    (B) Best-first search
    (C) Depth-first search
    (D) None of the mentioned

8. Depth First Search is equivalent to which of the traversal in the Binary Trees?
    (A) Pre-order Traversal
    (B) Post-order Traversal
    (C) Level-order Traversal
    (D) In-order Traversal

9. Strategies that know whether one non-goal state is “more promising” than another are called _________
    (A) Informed & Unformed Search
    (B) Unformed Search
    (C) Heuristic & Unformed Search
    (D) Informed & Heuristic Search

10. Greedy search strategy chooses the node for expansion in __________
    (A) Shallowest
    (B) Deepest
    (C) The one closest to the goal node
    (D) Minimum heuristic cost

11. ________ is an algorithm, a loop that continually moves in the direction of increasing value that is uphill.
    (A) Up-Hill Search
    (B) Hill-Climbing
    (C) Hill algorithm
    (D) Reverse-Down-Hill search

12. Which is used to improve the performance of heuristic search?
    (A) Quality of nodes
    (B) Quality of heuristic function
    (C) Simple form of nodes
    (D) None of the mentioned

13. The Depth First Search traversal of a graph will result into?
    (A) Linked List
    (B) Tree
    (C) Graph with back edges
    (D) Array

14. What is the evaluation function in greedy approach?
    (A) Heuristic function
    (B) Path cost from start node to current node
    (C) Path cost from start node to current node + Heuristic cost
    (D) Average of Path cost from start node to current node and Heuristic cost

15. Which search uses only the linear space for searching?
    (A) Best-first search
    (B) Recursive best-first search
    (C) Depth-first search
    (D) None of the mentioned

Show and hide multiple DIV using JavaScript View All Answers

 Next Tests:

    Blogger Comment
    Facebook Comment
adplus-dvertising