Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Chapter: 6
Q161:
In a tree, which of the following is TRUE?
A. Leaf nodes have children
B. Every node has exactly two children
C. Root node has no parent
D. Edges point from child to parent
Correct Answer:
C
Chapter: 6
Q162:
Graphs used in problem-solving can represent ________.
A. movies only
B. only code
C. functions and methods
D. solution spaces
Correct Answer:
D
Chapter: 6
Q163:
Which of the following can be represented using graphs?
A. Temperature
B. City routes
C. Color codes
D. Binary digits
Correct Answer:
B
Chapter: 6
Q164:
A graph that does not indicate direction on edges is called a ________.
A. bi-directional graph
B. undirected graph
C. directed graph
D. unidirectional graph
Correct Answer:
B
Chapter: 6
Q165:
Which type of graph contains edges with specific direction?
A. symmetric graph
B. flow graph
C. undirected graph
D. directed graph
Correct Answer:
D
Chapter: 6
Q166:
Which of the following can be converted into a tree by replicating nodes?
A. code
B. network diagrams
C. graphs
D. numbers
Correct Answer:
C
Chapter: 6
Q167:
When converting a graph to a tree, what is typically selected as the root node?
A. The end node
B. Any internal node
C. The node with most edges
D. The start node
Correct Answer:
D
Chapter: 6
Q168:
In tree representation of a graph, replicated nodes help maintain ________.
A. directionality
B. colors
C. information about parents
D. structure of multiple paths
Correct Answer:
D
Chapter: 6
Q169:
Which of the following is TRUE about blind search?
A. It always finds the best path
B. It needs full knowledge of the problem space
C. It uses hit-and-trial approach
D. It follows only optimal paths
Correct Answer:
C
Chapter: 6
Q170:
What type of search uses no information about the goal's location?
A. Informed search
B. Heuristic search
C. Optimal search
D. Blind search
Correct Answer:
D
Chapter: 6
Q171:
In the mouse and maze example, what helps the mouse perform an informed search?
A. distance map
B. walls
C. cheese smell
D. light sensor
Correct Answer:
C
Chapter: 6
Q172:
Which type of search uses domain-specific hints to guide the process?
A. Blind search
B. Optimal search
C. Uninformed search
D. Heuristic search
Correct Answer:
D
Chapter: 6
Q173:
Which search strategy focuses on finding any solution, not necessarily the best?
A. Optimal path search
B. Informed search
C. Any-path search
D. Blind search
Correct Answer:
C
Chapter: 6
Q174:
Which search strategy stops once a single solution is found?
A. Heuristic search
B. Any-path search
C. Blind search
D. Optimal path search
Correct Answer:
B
Chapter: 6
Q175:
Optimal search strategies aim to find a solution that is ________.
A. most complex
B. most time-consuming
C. least costly
D. non-deterministic
Correct Answer:
C
Chapter: 6
Q176:
In optimal search, the cost of a solution can depend on ________.
A. number of children
B. leaf node depth
C. steps taken and operators used
D. only edges
Correct Answer:
C
Chapter: 6
Q177:
Nodes A, B, C … J are known as ________ in tree representation.
A. variables
B. objects
C. nodes
D. states
Correct Answer:
C
Chapter: 6
Q178:
What does the smell of cheese represent in the mouse maze analogy?
A. state tree
B. search space
C. heuristic information
D. graph edge
Correct Answer:
C
Chapter: 6
Q179:
Which strategy ensures that the solution uses minimum number of operations?
A. Blind search
B. Any-path search
C. Heuristic search
D. Optimal search
Correct Answer:
D
Chapter: 6
Q180:
Which of the following is a goal of optimal path search?
A. Reach any goal
B. Minimize cost
C. Explore entire tree
D. Use randomness
Correct Answer:
B