CS-7638 Final Exam 2026 Questions and Veriifed Answers| A+ Graded

CS-7638 Final Exam 2026 Questions and
Veriifed Answers| A+ Graded

A* is guaranteed to find the optimal path (True/False) -
ANSWER-True



Dynamic Programming (Dijkstra) is continuous (True/False) -
ANSWER-False



Dynamic Programming (Dijkstra) is guaranteed to find the
optimal path (True/False) - ANSWER-True



Path Smoothing is continuous (True/False) - ANSWER-True



Path Smoothing is guaranteed to find the optimal path
(True/False) - ANSWER-False



Path finding algorithm that only works for unweighted graphs
(BFS/Dijkstra/A*) - ANSWER-BFS



Path finding algorithm that gives the optimal path between
any two nodes, not just a source and a destination
(BFS/Dijkstra/A*) - ANSWER-Dijkstra



Path finding algorithm that uses a heuristic to improve
expected efficiency (BFS/Dijkstra/A*) - ANSWER-A*