Search Algorithms Questions
AICC 101 - AI and Computing Concepts I Past Papers

Practice 2 past-paper questions for Search Algorithms in AICC 101 - AI and Computing Concepts I. Get solutions and exam preparation resources.

Click on a question to view the full answer

1. Which of the following is an example of an uninformed search algorithm?

2. If a goal node is at depth d and there are b branches per node, what is the worst-case space complexity of BFS?

Sponsor Space