Welcome to the Problem Solving MCQs Page

Dive deep into the fascinating world of Problem Solving with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Problem Solving, a crucial aspect of Artificial Intelligence. In this section, you will encounter a diverse range of MCQs that cover various aspects of Problem Solving, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Artificial Intelligence.

Check out the MCQs below to embark on an enriching journey through Problem Solving. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Artificial Intelligence.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Problem Solving. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Problem Solving MCQs | Page 4 of 6

Explore more Topics under Artificial Intelligence

01

Introduction to AI

02

Intelligent Agents

03

Game Planning

04

Knowledge and Reasoning

05

Uncertain Knowledge

06

Learning

07

Perceiving and Acting

08

Natural Language Processing

09

LISP Programming

10

Expert Systems

Q31.

Greedy search strategy chooses the node for expansion in ___________

Shallowest

Deepest

The one closest to the goal node

Minimum heuristic cost

Discuss

Answer: (c).The one closest to the goal node

Q32.

What is disadvantage of Greedy Best First Search?

This algorithm is neither complete, nor optimal.

It can get stuck in loops. It is not optimal.

There can be multiple long paths with the cost ≤ C*

may not terminate and go on infinitely on one path

Discuss

Answer: (b).It can get stuck in loops. It is not optimal.

Q33.

Searching using query on Internet is, use of ___________ type of agent.

Offline agent

Online Agent

Goal Based

both b and c

Discuss

Answer: (d).both b and c

Q34.

What is Branching Factor?

Length of the shortest path from initial state to goal state.

The average number of child nodes in the problem space graph.

A property of an algorithm to always find an optimal solution.

None of the Above

Discuss

Answer: (b).The average number of child nodes in the problem space graph.

Q35.

What is Space Complexity of Depth First search algorithm?

b^2

b^b

b^m

Discuss

Answer: (d).b^m

Q36.

The process of removing detail from a given state representation is called ______

Extraction

Abstraction

Information Retrieval

Mining of data

Discuss

Answer: (b).Abstraction

Q37.

Which of the following search algorithm searches forward from initial state and backward from goal state till both meet to identify a common state?

Uniform Cost Search

Iterative Deepening Depth-First Search

Bidirectional Search

None of the Above

Discuss

Answer: (c).Bidirectional Search

Q38.

Uniform-cost search expands the node n with the __________

Lowest path cost

Heuristic cost

Highest path cost

Average path cost

Discuss

Answer: (a).Lowest path cost

Q39.

What is the heuristic function of greedy best-first search?

f(n) != h(n)

f(n) < h(n)

f(n) = h(n)

f(n) > h(n)

Discuss

Answer: (c).f(n) = h(n)

Q40.

A* algorithm is based on __________

Breadth-First-Search

Depth-First-Search

Uniform Cost Search

Best-First-Search

Discuss

Answer: (d).Best-First-Search

Page 4 of 6

Welcome to the Problem Solving MCQs Page

Problem Solving MCQs | Page 4 of 6

Explore more Topics under Artificial Intelligence

Introduction to AI

Intelligent Agents

Game Planning

Knowledge and Reasoning

Uncertain Knowledge

Learning

Perceiving and Acting

Natural Language Processing

LISP Programming

Expert Systems

Suggested Topics

Neural Networks

Software Architecture and Design

HTML

Operating System

Digital Image Processing (DIP)

C# programming

MongoDB

Computer Graphics

UNIX