CS 4408 Artificial Intelligence - Self-help quiz 3

.pdf

School

University of the People *

*We aren’t endorsed by this school

Course

4408

Subject

Computer Science

Date

Nov 24, 2024

Type

pdf

Pages

3

Uploaded by SargentStar10254

Report
CS 4408 Artificial Intelligence Self-help quiz Unit 3 Date: 29/06/2023
Question 1 Question text True or False: A Search algorithm is Optimal if no other search algorithm uses less time or space or fewer paths, while still guaranteeing quality solution. Select one: True False Feedback The correct answer is 'True'. Question 2 Question text Which of the following statements is not correct when we are dealing with a Breadth-First Search (BFS)? Select one: a. BFS performs best if the goal node lies in the upper left-hand side of the tree. b. BFS takes less memory space when compared with Depth-First Search. c. BFS doesn’t suffer from an infinite loop problem when a finite set of nodes is given. d. BFS is considered a blind search, because when a large search space is given, performance will be poor compare to other heuristic searches. Feedback Your answer is incorrect. The correct answer is: BFS takes less memory space when compared with Depth-First Search. Question 3 Question text Best-First search can be implemented using which of the following data structures: Select one: a. Queue b. Stack c. Priority Queue
d. Circular Queue Feedback Your answer is correct. The correct answer is: Priority Queue Question 4 Question text Which of the following statements is not correct regarding A * Search? Select one: a. It is complete when a finite set of nodes is given. b. It is optimally efficient, i.e. there is no other algorithm guaranteed to expand fewer nodes than A* Search algorithm. c. It takes less memory space compared to other search techniques. d. The speed of execution of A* search is highly dependent upon the accuracy of the heuristic function. Feedback Your answer is correct. The correct answer is: It takes less memory space compared to other search techniques. Question 5 Question text True or False: The main idea of bi-directional search is to reduce the time complexity by searching two ways simultaneously from start node and from the goal node. Select one: True False Feedback The correct answer is 'True'.
Your preview ends here
Eager to read complete document? Join bartleby learn and gain access to the full version
  • Access to all documents
  • Unlimited textbook solutions
  • 24/7 expert homework help