Loading
MindXchange
MindXchange
MindXchange

Quipoin Menu

Learn • Practice • Grow

Tutorial Exercises MCQs Interview Q & A Tests
ai-foundation / Problem Solving in AI
mcq
ChapterExercisesInterview QsVideosDiscussion
Direction: Choose the correct option

Q1.

What is a state space in AI problem solving?
A. The goal state only
B. The set of actions
C. The set of all possible states reachable from the initial state
D. The initial state only
Direction: Choose the correct option

Q2.

Which search algorithm is optimal and complete but uses more memory?
A. A* Search
B. Breadth-First Search
C. Hill Climbing
D. Depth-First Search
Direction: Choose the correct option

Q3.

Which search method uses a heuristic function to estimate cost to goal?
A. Bidirectional Search
B. A* algorithm
C. Depth-Limited Search
D. Uniform Cost Search
Direction: Choose the correct option

Q4.

What is the purpose of a heuristic in search?
A. To increase time complexity
B. To reduce the search space
C. To make the problem unsolvable
D. To generate random states
Direction: Choose the correct option

Q5.

Which algorithm is complete for finite graphs but not optimal?
A. Bidirectional Search
B. Depth-First Search
C. Uniform Cost Search
D. A* with admissible heuristic
Direction: Choose the correct option

Q6.

In the 8-puzzle problem, the Manhattan distance heuristic is:
A. Admissible but not consistent
B. Neither
C. Admissible and consistent
D. Not admissible
Direction: Choose the correct option

Q7.

What is hill climbing search?
A. A depth-first search variant
B. A global search algorithm
C. A local search algorithm that moves to neighboring states with higher value
D. A breadth-first search variant
Direction: Choose the correct option

Q8.

Which of the following is an informed search algorithm?
A. Uniform cost search
B. Breadth-first search
C. Greedy best-first search
D. Iterative deepening depth-first search
Direction: Choose the correct option

Q9.

In constraint satisfaction problems (CSP), backtracking search involves:
A. Using no heuristics
B. Applying depth-first search only
C. Using hill climbing
D. Assigning values to variables and backtracking when constraints are violated
Direction: Choose the correct option

Q10.

The N-Queens problem is an example of:
A. Constraint satisfaction problem
B. Optimization problem
C. Graph traversal problem
D. Pathfinding problem