ARTIFICIAL INTELLIGENCE GTU MCQ(CH-2 Problem Solving)

ARTIFICIAL INTELLIGENCE 

[ SUBJECT CODE: 2180703 ]

CH-2 PROBLEM SOLVING

Topics Covers:-

Defining The Problems As A State Space Search, Production Systems, Production Characteristics, Production System Characteristics, And Issues In The Design Of Search Programs, Additional Problems. Generate-And-Test, Hill Climbing, Best-First Search, Problem Reduction, Constraint Satisfaction, Means-Ends Analysis.

MCQ:-

1.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) All of the mentioned

d) None of the mentioned

2. A search algorithm takes _________ as an input and returns ________ as an output.

a) Input, output

b) Problem, solution

c) Solution, problem

d) Parameters, sequence of actions

3.What is state space?

a) The whole problem

b) Your Definition to a problem

c) Problem you design

d) Representing your problem with variable and parameter

4.Web Crawler is a/an ____________

a) Intelligent goal-based agent

b) Problem-solving agent

c) Simple reflex agent

d) Model based agent

5.Which is the best way to go for Game playing problem?

a) Linear approach

b) Heuristic approach (Some knowledge is stored)

c) Random approach

d) An Optimal approach

6.Which search strategy is also called as blind search?

a) Uninformed search

b) Informed search

c) Simple reflex search

d) All of the mentioned

7.How many types are available in uninformed search method?

a) 3

b) 4

c) 5

d) 6

8.When is breadth-first search is optimal?

a) When there is less number of nodes

b) When all step costs are equal

c) When all step costs are unequal

d) None of the mentioned

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.Which of the following is/are Uninformed Search technique/techniques?

a) Breadth First Search (BFS)

b) Depth First Search (DFS)

c) Bidirectional Search

d) All of the mentioned

11. Which data structure conveniently used to implement BFS?

a) Stacks

b) Queues

c) Priority Queues

d) All of the mentioned

12.A* algorithm is based on ___________

a) Breadth-First-Search

b) Depth-First –Search

c) Best-First-Search

d) Hill climbing

13.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

14. 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

15. Which of the Following problems can be modelled as CSP?

a) 8-Puzzle problem

b) 8-Queen problem

c) Map colouring problem

d) All of the mentioned

16.Constraint satisfaction problems on finite domains are typically solved using a form of ___________

a) Search Algorithms

b) Heuristic Search Algorithms

c) Greedy Search Algorithms

d) All of the mentioned

17.What is the other name of informed search strategy?

a) Simple search

b) Heuristic search

c) Online search

d) None of the mentioned

18.When will Hill-Climbing algorithm terminate?

a) Stopping criterion met

b) Global Min/Max is achieved

c) No neighbour has higher value

d) All of the mentioned

19. ___________ algorithm keeps track of k states rather than just one.

a) Hill-Climbing search

b) Local Beam search

c) Stochastic hill-climbing search

d) Random

20. Which search method will expand the node that is closest to the goal?

a) Best-first search

b) Greedy best-first search

c) A* search

d) None of the mentioned

21. Language/Languages used for programming Constraint Programming includes ____________

a) Prolog

b) C#

c) C

d) Fortrun

22. Backtracking is based on ____________

a) Last in first out

b) First in first out

c) Recursion

d) Both Last in first out & Recursion

23. Which of the following algorithm is generally used CSP search algorithm?

a) Breadth-first search algorithm

b) Depth-first search algorithm

c) Hill-climbing search algorithm

d) None of the mentioned

24. LIFO is ______ where as FIFO is ________

a) Stack, Queue

b) Queue, Stack

c) Priority Queue, Stack

d) Stack. Priority Queue

25. A production rule consists of ____________

a) A set of Rule

b) A sequence of steps

c) Set of Rule & sequence of steps

d) Arbitrary representation to problem

More MCQ Uploading Soon...

Stay Tune

Comment Your View In Below Section..

it's Very Helpful...