Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Chapter: 6
Q181:
In a tree, arrows that connect nodes are known as ________.
A. edges
B. nails
C. pointers
D. roots
Correct Answer:
A
Chapter: 6
Q182:
What is meant by the term “solution space”?
A. The list of goals
B. The states that can be traversed
C. The number of paths only
D. The cost of each step
Correct Answer:
B
Chapter: 6
Q183:
Which of the following is a type of search strategy?
A. Brute-encoding
B. Blind/Uninformed
C. Programmed sorting
D. Leaf scanning
Correct Answer:
B
Chapter: 6
Q184:
Graphs can represent ________ during AI-based problem-solving.
A. syntax trees
B. goal tests
C. solution spaces
D. user input
Correct Answer:
C
Chapter: 6
Q185:
In a graph, node replication is used during conversion to ________.
A. string
B. tree
C. edge
D. state
Correct Answer:
B
Chapter: 6
Q186:
What does a search algorithm need to traverse in order to find the goal?
A. array
B. solution space
C. value index
D. answer table
Correct Answer:
B
Chapter: 6
Q187:
The difference between informed and uninformed search lies in ________.
A. speed
B. memory use
C. availability of domain knowledge
D. data structures
Correct Answer:
D
Chapter: 6
Q188:
In a graph search, what determines the optimality of the solution?
A. Node labels
B. Edge direction
C. Search algorithm used
D. Path cost
Correct Answer:
D
Chapter: 7
Q189:
What is the first step in the Simple Search Algorithm?
A. Initialize goal node
B. Initialize empty queue
C. Initialize Q with the start node
D. Initialize priority function
Correct Answer:
C
Chapter: 7
Q190:
What does the Simple Search Algorithm use to prioritize nodes?
A. Random selection
B. Depth value
C. Priority function P(n)
D. Alphabetical order
Correct Answer:
C
Chapter: 7
Q191:
What happens if the queue Q becomes empty in the Simple Search Algorithm?
A. Return goal state
B. Re-initialize Q
C. Fail the search
D. Call recursion
Correct Answer:
C
Chapter: 7
Q192:
Which data structure is primarily used in the Simple Search Algorithm?
A. Array
B. Hash table
C. Stack
D. Priority Queue
Correct Answer:
D
Chapter: 7
Q193:
In DFS using Simple Search Algorithm, what is the priority function P(n) based on?
A. Distance from goal
B. Node ID
C. 1/height(n)
D. Depth of tree
Correct Answer:
C
Chapter: 7
Q194:
Which type of search explores tree nodes level-by-level?
A. DFS
B. BFS
C. Greedy
D. A*
Correct Answer:
B
Chapter: 7
Q195:
The goal of using P(n) in the search algorithm is to
A. Increase time complexity
B. Select node with max height
C. Reduce the value of P(n)
D. Ignore visited nodes
Correct Answer:
C
Chapter: 7
Q196:
The Simple Search Algorithm is used to implement ________.
A. Only DFS
B. Only BFS
C. Both DFS and BFS
D. Binary Search
Correct Answer:
C
Chapter: 7
Q197:
In BFS using Simple Search Algorithm, what is the priority function P(n) based on?
A. Node cost
B. 1/height(n)
C. Depth(Node)
D. Height(n)
Correct Answer:
D
Chapter: 7
Q198:
What is the output when the goal node is found?
A. Return root node
B. Return node X
C. Return Visited list
D. Reinitialize Q
Correct Answer:
B
Chapter: 7
Q199:
Visited list in Simple Search Algorithm is used to
A. Track repeated nodes
B. Track path cost
C. Store children of nodes
D. Sort the queue
Correct Answer:
A
Chapter: 7
Q200:
DFS tends to go ______ in the tree to find the goal.
A. Breadth first
B. Level by level
C. Deeper and deeper
D. Shortest path
Correct Answer:
C