Moodle2WordQuestions – English template

[22AM402-DS-II-FA11]

Question 01 (MC)
[101] [SO1] [60]
Which search algorithm is considered an extension of Dijkstra's algorithm by
MC
incorporating heuristic information?
(1 Mark- [R/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
ID number:
# Answers Feedback Grade
A. BFS 0

B. A* 100

C. DFS 0

D. UCS 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

1
Question 02 (MC)
[102] [SO1] [60]
A* search algorithm is best suited for which type of problems? MC
(1 Mark- [U/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Uninformed search problems 0

Problems with no heuristic

B. 0
information
Problems with both heuristic and
C. 100
cost information
Problems with only cost
D. 0
information
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

2
Question 03 (MC)
[103][SO1][90]
In A* search algorithm, what does the 'f(n)' function represent?
MC
(1
Mark-[U/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
Cost from the start node to the
A. 0
current node
B. Heuristic function 0

Evaluation function combining cost

C. 100
and heuristic
Cost from the current node to the
D. 0
goal node
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

3
Question 04 (MC)
[104][SO1][90]
Which data structure is typically used to implement the priority queue in A* search?
MC
(1 Mark-
[Ap/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Stack 0

B. Queue 0

C. Heap 100

D. Array 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

4
Question 05(MC)
[105][SO1][90]
What is the heuristic used in A* algorithm called? MC
(1 Mark- [R/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Manhattan Distance 0

B. Euclidean Distance 0

C. Chebyshev Distance 0

D. All of the above 100

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct responses
No
(Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

5
Question 06(MC)
[106][SO1][90]
Which heuristic is admissible in A* search? MC
(1 Mark- [U/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A heuristic that overestimates the cost
A. 0
to reach the goal.
A heuristic that underestimates the cost
B. 100
to reach the goal.
A heuristic that exactly estimates the
C. 0
cost to reach the goal.
A heuristic that ignores the cost to
D. 0
reach the goal.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct responses
No
(Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

6
Question 07 (MC)
[107][SO1][60]
Which of the following is NOT a phase in the A* search algorithm? MC
(1 Mark- [U/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
ID number:
# Answers Feedback Grade
A. Initialization 0

B. Expansion 0

C. Goal Test 0

D. Termination 100
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

7
Question 08 (MC)
[108][SO1][60]
In A* search algorithm, if the heuristic function is always 0, what is the algorithm
MC
equivalent to?
(1 Mark- [U/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. BFS 0

B. DFS 0

C. UCS 0

D. Dijkstra's Algorithm 100

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

8
Question 09 (MC)
[109][SO1][60]
Which of the following is true regarding the time complexity of A* search algorithm? MC
(1 Mark- [U/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. It is always exponential. 0

B. It is always polynomial. 0

It depends on the heuristic

C. 100
function.
It depends on the size of the
D. 0
search space.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

9
Question 10 (MC)
[110][SO1][60]
A* search algorithm guarantees finding the optimal solution when: MC
(1 Mark- [U/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. The heuristic function is consistent. 0

The heuristic function is

B. 0
admissible.
C. The search space is finite. 0

D. All of the above. 100

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

10
Question 11 (MC)
[111] [SO1] [60]
What is the primary limitation of Dijkstra's algorithm when used in pathfinding
applications?
MC

(1 Mark-
[An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
ID number:
# Answers Feedback Grade
A. It doesn't handle weighted graphs. 0

It doesn't guarantee the shortest

B. 0
path.
C. It has high space complexity. 0

D. It has high time complexity. 100

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

11
Question 12 (MC)
[112] [SO1] [60]
Why is the need for A* search algorithm arises? MC
(1 Mark- [U/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
To handle problems with no
A. 0
heuristic information.
To find the shortest path in
B. 0
weighted graphs.
To improve the efficiency of
C. 0
Dijkstra's algorithm.
To handle problems with both
D. 100
heuristic and cost information.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

12
Question 13 (MC)
[113][SO1][90]
In which scenario is A* search algorithm particularly useful?
MC
(1 Mark-
[An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
When there is only one possible
A. 0
path to the goal.
When there are multiple possible
B. 100
paths to the goal.
C. When the search space is finite. 0

D. When the search space is infinite. 0

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

13
Question 14 (MC)
[114][SO1][90]
Which aspect of A* search algorithm addresses the limitations of algorithms like
MC
BFS and DFS in pathfinding?
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. The use of heuristics. 100

B. The expansion phase. 0

C. The goal test phase. 0

D. The termination condition. 0

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

14
Question 15(MC)
[115][SO1][90]
What is the primary difference between Dijkstra's algorithm and A* search
algorithm? MC
(1 Mark- [U/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
Dijkstra's algorithm always finds the
A. 100
shortest path, while A* may not.
A* always finds the shortest path, while
B. 0
Dijkstra's may not.
Dijkstra's algorithm has lower time
C. 0
complexity.
A* algorithm has lower space
D. 0
complexity.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct responses
No
(Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

15
Question 16(MC)
[116][SO1][90]
Which data structure is commonly used to store the open list in the implementation
of A* search algorithm? MC
(1 Mark-
[Ap/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Array 0

B. Linked list 0

C. Priority queue 100

D. Stack 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct responses
No
(Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

16
Question 17 (MC)
[117][SO1][60]
Which step in the implementation of A* search algorithm involves selecting the
MC
node with the lowest 'f(n)' value from the open list?
(1 Mark- [Ap/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
ID number:
# Answers Feedback Grade
A. Expansion 100

B. Initialization 0

C. Goal Test 0

D. Termination 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

17
Question 18 (MC)
[118][SO1][60]
What is the role of the closed list in the implementation of A* search algorithm? MC
(1 Mark- [U/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
It stores all the nodes visited during
A. 100
the search.
It stores the nodes expanded
B. 0
during the search.
It stores the nodes for which the
C. 0
goal test has been conducted.
It stores the nodes for which the
D. heuristic function has been 0
evaluated.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

18
Question 19 (MC)
[119][SO1][60]
In the implementation of A* search algorithm, how is the 'g(n)' value of a node
computed? MC
(1 Mark-
[Ap/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
It is provided as input to the
A. 0
algorithm.
It is the actual cost from the start
B. 100
node to the current node.
It is the heuristic cost from the
C. 0
current node to the goal node.
It is the sum of 'h(n)' and 'f(n)'
D. 0
values.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

19
Question 20 (MC)
[120][SO1][60]
Which step in the implementation of A* search algorithm involves checking whether
the current node is the goal node? MC
(1 Mark-
[Ap/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Expansion 0

B. Initialization 0

C. Goal Test 100

D. Termination 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

20
Question 21 (MC)
[121][SO1][60]
Which algorithm guarantees the shortest path to all nodes from the start node in a
MC
weighted graph?
(1 Mark- [U/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. A* algorithm 0

B. Dijkstra's algorithm 100

C. BFS algorithm 0

D. DFS algorithm 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

21
Question 22 (MC)
[122][SO1][60]
What is the primary advantage of A* search algorithm over Dijkstra's algorithm? MC
(1 Mark- [U/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A* guarantees finding the shortest
A. 0
path.
B. A* has lower time complexity. 0

C. A* has lower space complexity. 100

A* can handle infinite search

D. 0
spaces.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

22
Question 23 (MC)
[123][SO1][60]
In which scenario would Dijkstra's algorithm be preferred over A* search algorithm? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
When there is no heuristic
A. 0
information available.
B. When the search space is finite. 0

When the goal is to find the

C. shortest path to all nodes from the 100
start node.
D. When the search space is infinite. 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

23
Question 24 (MC)
[124][SO1][60]
Which algorithm is more suitable for real-time systems where memory consumption
is a concern? MC
(1 Mark-
[An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. A* algorithm 100

B. Dijkstra's algorithm 0

C. BFS algorithm 0

D. DFS algorithm 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

24
Question 25 (MC)
[125][SO1][60]
What aspect of A* search algorithm enables it to outperform Dijkstra's algorithm in
MC
pathfinding?
(1 Mark- [U/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. The use of a priority queue. 0

B. The use of heuristics. 100

C. The expansion phase. 0

D. The termination condition. 0

General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

25
Question 26 (MC)
[126][SO1][60]
Which aspect of A* search algorithm implementation contributes to its efficiency in
MC
finding optimal solutions?
(1 Mark- [Ap/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
The use of a priority queue for
A. 0
node expansion.
The admissibility of the heuristic
B. 0
function.
The selection of the node with the
C. 100
lowest 'f(n)' value.
The termination condition based on
D. 0
node evaluation.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

26
Question 27 (MC)
[127][SO1][60]
What does the closed list represent in the implementation of A* search algorithm? MC
(1 Mark- [U/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
The nodes expanded during the
A. 0
search.
The nodes for which the goal test
B. 0
has been conducted.
The nodes for which the heuristic
C. 0
function has been evaluated.
The nodes visited during the
D. 100
search.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

27
Question 28 (MC)
[128][SO1][60]
Which step in the implementation of A* search algorithm involves updating the 'f(n)'
MC
value of a node?
(1 Mark- [Ap/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Initialization 0

B. Expansion 100

C. Goal Test 0

D. Termination 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

28
Question 29 (MC)
[129][SO1][60]
What is the role of the open list in the implementation of A* search algorithm? MC
(1 Mark- [U/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
To store all the nodes expanded
A. 0
during the search.
To store the nodes for which the
B. 0
goal test has been conducted.
To store the nodes for which the
C. heuristic function has been 0
evaluated.
To store the nodes waiting to be
D. 100
expanded.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

29
Question 30 (MC)
[130][SO1][60]
Which data structure is commonly used to store the closed list in the
MC
implementation of A* search algorithm?
(1 Mark- [Ap/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Array 100

B. Linked list 0

C. Priority queue 0

D. Stack 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

30
Question 31 (MC)
[131][SO1][60]\
Which aspect of A* search algorithm contributes to its ability to handle complex
MC
problems efficiently?
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
The use of a priority queue for
A. 0
node expansion.
The admissibility of the heuristic
B. 100
function.
The ability to explore the entire
C. 0
search space.
The termination condition based on
D. 0
node evaluation.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

31
Question 32 (MC)
[132][SO1][60]
What distinguishes A* search algorithm from algorithms like Dijkstra's algorithm? MC
(1 Mark- [U/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A* always expands nodes in a
A. 0
depth-first manner.
A* uses a combination of cost and
B. 100
heuristic information.
C. A* has a higher time complexity. 0

A* guarantees finding the shortest

D. path to all nodes from the start 0
node.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

32
Question 33 (MC)
[133][SO1][60]
In which scenario would A* search algorithm NOT be suitable? MC
(1 Mark- [U/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
When the heuristic function is not
A. 100
admissible.
B. When the search space is finite. 0

When the problem involves only

C. 0
cost information.
When the goal is to find all possible
D. 0
solutions.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

33
Question 34 (MC)
[134][SO1][60]
What is the primary advantage of A* search algorithm over algorithms like BFS and
MC
DFS?
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A* guarantees finding the optimal
A. 100
solution.
B. A* has lower space complexity. 0

A* is always faster in terms of time

C. 0
complexity.
D. A* is easier to implement. 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

34
Question 35 (MC)
[135][SO1][60]
Which of the following statements best describes the need for A* search algorithm? MC
(1 Mark- [U/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
It can handle problems with no
A. 0
heuristic information efficiently.
It is primarily used for problems
B. 0
with only cost information.
It improves the efficiency of
C. 0
algorithms like BFS and DFS.
It handles problems with both
D. heuristic and cost information 100
effectively.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

35
Question 36 (MC)
[136][SO1][60]
In A* search algorithm, what does the 'g(n)' function represent? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. Heuristic function 0

Cost from the start node to the

B. 100
current node
Evaluation function combining cost
C. 0
and heuristic
Cost from the current node to the
D. 0
goal node
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

36
Question 37 (MC)
[137][SO1][60]
Which of the following is a characteristic of an admissible heuristic in A* search
MC
algorithm?
(1 Mark- [An/C,1])
Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
It overestimates the cost to reach
A. 0
the goal.
It underestimates the cost to reach
B. 100
the goal.
It ignores the cost to reach the
C. 0
goal.
It exactly estimates the cost to
D. 0
reach the goal.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

37
Question 38 (MC)
[138][SO1][60]
What is the purpose of the heuristic function in A* search algorithm? MC
(1 Mark- [U/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
To estimate the cost from the start
A. 100
node to the current node.
To determine the order of node
B. 0
expansion.
To calculate the exact cost from
C. 0
the current node to the goal node.
To ensure that the algorithm
D. 0
terminates.
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

38
Question 39 (MC)
[139][SO1][60]
Which of the following is true about A* search algorithm? MC
(1 Mark- [An/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
It is guaranteed to find the optimal
A. 100
solution.
It always expands nodes in a
B. 0
breadth-first manner.
It is not suitable for problems with
C. 0
heuristic information.
D. It has a time complexity of O(n^2). 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

39
Question 40 (MC)
[140][SO1][60]
What does A* stand for in the A* search algorithm? MC
(1 Mark- [R/C,1])

Default mark: 1
Shuffle the choices? Yes
Number the choices? A
Penalty for each incorrect try: 0
# Answers Feedback Grade
A. All Paths 0

B. Advanced Search 0

C. A Star 100

D. Algorithmic Search 0
General feedback:
For any correct response: Your answer is correct.
For any incorrect response: Your answer is incorrect.
Hint 1:
Show the number of correct
No
responses (Hint 1):
Clear incorrect responses (Hint 1): No
Tags:
Allows the selection of a single or multiple responses from a pre-defined list.
(MC/MA)

40