MGM’s College of engineering and Technology, Kamothe, Navi Mumbai

COMPUTER ENGINEERING

Course Code: CSC703 Course Name: Artificial Intelligence and Soft Computing

Assignment 2
BE (Sem- VII) AY: 2021-2022

OPTIONS
Correct
Q NO QUESTION
A B C D Answer

1 Uninformed search is also called as? Heuristic search Blind search Hash search Binary search

Hill Climbing
2 Which search comes under Local search? A* search BFS DFS
Search
f(n) = g(n) + f(n) = g(n) *
3 In A* algorithm, f(n) is given as f(n) = g(n) - h(n) f(n) = g(n) / h(n)
h(n) h(n)
Uninformed
Local Search Informed search Blind search
4 State space landscape is a term used in search
algorithm algorithm algorithm
algorithm
Depth First Death First Depth Far Deterministic
5 DFID stands for Iterative Iterative Iterative First Iterative
Deepening Deepening Deepening Deepening

6 Which is not a drawback of hill climbing algorithm? Local maxima Plateau Plain Ridges
 In hill climbing algorithm, a flat area of the search
Local
7 space in which all neighboring states have the same Ridges Plain Plateau
maxima
value is called _______
Iterative
Which search solves the problem of Depth Limited
8 BFS Deepening DFS UCS
Search?
Search
9 Which is not a component of Problem Formulation? Actions Goal Test Path Cost Node

Heuristic
10 Informed search is also called as Hash search Binary search Blind search
search
In _________ search, DFS is carried out with a
11 Depth Limited A* IDA* BFS
predetermined depth limit
In A* search, which is the cost of cheapest path to
12 g(n) h(n) f(n) c(n)
reach to the node from the root node ?
Simulated
13 _______ is a variation of Hill Climbing Annealing A* search DLS DFS
Search
14 Which is not a terminology of Genetic algorithm? Chlorophyll Chromosome Population Gene
Death
Data Limited Down Limited Depth Limited
15 DLS stands for Limited
Search Search Search
Search
Uninformed
16 Which search is based on heuristic function ? Informed search Binary search Hash search
search
Memory space requirement in hill climbing algorithm
17 Less More very high Zero
is _____
_____ is a location in hill which is at height from Global
18 Local Maximum Plateau Ridges
other parts of the hill but is not the actual hill top Maximum
 ______ are the curves in the search space that leads to
19 Plateau Ridges Peak Mount
sequence of local maxima
Iterative
Iterative
Deepening
20 ___________ is a combination of BFS and DFS Widening Depth A* UCS
Depth First
First search
search
In A* search, which is the cost of cheapest path to
21 h(n) g(n) f(n) b(n)
reach from the node to the goal node?