AI Term-2 Examination Total points 15/15

CSE and ECE - 2nd year - March, 2022

The respondent's email (shreyass20@cse.iiitp.ac.in) was recorded on submission of this

form.

Enter your Name and MIS Number *

shreyass20@cse.iiitp.ac.in

The set of all leaf nodes available for expansion at any given point is 1/1
called *

frontier

open list

both a and b

Option 4

none of the above

Search algorithms require --------- to keep track of the search tree that 1/1
is being constructed. *

Search history

Data structure

Open list

none of the above

How many nodes will be in the frontier for Breadth-first search in a 1/1
simple binary tree? *

O(b^d)

O(b^d-1)

O(bd)

O(bd-1)

Which data structure is preferred to store the frontier in a search 1/1

algorithm *

Stack

Tree

Queue

None

In a search algorithm, the path from the initial state to the node, as 1/1
indicated by the parent pointers denoted by g(n) is called *

State

Path-Cost

Action

Parent

Depth limit of DEPTH-LIMITED SEARCH can solves ----------- problem. * 1/1

Infinite State space

Infinite Path

Infinite agent

None of the above

Greedy best-first search is ----------- search algorithm. * 1/1

Uninformed

Informed

Both a and b

Option 4

None of the above

In A* algorithm, for given f(n)=g(n)+h(n), f(n) is * 1/1

The cost to reach the node

Estimated cost of the cheapest solution through n

The cost to get from the node to the goal

None of the above

Local search algorithms are useful for solving------------problems, in 1/1

which the aim is to find the best state according to an objective function.
*

local path

pure optimization

global path

None of the above

Which algorithm is used to reduce the memory requirements for A∗ 1/1

algorithm. *

Iterative-deepening A∗

Metalevel state space

Best-first A*

heuristic based A*

Hill climbing algorithm is also called as ----------algorithm. * 1/1

Traveling-salesman Problem

Greedy local search

Greedy global search

None of the above

Main features of Hill Climbing Algorithm are * 1/1

Local Maximum

Global Maximum

Flat Local Maximum

None of the above

Which problem of Hill climbing algorithm can be solved with the use of 1/1
bidirectional search. *

Local Maxima

Plateau

Ridges

Global Maxima

SLAM algorithm for robot path planning is a----------- type of algorithm. 1/1
*

Mapless

Map based

Map Building based

heuristic based

Which algorithm is not a Hill Climbing Algorithm * 1/1

Steepest-Ascent

Stochastic

Simple

None of the above

This form was created inside of Indian Institute of Information Technology Pune.

 Forms