Artificial-intelligence-algorithms
Question 1 |
Match List I with List II
Choose the correct answer from the options given below
Choose the correct answer from the options given below
A-II, B-IV, C-I, D-III
| |
A-II, B-III, C-I, D-IV | |
A-III, B-II, C-IV, D-I | |
A-III, B-IV, C-II, D-I |
Question 1 Explanation:
Greedy best-first search algorithm always selects the path which appears best at that moment. It is the combination of depth-first search and breadth-first search algorithms.
Time Complexity: The worst case time complexity of Greedy best first search is O(bm).
Space Complexity: The worst case space complexity of Greedy best first search is O(bm). Where, m is the maximum depth of the search space.
Complete: Greedy best-first search is also incomplete, even if the given state space is finite.
Optimal: Greedy best first search algorithm is not optimal.
Note:Refer the corresponding algorithms from standard sources.
Time Complexity: The worst case time complexity of Greedy best first search is O(bm).
Space Complexity: The worst case space complexity of Greedy best first search is O(bm). Where, m is the maximum depth of the search space.
Complete: Greedy best-first search is also incomplete, even if the given state space is finite.
Optimal: Greedy best first search algorithm is not optimal.
Note:Refer the corresponding algorithms from standard sources.
There is 1 question to complete.