Question 14116 – NIC-NIELIT STA 2020
November 30, 2023NTA UGC NET JUNE-2023 Paper-2
November 30, 2023Question 14117 – NIC-NIELIT STA 2020
Which of the following algorithms can be used to most efficiently find whether a cycle is present in a given graph?
Correct Answer: C
Question 50 Explanation:
DFS is the most efficient algorithm to find the cycle.
BFS, Prims and Kruskal’s also find the cycle but DFS will give better results.
Both BFS and DFS will give answer in O(V+E) time.
BFS, Prims and Kruskal’s also find the cycle but DFS will give better results.
Both BFS and DFS will give answer in O(V+E) time.
Prim’s Minimum Spanning Tree
Breadth First Search
Depth First Search
Kruskal’s Minimum Spanning Tree Algorithm