Professional Documents
Culture Documents
AIR - MCQ's (Unit 1-6)
AIR - MCQ's (Unit 1-6)
Correct
S.r No Question Option a Option b Option c Option d
Answer
Depth First Search is equivalent to which of the Post-order
1 Pre-order Traversal Level-order Traversal In-order Traversal a
traversal in the Binary Trees? Traversal
Time Complexity of DFS is? (V – number of
2 O(E) O(V) O(V+E) O(V*E) c
vertices, E – number of edges)
The Depth First Search traversal of a graph will
3 Linked List Tree Graph with back edges Array b
result into?
Which algorithm is used in graph traversal and
4 C* A* E* D* b
path finding?
5 Branch and bound is a __________ data structure type of tree sorting algorithm problem solving technique d
11 Which search strategy is also called as blind search? Uninformed search Informed search Simple reflex search All of the mentioned a
Which search is implemented with an empty first-
12 Depth-first search Breadth-first search Bidirectional search None of the mentioned b
in-first-out queue?
How many successors are generated in
13 1 2 3 4 a
backtracking search?
Which algorithm is used to solve any kind of Breadth-first Bidirectional search
14 Tree algorithm None of the mentioned b
problem? algorithm algorithm
Which search algorithm imposes a fixed depth limit Depth-limited Iterative deepening
15 Depth-first search Bidirectional search a
on nodes? search search
Which search implements stack operation for Depth-limited Iterative deepening
16 Depth-first search Bidirectional search b
searching the states? search search
Strategies that know whether one non-goal state is
Informed & Heuristic & Unformed Informed & Heuristic
17 “more promising” than another are called Unformed Search d
Unformed Search Search Search
___________
uniform-cost search expands the node n with the
18 Lowest path cost Heuristic cost Highest path cost Average path cost a
__________
What is the other name of informed search
19 Simple search Heuristic search Online search None of the mentioned b
strategy?
Which search uses the problem specific knowledge
20 Informed search Depth-first search Breadth-first search Uninformed search a
beyond the definition of the problem?
To search and
To discover To compare two nodes
measure how far a
something or an in a search tree to see if
21 A heuristic is a way of trying ___________ node in a search All of the mentioned d
idea embedded in one is better than
tree seems to be
a program another
from a goal
Breadth-First-
22 A* algorithm is based on ___________ Depth-First –Search Best-First-Search Hill climbing c
Search
Best-First search is a type of informed search, Evaluation Evaluation Evaluation function
23 which uses ________________ to choose the best function returning function returning returning lowest & None of them is applicable a
next node for expansion lowest evaluation highest evaluation highest evaluation
Cheapest path Estimated cost of
24 Heuristic function h(n) is ________ Lowest path cost from root to goal cheapest path from Average path cost c
node root to goal node
Greedy search strategy chooses the node for The one closest to the
25 Shallowest Deepest Minimum heuristic cost c
expansion in ___________ goal node
Path cost from Path cost from start Average of Path cost from
What is the evaluation function in greedy
26 Heuristic function start node to node to current node + start node to current node a
approach?
current node Heuristic cost and Heuristic cost
Path cost from Path cost from start Average of Path cost from
27 What is the evaluation function in A* approach? Heuristic function start node to node to current node + start node to current node c
current node Heuristic cost and Heuristic cost
In many problems the path to goal is irrelevant,
Informed Search Uninformed Informed & Uninformed
28 this class of problems can be solved using Local Search Techniques c
Techniques Search Techniques Search Techniques
____________
Less memory & Finds a
Though local search algorithms are not systematic, Finds a solution in large
29 Less memory More time solution in large infinite d
key advantages would include __________ infinite space
space
_______________ Is an algorithm, a loop that
30 continually moves in the direction of increasing Up-Hill Search Hill-Climbing Hill algorithm Reverse-Down-Hill search b
value – that is uphill.
Stopping criterion Global Min/Max is No neighbor has higher
31 When will Hill-Climbing algorithm terminate? All of the mentioned c
met achieved value
Hill climbing sometimes called ____________
Heuristic local
32 because it grabs a good neighbor state without Needy local search Greedy local search Optimal local search c
search
thinking ahead about where to go next
Searching using query on Internet is, use of Both Offline & Online
33 Offline agent Online agent Goal Based & Online agent d
___________ type of agent agent
Best-First search can be implemented using the
34 Queue Stack Priority Queue Circular Queue c
following data structure
Which is used to improve the performance of Quality of heuristic
35 Quality of nodes Simple form of nodes None of the mentioned b
heuristic search? function
Which search is complete and optimal when h(n) is Both Best-first & Depth-
36 Best-first search Depth-first search A* search d
consistent? first search
37 Which method is used to search better by learning? Best-first search Depth-first search Metalevel state space None of the mentioned c
Which search uses only the linear space for Recursive best-first
38 Best-first search Depth-first search None of the mentioned b
searching? search
What is the heuristic function of greedy best-first
39 f(n) != h(n) f(n) < h(n) f(n) = h(n) f(n) > h(n) c
search?
Which function will select the lowest expansion Greedy best-first
40 Best-first search Depth-first search None of the mentioned b
node at first for evaluation? search
Unit - II
S.r Correct
Question Option a Option b Option c Option d
No Answer
This set of Basic Artificial Intelligence Questions and
a) Constraints Satisfaction b) Uninformed c) Local Search d) All of the
1 Answers focuses on “Constraints Satisfaction a
Problems Search Problems Problems mentioned
Problems”.
Which of the Following problems can be modeled as c) Map coloring d) All of the
2 a) 8-Puzzle problem b) 8-Queen problem d
CSP? problem mentioned
d) Omitting the
To overcome the need to backtrack in constraint c) Backtrack
b) Constraint constraints and
5 satisfaction problem can be eliminated by a) Forward Searching after a forward a
Propagation focusing only on
____________ search
goals
a) Search Algorithms
Constraint satisfaction problems on finite domains d) All of the
8 b) Heuristic Search c) Greedy Search d
are typically solved using a form of ___________ mentioned
c) A goal state is
a) A goal state is b) A goal state is d) None of the
15 When do we call the states are safely explored? reachable from c
unreachable from any state denied access mentioned
every state
Which of the following algorithm is generally used a) Breadth-first search b) Depth-first search c) Hill-climbing d) None of the
16 b
CSP search algorithm algorithm algorithm search algorithm mentioned
Which of the following algorithm is generally used 1.Breadth-first search 2. Depth-first search 3. Hill-climbing 4. None of the
17 b
CSP search algorithm? algorithm algorithm search algorithm mentioned
3. A goal state is
1. A goal state is 2. A goal state is 4. None of the
18 When do we call the states are safely explored? reachable from c
unreachable from any state denied access mentioned
every state
Searching using query on Internet is, use of 3. Both Offline 4. Goal Based &
24 1. Offline agent 2. Online agent d
___________ type of agent & Online agent Online agent
3. Individuals
2. Crossover among the 4. Random
1. Fitness function &
25 Mark two main features of Genetic Algorithm techniques & population & mutation & a
Crossover techniques
Random mutation Random Fitness function
mutation
3. When all step
1. When there is less 2. When all step 4. None of the
26 Optimality of BFS is costs are b
number of nodes costs are equal mentioned
unequal
3. Set of Rule & 4. Arbitrary
2. A sequence of
27 A production rule consists of 1. A set of Rule sequence of representation c
steps
steps to problem
3. Time and
The major component/components for measuring 4. All of the
28 1. Completeness 2. Optimality Space d
the performance of problem solving mentioned
complexity
1. Intelligent goal-based 2. Problem-solving 3. Simple reflex 4. Model based
29 Web Crawler is a/an a
agent agent agent agent
4. Representing
2. Your Definition to 3. Problem you your problem
30 What is state space? 1. The whole problem d
a problem design with variable
and parameter
c) a sequence of
b) a sequence of
actions which
levels which d) none of the
35 Planning graphs consists of ____________ a) a sequence of levels corresponds to b
corresponds to time mentioned
the state of the
steps in the plan
system
fully connected
network with both
34 What consist of boltzman machine? asynchronous operation stochastic update all of the mentioned d
hidden and visible
units
human perceive
What’s the main point of difference between everything as a
human have more IQ & human have sense
35 human & machine intelligence? pattern while human have emotions a
intellect organs
machine perceive it
merely as data
Does pattern classification belongs to category of yes
36 no b
non-supervised learning?
features of group number of groups may neither feature & nor none of the
37 What is unsupervised learning? c
explicitly stated be known number of groups is known mentioned
Does pattern classification & grouping involve yes
38 no b
same kind of learning?
Does for feature mapping there’s need of yes
39 no b
supervised learning?
Example of a unsupervised feature map? none of the
40 text recognition voice recognition image recognition b
mentioned
Unit - V
S.r Correct
Question Option a Option b Option c Option d
No Answer
________ is the simplest method of collaborative robots b) Speed and
c) Power and
1 and is used in applications when human interaction with a) Self monitored stop separation d) Hand guiding a
force limiting
robot is less. monitoring
b) Industrial Assist c) International d) Informative
2 IAD stands for ________ a) Intelligent Assist Device a
Device Assist Device Assist Device