2. [2 pt] What are the four measures used to evaluate a search algorithm, please

Question

2. [2 pt] What are the four measures used to evaluate a search algorithm, please explain the definition of each measure (1.0 pt)? Please fill in the following table for the listed search algorithms (1 pt) Please use following symbols and use O0 notation for time and space complexities b: branching factor mnimum step cost. C*: optimal path cost. s: depth of the shallowest solution. I: maximum depth of the search tree t: the depth limit. Performance Breath FirstDepth First Uniform Iterative Depth Limited Search easure Search Search Cost Search Search Complete? Optimal? ime Complexi Space Complexi

Explanation / Answer

2. The four measures used to evaluate a search algorithm are - Completeness, Optimality, Time complexity, Space complexity.

Complete?

O(b*m) : b = branching factor, m = maximum lengrh of any path.

Performance Measure Breath First Search Depth First Search Uniform Cost Search Iterative Deeping Search Depth Limited Search

Complete?

Complete if the branching factor (b) is not infinite. Not Complete complete complete Not complete Optimal? Optimal Not optimal Optimal optimal Not optimal Time Complexity O(V + E) : V = no of vertices & E is no edges in the graph. O(V + E) : V = no of vertices & E is no edges in the graph. O(b^(1+C/)) O(bd) : d = depth of the goal. O(bI) : l is depth limit Space Complexity O(h) : h = maximum depth

O(b*m) : b = branching factor, m = maximum lengrh of any path.

O(b^(1+C/)) O(d) : d = depth of the goal. O(bI) : l is depth limit

Related Questions

Navigate

• Browse (All)
• Browse 2
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.