Professional Documents
Culture Documents
CAT 1 - Attempt Review
CAT 1 - Attempt Review
Dashboard My courses CCS 4302 & EIT 4316 CONTINOUS ASSESMENT TEST CAT 1
Question 1
Correct
Mark 1 out of 1
The correct answer is: It represents the total estimated cost of the cheapest solution through node n
Question 2
Incorrect
Mark 0 out of 1
https://elearning.tum.ac.ke/mod/quiz/review.php?attempt=136097&cmid=35443 1/8
3/2/23, 8:32 PM CAT 1: Attempt review
Mark 1 out of 1
a. Queue
b. Stack
c. Tree
d. Heap
Question 4
Correct
Mark 1 out of 1
What is A* Search?
The correct answer is: A search algorithm that uses heuristics to guide the search
Question 5
Correct
Mark 1 out of 1
The correct answer is: An entity that can perceive and act on its environment
https://elearning.tum.ac.ke/mod/quiz/review.php?attempt=136097&cmid=35443 2/8
3/2/23, 8:32 PM CAT 1: Attempt review
Mark 1 out of 1
The correct answer is: A search algorithm that explores the entire search space in a breadth-first manner
Question 7
Correct
Mark 1 out of 1
Question 8
Incorrect
Mark 0 out of 1
https://elearning.tum.ac.ke/mod/quiz/review.php?attempt=136097&cmid=35443 3/8
3/2/23, 8:32 PM CAT 1: Attempt review
Mark 1 out of 1
The correct answer is: A test to determine if a machine can exhibit human-like intelligence
Question 10
Correct
Mark 1 out of 1
Question 11
Correct
Mark 1 out of 1
Which of the following is a disadvantage of using A* Search for path finding problems?
https://elearning.tum.ac.ke/mod/quiz/review.php?attempt=136097&cmid=35443 4/8
3/2/23, 8:32 PM CAT 1: Attempt review
Mark 1 out of 1
Question 13
Correct
Mark 1 out of 1
a. Manhattan distance
b. Breadth-first search
c. Depth-limited search
d. Iterative deepening search
Question 14
Correct
Mark 1 out of 1
https://elearning.tum.ac.ke/mod/quiz/review.php?attempt=136097&cmid=35443 5/8
3/2/23, 8:32 PM CAT 1: Attempt review
Mark 1 out of 1
Which of the following is a limitation of using DFS for path finding in a maze?
Question 16
Incorrect
Mark 0 out of 1
Which of the following is a variant of A* Search that avoids exploring the same state multiple times?
a. Bidirectional A*
b. Recursive best-first search
c. Iterative deepening A*
d. Uniform-cost search
Question 17
Correct
Mark 1 out of 1
Which of the following is a variant of DFS that avoids visiting the same node twice?
a. Bidirectional search
b. Depth-limited search
c. Backtracking
d. Iterative deepening DFS
https://elearning.tum.ac.ke/mod/quiz/review.php?attempt=136097&cmid=35443 6/8
3/2/23, 8:32 PM CAT 1: Attempt review
Mark 1 out of 1
Which of the following is an example of a problem that can be solved using A* Search?
Question 19
Incorrect
Mark 0 out of 1
Question 20
Correct
Mark 1 out of 1
a. Machine Learning
b. Robotics
c. Cryptography
d. Neuroscience
Previous activity
◄ Module 4 Topic 2
Jump to...
https://elearning.tum.ac.ke/mod/quiz/review.php?attempt=136097&cmid=35443 7/8
3/2/23, 8:32 PM CAT 1: Attempt review
Stay in touch
www.tum.ac.ke
+254798 846816
odelhelpdesk@tum.ac.ke
https://elearning.tum.ac.ke/mod/quiz/review.php?attempt=136097&cmid=35443 8/8