ITI COPA - Artificial Intelligence and Robotics MCQ Test - Set 03 - ObjectiveBooks

# Practice Test: Question Set - 03

1. Which of the following can traverse the state space tree only in DFS manner?
(A) Branch and bound
(B) Dynamic programming
(C) Greedy algorithm
(D) Backtracking

2. Which of the following is false in the case of a spanning tree of a graph G?
(A) It is tree that spans G
(B) It is a sub-graph of the G
(C) It can be either cyclic or acyclic
(D) It includes every vertex of the G

3. What is the heuristic function of greedy best-first search?
(A) f(n) != h(n)
(B) f(n) < h(n)
(C) f(n) = h(n)
(D) f(n) > h(n)

4. How many successors are generated in backtracking search?
(A) 1
(B) 2
(C) 3
(D) 4

5. Which search algorithm imposes a fixed depth limit on nodes?
(A) Depth-limited search
(B) Depth-first search
(C) Iterative deepening search
(D) Bidirectional search

6. Branch and bound is a _________
(A) Data structure
(B) Type of tree
(C) Sorting algorithm
(D) Problem solving technique

7. What is the evaluation function in A* 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

8. Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?
(A) Every minimum spanning tree of G must contain CD
(B) If AB is in a minimum spanning tree, then its removal must disconnect G
(C) No minimum spanning tree contains AB
(D) G has a unique minimum spanning tree

9. Best-First search can be implemented using the following data structure
(A) Queue
(B) Stack
(C) Priority Queue
(D) Circular Queue

10. Uniform-cost search expands the node n with the _________
(A) Lowest path cost
(B) Heuristic cost
(C) Highest path cost
(D) Average path cost

11. Heuristic function h(n) is _________
(A) Lowest path cost
(B) Cheapest path from root to goal node
(C) Estimated cost of cheapest path from root to goal node
(D) Average path cost

12. Which search is complete and optimal when h(n) is consistent?
(A) Best-first search
(B) Depth-first search
(C) Both Best-first & Depth-first search
(D) A* search

Show and hide multiple DIV using JavaScript View All Answers

Next Tests: