Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Graphs/Spanning Tree and Shortest Paths Graph Search
Given below are two statements
Statement I : Breadth‐First Search is optimal when all the step costs are equal whereas uniform‐cost search is optimal with any step‐cost.
Statement II : When all the step costs are same uniform‐cost search expends more nodes at depth d than the Breadth‐First Search.
In light of the above statements, choose the correct answer from the options given below
1
Both Statement I and Statement II are true
2
Both Statement I and Statement II are false
3
Statement I is true but Statement II is false
4
Statement I is false but Statement II is true